Use preallocated StackOverflowException

runtime/vm/code_generator.cc

 // Copyright (c) 2011, 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 "vm/code_generator.h"
 
 #include "vm/code_index_table.h"
 #include "vm/code_patcher.h"
 #include "vm/compiler.h"
 #include "vm/dart_api_impl.h"
@@ skipping 811 matching lines @@
   ASSERT(arguments.Count() ==
          kClosureArgumentMismatchRuntimeEntry.argument_count());
   GrowableArray<const Object*> args;
   Exceptions::ThrowByType(Exceptions::kClosureArgumentMismatch, args);
 }
 
 
 DEFINE_RUNTIME_ENTRY(StackOverflow, 0) {
   ASSERT(arguments.Count() ==
          kStackOverflowRuntimeEntry.argument_count());
-  uword old_stack_limit = isolate->stack_limit();
-  isolate->AdjustStackLimitForException();
-  // Recursive stack overflow check.
-  ASSERT(old_stack_limit != isolate->stack_limit());
-  GrowableArray<const Object*> args;
-  Exceptions::ThrowByType(Exceptions::kStackOverflow, args);
-  isolate->ResetStackLimitAfterException();
+  // Use a preallocated stack overflow exception to avoid calling into
+  // dart code.
+  const Instance& exception =
+      Instance::Handle(isolate->object_store()->stack_overflow());
+  Exceptions::Throw(exception);
+  UNREACHABLE();
 }
 
 
 // Only unoptimized code has invocation counter threshold checking.
 // Once the invocation counter threshold is reached any entry into the
 // unoptimized code is redirected to this function.
 DEFINE_RUNTIME_ENTRY(OptimizeInvokedFunction, 1) {
   ASSERT(arguments.Count() ==
          kOptimizeInvokedFunctionRuntimeEntry.argument_count());
   const Function& function = Function::CheckedHandle(arguments.At(0));
@@ skipping 198 matching lines @@
       }
     }
   }
   // The cache is null terminated, therefore the loop above should never
   // terminate by itself.
   UNREACHABLE();
   return Code::null();
 }
 
 }  // namespace dart