Change the generated dart test in CodeIndexTableTest so that it does not induce a deep recursion in…

vm/code_index_table_test.cc

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "platform/assert.h"
 #include "vm/class_finalizer.h"
 #include "vm/code_index_table.h"
 #include "vm/compiler.h"
 #include "vm/object.h"
+#include "vm/pages.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 // Compiler only implemented on IA32 and x64 now.
 #if defined(TARGET_ARCH_IA32) || defined(TARGET_ARCH_X64)
 
 TEST_CASE(CodeIndexTable) {
   const int kScriptSize = 512 * KB;
   const int kNumFunctions = 1024;
@@ skipping 38 matching lines @@
     function_name = String::New(buffer);
     function = clsA.LookupStaticFunction(function_name);
     EXPECT(!function.IsNull());
     EXPECT(CompilerTest::TestCompileFunction(function));
     EXPECT(function.HasCode());
   }
 
   // Now load up class B with 1024 functions.
   written = OS::SNPrint(scriptChars, kScriptSize, "class B {");
   // Create one large function.
-  OS::SNPrint(buffer, sizeof(buffer), "static moo0([int i=1]) { return ");
+  OS::SNPrint(buffer, sizeof(buffer), "static moo0([int i=1]) { ");
   written += OS::SNPrint((scriptChars + written),
                          (kScriptSize - written),
                          "%s",
                          buffer);
-  // Currently this causes about 750KB of code to be allocated.  The
-  // nesting level of binary operations is reduced from 50000 so this
-  // test will pass on Windows. Larger nesting leads to stack overflow
-  // in debug mode in the code generation visitor even when the stack
-  // reserved size is set to 2MB.
-  for (int i = 0; i < 35000; i++) {
-    OS::SNPrint(buffer, sizeof(buffer), "i+");
+  // Generate a large function so that the code for this function when
+  // compiled will reside in a large page.
+  for (int i = 0; i < 50000; i++) {
+    OS::SNPrint(buffer, sizeof(buffer), "i = i+i;");
     written += OS::SNPrint((scriptChars + written),
                            (kScriptSize - written),
                            "%s",
                            buffer);
   }
-  OS::SNPrint(buffer, sizeof(buffer), "i; }");
+  OS::SNPrint(buffer, sizeof(buffer), "return i; }");
   written += OS::SNPrint((scriptChars + written),
                          (kScriptSize - written),
                          "%s",
                          buffer);
   for (int i = 1; i < kNumFunctions; i++) {
     OS::SNPrint(buffer,
                 256,
                 "static moo%d([int i=1,int j=2,int k=3]){return i+j+k;}", i);
     written += OS::SNPrint((scriptChars + written),
                            (kScriptSize - written),
@@ skipping 41 matching lines @@
   EXPECT(code_index_table->LookupCode(pc) == code.raw());
 
   // Lookup the large function
   OS::SNPrint(buffer, 256, "moo%d", 0);
   function_name = String::New(buffer);
   function = clsB.LookupStaticFunction(function_name);
   EXPECT(!function.IsNull());
   code = function.code();
   EXPECT(code.Size() > 16);
   pc = code.EntryPoint() + 16;
+  EXPECT(code.Size() > PageSpace::kPageSize);
   EXPECT(code_index_table->LookupFunction(pc) == function.raw());
   EXPECT(code_index_table->LookupCode(pc) == code.raw());
-  EXPECT(code.Size() > 750 * KB);
-  pc = code.EntryPoint() + 750 * KB;
+  EXPECT(code.Size() > (1 * MB));
+  pc = code.EntryPoint() + (1 * MB);
   EXPECT(code_index_table->LookupFunction(pc) == function.raw());
   EXPECT(code_index_table->LookupCode(pc) == code.raw());
 }
 
 #endif  // TARGET_ARCH_IA32 || TARGET_ARCH_X64
 
 }  // namespace dart