S390: Initial test changes and files checkin.

test/mjsunit/regress/regress-crbug-178790.js

 // Copyright 2013 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
@@ skipping 10 matching lines @@
 // 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.
 
 // Create a regexp in the form of a?a?...a? so that fully
 // traversing the entire graph would be prohibitively expensive.
 // This should not cause time out.
+// S390X uses more stack space for recursion calls.
+
+// Flags: --stack-size=8192

[Jakob Kummerow, 2016/03/15 14:58:04]

This is a lot, considering that the default value is 984K, and on Windows a
process will get killed when it uses more than 1024K.

Have you tested this on all platforms and operating systems? What's special
about this test's stack consumption? What happens when you don't set the extra
flag? Would it make sense to set an s390 specific V8_DEFAULT_STACK_SIZE_KB value
in globals.h instead? 

+
 var r1 = "";
 for (var i = 0; i < 1000; i++) {
   r1 += "a?";
 }
 "test".match(RegExp(r1));
 
 var r2 = "";
 for (var i = 0; i < 100; i++) {
   r2 += "(a?|b?|c?|d?|e?|f?|g?)";
 }
 "test".match(RegExp(r2));
 
 // Create a regexp in the form of ((..(a)a..)a.
 // Compiling it causes EatsAtLeast to reach the maximum
 // recursion depth possible with a given budget.
 // This should not cause a stack overflow.
 var r3 = "a";
 for (var i = 0; i < 1000; i++) {
   r3 = "(" + r3 + ")a";
 }
 "test".match(RegExp(r3));