diff --git a/AUTHORS b/AUTHORS
new file mode 100644
index 000000000000..7bdd7f775278
--- /dev/null
+++ b/AUTHORS
@@ -0,0 +1,11 @@
+# Below is a list of people and organizations that have contributed
+# to the V8 project.  Names should be added to the list like so:
+#
+#   Name/Organization <email address>
+
+Google Inc.
+
+Rene Rebe <rene@exactcode.de>
+Rafal Krypa <rafal@krypa.net>
+Jay Freeman <saurik@saurik.com>
+Daniel James <dnljms@gmail.com>
diff --git a/ChangeLog b/ChangeLog
index b93a44ce92cd..33cfd0b886f4 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,48 @@
+2008-09-11: Version 0.3.1
+
+        Fixed a number of build issues.
+
+        Fixed problem with missing I-cache flusing on ARM.
+
+        Changed space layout in memory management by splitting up
+        code space into old data space and code space.
+
+        Added utf-8 conversion support to the API (issue 57).
+
+        Optimized repeated calls to eval with the same strings.  These
+        repeated calls are common in web applications.
+
+        Added Xcode project file.
+
+        Optimized a couple of Array operation.
+
+        Fixed parser bug by checking for end-of-string when parsing break
+        and continue (issue 35).
+
+        Fixed problem where asian characters were not categorized as
+        letters.
+
+        Fixed bug that disallowed calling functions fetched from an array
+        using a string as an array index (issue 32).
+
+        Fixed bug where the internal field count on object templates were
+        sometimes ignored (issue 54).
+
+        Added -f option to the shell sample for compatibility with other
+        engines (issue 18).
+
+        Added source info to TryCatches in the API.
+
+        Fixed problem where the seed for the random number generator was
+        clipped in a double to unsigned int conversion.
+
+        Fixed bug where cons string symbols were sometimes converted to
+        non-symbol flat strings during GC.
+
+        Fixed bug in error reporting when attempting to convert null to an
+        object.
+        
+        
 2008-09-04: Version 0.3.0
 
         Added support for running tests on the ARM simulator.
diff --git a/SConstruct b/SConstruct
index 34f20d340ac7..a2bed5652c1c 100644
--- a/SConstruct
+++ b/SConstruct
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -30,6 +30,7 @@ import re
 import sys
 import os
 from os.path import join, dirname, abspath
+from types import DictType
 root_dir = dirname(File('SConstruct').rfile().abspath)
 sys.path.append(join(root_dir, 'tools'))
 import js2c, utils
@@ -55,8 +56,9 @@ LIBRARY_FLAGS = {
       'CCFLAGS':      ['-O2']
     },
     'wordsize:64': {
-      'CCFLAGS':      ['-m32']
-    },
+      'CCFLAGS':      ['-m32'],
+      'LINKFLAGS':    ['-m32']
+    }
   },
   'msvc': {
     'all': {
@@ -95,6 +97,9 @@ V8_EXTRA_FLAGS = {
     'arch:arm': {
       'CPPDEFINES':   ['ARM']
     },
+    'disassembler:on': {
+      'CPPDEFINES':   ['ENABLE_DISASSEMBLER']
+    }
   },
   'msvc': {
     'all': {
@@ -106,6 +111,9 @@ V8_EXTRA_FLAGS = {
     'arch:arm': {
       'CPPDEFINES':   ['ARM']
     },
+    'disassembler:on': {
+      'CPPDEFINES':   ['ENABLE_DISASSEMBLER']
+    }
   }
 }
 
@@ -182,6 +190,9 @@ SAMPLE_FLAGS = {
       'CCFLAGS':      ['-m32'],
       'LINKFLAGS':    ['-m32']
     },
+    'mode:debug': {
+      'CCFLAGS':      ['-g', '-O0']
+    }
   },
   'msvc': {
     'all': {
@@ -281,6 +292,16 @@ SIMPLE_OPTIONS = {
     'values': ['arm', 'none'],
     'default': 'none',
     'help': 'build with simulator'
+  },
+  'disassembler': {
+    'values': ['on', 'off'],
+    'default': 'off',
+    'help': 'enable the disassembler to inspect generated code'
+  },
+  'sourcesignatures': {
+    'values': ['MD5', 'timestamp'],
+    'default': 'MD5',
+    'help': 'set how the build system detects file changes'
   }
 }
 
@@ -369,6 +390,14 @@ class BuildContext(object):
     else:
       return env.SharedObject(input, **kw)
 
+  def ApplyEnvOverrides(self, env):
+    if not self.env_overrides:
+      return
+    if type(env['ENV']) == DictType:
+      env['ENV'].update(**self.env_overrides)
+    else:
+      env['ENV'] = self.env_overrides
+
 
 def PostprocessOptions(options):
   # Adjust architecture if the simulator option has been set
@@ -427,6 +456,7 @@ def BuildSpecific(env, mode, env_overrides):
   )
   
   # Link the object files into a library.
+  context.ApplyEnvOverrides(env)
   if context.options['library'] == 'static':
     library = env.StaticLibrary(library_name, object_files)
   else:
@@ -440,7 +470,7 @@ def BuildSpecific(env, mode, env_overrides):
   for sample in context.samples:
     sample_env = Environment(LIBRARY=library_name)
     sample_env.Replace(**context.flags['sample'])
-    sample_env['ENV'].update(**context.env_overrides)
+    context.ApplyEnvOverrides(sample_env)
     sample_object = sample_env.SConscript(
       join('samples', 'SConscript'),
       build_dir=join('obj', 'sample', sample, target_id),
@@ -470,6 +500,8 @@ def Build():
   VerifyOptions(env)
   env_overrides = ParseEnvOverrides(env['env'])
   
+  SourceSignatures(env['sourcesignatures'])
+  
   libraries = []
   cctests = []
   samples = []
diff --git a/benchmarks/base.js b/benchmarks/base.js
index d3c9dcaec982..55e717d868c9 100644
--- a/benchmarks/base.js
+++ b/benchmarks/base.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/benchmarks/deltablue.js b/benchmarks/deltablue.js
index b18efa4306da..b51afd1d2dea 100644
--- a/benchmarks/deltablue.js
+++ b/benchmarks/deltablue.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 the V8 project authors. All rights reserved.
 // Copyright 1996 John Maloney and Mario Wolczko.
 
 // This program is free software; you can redistribute it and/or modify
diff --git a/benchmarks/richards.js b/benchmarks/richards.js
index 8cced90bd097..7df363d9803e 100644
--- a/benchmarks/richards.js
+++ b/benchmarks/richards.js
@@ -1,4 +1,4 @@
-// Copyright 2007 Google Inc. All rights reserved.
+// Copyright 2006-2008 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:
diff --git a/benchmarks/run.js b/benchmarks/run.js
index 8302535d411b..7a1c89584a20 100644
--- a/benchmarks/run.js
+++ b/benchmarks/run.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/codereview.settings b/codereview.settings
new file mode 100644
index 000000000000..e83396c25d5f
--- /dev/null
+++ b/codereview.settings
@@ -0,0 +1,4 @@
+# This file is used by gcl to get repository specific information.
+CODE_REVIEW_SERVER: codereview.chromium.org
+VIEW_VC: http://code.google.com/p/v8/source/detail?r=
+CC_LIST: v8-dev@googlegroups.com
diff --git a/include/v8-debug.h b/include/v8-debug.h
index 8881e4a2965c..f537d7dc891f 100644
--- a/include/v8-debug.h
+++ b/include/v8-debug.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -25,8 +25,8 @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-#ifndef _V8_DEBUG
-#define _V8_DEBUG
+#ifndef V8_DEBUG_H_
+#define V8_DEBUG_H_
 
 #include "v8.h"
 
@@ -140,4 +140,4 @@ class EXPORT Debug {
 #undef EXPORT
 
 
-#endif  // _V8_DEBUG
+#endif  // V8_DEBUG_H_
diff --git a/include/v8.h b/include/v8.h
index ddd423e0e4a9..fd6d9ab2783e 100644
--- a/include/v8.h
+++ b/include/v8.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -26,8 +26,8 @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 /** \mainpage V8 API Reference Guide
- *	
- * V8 is Google's open source JavaScript engine. 
+ *
+ * V8 is Google's open source JavaScript engine.
  *
  * This set of documents provides reference material generated from the
  * V8 header file, include/v8.h.
@@ -35,8 +35,8 @@
  * For other documentation see http://code.google.com/apis/v8/
  */
 
-#ifndef _V8
-#define _V8
+#ifndef V8_H_
+#define V8_H_
 
 #include <stdio.h>
 
@@ -461,10 +461,8 @@ class EXPORT HandleScope {
   /** Deallocates any extensions used by the current scope.*/
   static void DeleteExtensions();
 
-#ifdef DEBUG
   // Zaps the handles in the half-open interval [start, end).
   static void ZapRange(void** start, void** end);
-#endif
 
   friend class ImplementationUtilities;
 };
@@ -485,7 +483,7 @@ class EXPORT Data {
 /**
  * Pre-compilation data that can be associated with a script.  This
  * data can be calculated for a script in advance of actually
- * compiling it, and can bestored between compilations.  When script 
+ * compiling it, and can be stored between compilations.  When script
  * data is given to the compile method compilation will be faster.
  */
 class EXPORT ScriptData {  // NOLINT
@@ -555,7 +553,7 @@ class EXPORT Script {
 class EXPORT Message {
  public:
   Local<String> Get();
-  Local<Value> GetSourceLine();
+  Local<String> GetSourceLine();
 
   // TODO(1241256): Rewrite (or remove) this method.  We don't want to
   // deal with ownership of the returned string and we want to use
@@ -568,8 +566,35 @@ class EXPORT Message {
   // bindings.
   Handle<Value> GetSourceData();
 
+  /**
+   * Returns the number, 1-based, of the line where the error occurred.
+   */
   int GetLineNumber();
 
+  /**
+   * Returns the index within the script of the first character where
+   * the error occurred.
+   */
+  int GetStartPosition();
+
+  /**
+   * Returns the index within the script of the last character where
+   * the error occurred.
+   */
+  int GetEndPosition();
+
+  /**
+   * Returns the index within the line of the first character where
+   * the error occurred.
+   */
+  int GetStartColumn();
+
+  /**
+   * Returns the index within the line of the last character where
+   * the error occurred.
+   */
+  int GetEndColumn();
+
   // TODO(1245381): Print to a string instead of on a FILE.
   static void PrintCurrentStackTrace(FILE* out);
 };
@@ -631,7 +656,7 @@ class EXPORT Value : public Data {
    * Returns true if this value is boolean.
    */
   bool IsBoolean();
-  
+
   /**
    * Returns true if this value is a number.
    */
@@ -696,8 +721,18 @@ class EXPORT Boolean : public Primitive {
  */
 class EXPORT String : public Primitive {
  public:
+
+  /**
+   * Returns the number of characters in this string.
+   */
   int Length();
 
+  /**
+   * Returns the number of bytes in the UTF-8 encoded
+   * representation of this string.
+   */
+  int Utf8Length();
+
   /**
    * Write the contents of the string to an external buffer.
    * If no arguments are given, expects the buffer to be large
@@ -716,9 +751,8 @@ class EXPORT String : public Primitive {
    * excluding the NULL terminator.
    */
   int Write(uint16_t* buffer, int start = 0, int length = -1);  // UTF-16
-  int WriteAscii(char* buffer,
-                 int start = 0,
-                 int length = -1);  // literally ascii
+  int WriteAscii(char* buffer, int start = 0, int length = -1);  // ASCII
+  int WriteUtf8(char* buffer, int length = -1); // UTF-8
 
   /**
    * Returns true if the string is external
@@ -733,7 +767,7 @@ class EXPORT String : public Primitive {
    * An ExternalStringResource is a wrapper around a two-byte string
    * buffer that resides outside V8's heap. Implement an
    * ExternalStringResource to manage the life cycle of the underlying
-   * buffer.
+   * buffer.  Note that the string data must be immutable.
    */
   class EXPORT ExternalStringResource {  // NOLINT
    public:
@@ -757,7 +791,11 @@ class EXPORT String : public Primitive {
    * An ExternalAsciiStringResource is a wrapper around an ascii
    * string buffer that resides outside V8's heap. Implement an
    * ExternalAsciiStringResource to manage the life cycle of the
-   * underlying buffer.
+   * underlying buffer.  Note that the string data must be immutable
+   * and that the data must be strict 7-bit ASCII, not Latin1 or
+   * UTF-8, which would require special treatment internally in the
+   * engine and, in the case of UTF-8, do not allow efficient indexing.
+   * Use String::New or convert to 16 bit data for non-ASCII.
    */
 
   class EXPORT ExternalAsciiStringResource {  // NOLINT
@@ -835,6 +873,21 @@ class EXPORT String : public Primitive {
   /** Creates an undetectable string from the supplied utf-16 data.*/
   static Local<String> NewUndetectable(const uint16_t* data, int length = -1);
 
+  /**
+   * Converts an object to a utf8-encoded character array.  Useful if
+   * you want to print the object.
+   */
+  class EXPORT Utf8Value {
+   public:
+    explicit Utf8Value(Handle<v8::Value> obj);
+    ~Utf8Value();
+    char* operator*() { return str_; }
+    int length() { return length_; }
+   private:
+    char* str_;
+    int length_;
+  };
+
   /**
    * Converts an object to an ascii string.
    * Useful if you want to print the object.
@@ -844,8 +897,10 @@ class EXPORT String : public Primitive {
     explicit AsciiValue(Handle<v8::Value> obj);
     ~AsciiValue();
     char* operator*() { return str_; }
+    int length() { return length_; }
    private:
     char* str_;
+    int length_;
   };
 
   /**
@@ -856,8 +911,10 @@ class EXPORT String : public Primitive {
     explicit Value(Handle<v8::Value> obj);
     ~Value();
     uint16_t* operator*() { return str_; }
+    int length() { return length_; }
    private:
     uint16_t* str_;
+    int length_;
   };
 };
 
@@ -1755,7 +1812,7 @@ class EXPORT V8 {
   static void IgnoreOutOfMemoryException();
 
   /**
-   * Check if V8 is dead and therefore unusable.  This is the case after 
+   * Check if V8 is dead and therefore unusable.  This is the case after
    * fatal errors such as out-of-memory situations.
    */
   static bool IsDead();
@@ -1900,6 +1957,15 @@ class EXPORT TryCatch {
    */
   Local<Value> Exception();
 
+  /**
+   * Returns the message associated with this exception.  If there is
+   * no message associated an empty handle is returned.
+   *
+   * The returned handle is valid until this TryCatch block has been
+   * destroyed.
+   */
+  Local<v8::Message> Message();
+
   /**
    * Clears any exceptions that may have been caught by this try/catch block.
    * After this method has been called, HasCaught() will return false.
@@ -1921,10 +1987,19 @@ class EXPORT TryCatch {
    */
   void SetVerbose(bool value);
 
+  /**
+   * Set whether or not this TryCatch should capture a Message object
+   * which holds source information about where the exception
+   * occurred.  True by default.
+   */
+  void SetCaptureMessage(bool value);
+
  public:
   TryCatch* next_;
   void* exception_;
+  void* message_;
   bool is_verbose_;
+  bool capture_message_;
 };
 
 
@@ -2116,11 +2191,11 @@ class EXPORT Locker {
    */
   static void StopPreemption();
 
-#ifdef DEBUG
-  static void AssertIsLocked();
-#else
-  static inline void AssertIsLocked() { }
-#endif
+  /**
+   * Returns whether or not the locker is locked by the current thread.
+   */
+  static bool IsLocked();
+
  private:
   bool has_lock_;
   bool top_level_;
@@ -2302,4 +2377,4 @@ void Template::Set(const char* name, v8::Handle<Data> value) {
 #undef TYPE_CHECK
 
 
-#endif  // _V8
+#endif  // V8_H_
diff --git a/samples/SConscript b/samples/SConscript
index bab66418fcc4..31990b681be3 100644
--- a/samples/SConscript
+++ b/samples/SConscript
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -31,6 +31,7 @@ Import('sample context')
 def ConfigureObjectFiles():
   env = Environment()
   env.Replace(**context.flags['sample'])
+  context.ApplyEnvOverrides(env)
   return env.Object(sample + '.cc')
 
 sample_object = ConfigureObjectFiles()
diff --git a/samples/count-hosts.js b/samples/count-hosts.js
index 5c714c3e03bd..bea6553d27bb 100644
--- a/samples/count-hosts.js
+++ b/samples/count-hosts.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/samples/process.cc b/samples/process.cc
index c0710f323a27..6567f080b86a 100644
--- a/samples/process.cc
+++ b/samples/process.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -137,7 +137,7 @@ static Handle<Value> LogCallback(const Arguments& args) {
   if (args.Length() < 1) return v8::Undefined();
   HandleScope scope;
   Handle<Value> arg = args[0];
-  String::AsciiValue value(arg);
+  String::Utf8Value value(arg);
   HttpRequestProcessor::Log(*value);
   return v8::Undefined();
 }
@@ -206,7 +206,7 @@ bool JsHttpRequestProcessor::ExecuteScript(Handle<String> script) {
   // Compile the script and check for errors.
   Handle<Script> compiled_script = Script::Compile(script);
   if (compiled_script.IsEmpty()) {
-    String::AsciiValue error(try_catch.Exception());
+    String::Utf8Value error(try_catch.Exception());
     Log(*error);
     // The script failed to compile; bail out.
     return false;
@@ -216,7 +216,7 @@ bool JsHttpRequestProcessor::ExecuteScript(Handle<String> script) {
   Handle<Value> result = compiled_script->Run();
   if (result.IsEmpty()) {
     // The TryCatch above is still in effect and will have caught the error.
-    String::AsciiValue error(try_catch.Exception());
+    String::Utf8Value error(try_catch.Exception());
     Log(*error);
     // Running the script failed; bail out.
     return false;
@@ -262,7 +262,7 @@ bool JsHttpRequestProcessor::Process(HttpRequest* request) {
   Handle<Value> argv[argc] = { request_obj };
   Handle<Value> result = process_->Call(context_->Global(), argc, argv);
   if (result.IsEmpty()) {
-    String::AsciiValue error(try_catch.Exception());
+    String::Utf8Value error(try_catch.Exception());
     Log(*error);
     return false;
   } else {
@@ -332,8 +332,8 @@ map<string, string>* JsHttpRequestProcessor::UnwrapMap(Handle<Object> obj) {
 // Convert a JavaScript string to a std::string.  To not bother too
 // much with string encodings we just use ascii.
 string ObjectToString(Local<Value> value) {
-  String::AsciiValue ascii_value(value);
-  return string(*ascii_value);
+  String::Utf8Value utf8_value(value);
+  return string(*utf8_value);
 }
 
 
diff --git a/samples/shell.cc b/samples/shell.cc
index 38d77dc2aa36..eecd2b00689c 100644
--- a/samples/shell.cc
+++ b/samples/shell.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -34,13 +34,14 @@
 void RunShell(v8::Handle<v8::Context> context);
 bool ExecuteString(v8::Handle<v8::String> source,
                    v8::Handle<v8::Value> name,
-                   bool print_result);
+                   bool print_result,
+                   bool report_exceptions);
 v8::Handle<v8::Value> Print(const v8::Arguments& args);
 v8::Handle<v8::Value> Load(const v8::Arguments& args);
 v8::Handle<v8::Value> Quit(const v8::Arguments& args);
 v8::Handle<v8::Value> Version(const v8::Arguments& args);
 v8::Handle<v8::String> ReadFile(const char* name);
-void ProcessRuntimeFlags(int argc, char* argv[]);
+void ReportException(v8::TryCatch* handler);
 
 
 int main(int argc, char* argv[]) {
@@ -66,6 +67,10 @@ int main(int argc, char* argv[]) {
     const char* str = argv[i];
     if (strcmp(str, "--shell") == 0) {
       run_shell = true;
+    } else if (strcmp(str, "-f") == 0) {
+      // Ignore any -f flags for compatibility with the other stand-
+      // alone JavaScript engines.
+      continue;
     } else if (strncmp(str, "--", 2) == 0) {
       printf("Warning: unknown flag %s.\n", str);
     } else {
@@ -77,7 +82,7 @@ int main(int argc, char* argv[]) {
         printf("Error reading '%s'\n", str);
         return 1;
       }
-      if (!ExecuteString(source, file_name, false))
+      if (!ExecuteString(source, file_name, false, true))
         return 1;
     }
   }
@@ -98,7 +103,7 @@ v8::Handle<v8::Value> Print(const v8::Arguments& args) {
     } else {
       printf(" ");
     }
-    v8::String::AsciiValue str(args[i]);
+    v8::String::Utf8Value str(args[i]);
     printf("%s", *str);
   }
   printf("\n");
@@ -112,12 +117,14 @@ v8::Handle<v8::Value> Print(const v8::Arguments& args) {
 v8::Handle<v8::Value> Load(const v8::Arguments& args) {
   for (int i = 0; i < args.Length(); i++) {
     v8::HandleScope handle_scope;
-    v8::String::AsciiValue file(args[i]);
+    v8::String::Utf8Value file(args[i]);
     v8::Handle<v8::String> source = ReadFile(*file);
     if (source.IsEmpty()) {
       return v8::ThrowException(v8::String::New("Error loading file"));
     }
-    ExecuteString(source, v8::String::New(*file), false);
+    if (!ExecuteString(source, v8::String::New(*file), false, false)) {
+      return v8::ThrowException(v8::String::New("Error executing  file"));
+    }
   }
   return v8::Undefined();
 }
@@ -171,7 +178,10 @@ void RunShell(v8::Handle<v8::Context> context) {
     char* str = fgets(buffer, kBufferSize, stdin);
     if (str == NULL) break;
     v8::HandleScope handle_scope;
-    ExecuteString(v8::String::New(str), v8::Undefined(), true);
+    ExecuteString(v8::String::New(str),
+                  v8::String::New("(shell)"),
+                  true,
+                  true);
   }
   printf("\n");
 }
@@ -180,30 +190,61 @@ void RunShell(v8::Handle<v8::Context> context) {
 // Executes a string within the current v8 context.
 bool ExecuteString(v8::Handle<v8::String> source,
                    v8::Handle<v8::Value> name,
-                   bool print_result) {
+                   bool print_result,
+                   bool report_exceptions) {
   v8::HandleScope handle_scope;
   v8::TryCatch try_catch;
   v8::Handle<v8::Script> script = v8::Script::Compile(source, name);
   if (script.IsEmpty()) {
     // Print errors that happened during compilation.
-    v8::String::AsciiValue error(try_catch.Exception());
-    printf("%s\n", *error);
+    if (report_exceptions)
+      ReportException(&try_catch);
     return false;
   } else {
     v8::Handle<v8::Value> result = script->Run();
     if (result.IsEmpty()) {
       // Print errors that happened during execution.
-      v8::String::AsciiValue error(try_catch.Exception());
-      printf("%s\n", *error);
+      if (report_exceptions)
+        ReportException(&try_catch);
       return false;
     } else {
       if (print_result && !result->IsUndefined()) {
         // If all went well and the result wasn't undefined then print
         // the returned value.
-        v8::String::AsciiValue str(result);
+        v8::String::Utf8Value str(result);
         printf("%s\n", *str);
       }
       return true;
     }
   }
 }
+
+
+void ReportException(v8::TryCatch* try_catch) {
+  v8::HandleScope handle_scope;
+  v8::String::Utf8Value exception(try_catch->Exception());
+  v8::Handle<v8::Message> message = try_catch->Message();
+  if (message.IsEmpty()) {
+    // V8 didn't provide any extra information about this error; just
+    // print the exception.
+    printf("%s\n", *exception);
+  } else {
+    // Print (filename):(line number): (message).
+    v8::String::Utf8Value filename(message->GetScriptResourceName());
+    int linenum = message->GetLineNumber();
+    printf("%s:%i: %s\n", *filename, linenum, *exception);
+    // Print line of source code.
+    v8::String::Utf8Value sourceline(message->GetSourceLine());
+    printf("%s\n", *sourceline);
+    // Print wavy underline (GetUnderline is deprecated).
+    int start = message->GetStartColumn();
+    for (int i = 0; i < start; i++) {
+      printf(" ");
+    }
+    int end = message->GetEndColumn();
+    for (int i = start; i < end; i++) {
+      printf("^");
+    }
+    printf("\n");
+  }
+}
diff --git a/src/SConscript b/src/SConscript
index 15ec440fea05..cc39e2271a73 100644
--- a/src/SConscript
+++ b/src/SConscript
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -97,7 +97,7 @@ def Abort(message):
 def ConfigureObjectFiles():
   env = Environment()
   env.Replace(**context.flags['v8'])
-  env['ENV'].update(**context.env_overrides)
+  context.ApplyEnvOverrides(env)
   env['BUILDERS']['JS2C'] = Builder(action=js2c.JS2C)
   env['BUILDERS']['Snapshot'] = Builder(action='$SOURCE $TARGET --logfile $LOGFILE')
 
diff --git a/src/accessors.cc b/src/accessors.cc
index 4895f685a032..f02894b53cc2 100644
--- a/src/accessors.cc
+++ b/src/accessors.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/accessors.h b/src/accessors.h
index da1a03750f9e..6fb3195e9b76 100644
--- a/src/accessors.h
+++ b/src/accessors.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/allocation.cc b/src/allocation.cc
index 66506369351c..d7d21aaa68fa 100644
--- a/src/allocation.cc
+++ b/src/allocation.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/allocation.h b/src/allocation.h
index 5c9ff5e911ca..35e68bde04bf 100644
--- a/src/allocation.h
+++ b/src/allocation.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/api.cc b/src/api.cc
index 352d4d46b7dc..8cf4b62ed5c8 100644
--- a/src/api.cc
+++ b/src/api.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -446,14 +446,12 @@ void v8::HandleScope::DeleteExtensions() {
 }
 
 
-#ifdef DEBUG
 void HandleScope::ZapRange(void** start, void** end) {
   if (start == NULL) return;
   for (void** p = start; p < end; p++) {
     *p = reinterpret_cast<void*>(v8::internal::kHandleZapValue);
   }
 }
-#endif
 
 
 void** v8::HandleScope::RawClose(void** value) {
@@ -981,6 +979,12 @@ void ObjectTemplate::SetInternalFieldCount(int value) {
                 "Invalid internal field count")) {
     return;
   }
+  if (value > 0) {
+    // The internal field count is set by the constructor function's
+    // construct code, so we ensure that there is a constructor
+    // function to do the setting.
+    EnsureConstructor(this);
+  }
   Utils::OpenHandle(this)->set_internal_field_count(i::Smi::FromInt(value));
 }
 
@@ -1077,7 +1081,9 @@ Local<Value> Script::Run() {
 v8::TryCatch::TryCatch()
     : next_(i::Top::try_catch_handler()),
       exception_(i::Heap::the_hole_value()),
-      is_verbose_(false) {
+      message_(i::Smi::FromInt(0)),
+      is_verbose_(false),
+      capture_message_(true) {
   i::Top::RegisterTryCatchHandler(this);
 }
 
@@ -1103,8 +1109,19 @@ v8::Local<Value> v8::TryCatch::Exception() {
 }
 
 
+v8::Local<v8::Message> v8::TryCatch::Message() {
+  if (HasCaught() && message_ != i::Smi::FromInt(0)) {
+    i::Object* message = reinterpret_cast<i::Object*>(message_);
+    return v8::Utils::MessageToLocal(i::Handle<i::Object>(message));
+  } else {
+    return v8::Local<v8::Message>();
+  }
+}
+
+
 void v8::TryCatch::Reset() {
   exception_ = i::Heap::the_hole_value();
+  message_ = i::Smi::FromInt(0);
 }
 
 
@@ -1113,6 +1130,11 @@ void v8::TryCatch::SetVerbose(bool value) {
 }
 
 
+void v8::TryCatch::SetCaptureMessage(bool value) {
+  capture_message_ = value;
+}
+
+
 // --- M e s s a g e ---
 
 
@@ -1192,15 +1214,66 @@ int Message::GetLineNumber() {
 }
 
 
-Local<Value> Message::GetSourceLine() {
-  ON_BAILOUT("v8::Message::GetSourceLine()", return Local<Value>());
+int Message::GetStartPosition() {
+  if (IsDeadCheck("v8::Message::GetStartPosition()")) return 0;
+  HandleScope scope;
+
+  i::Handle<i::JSObject> data_obj = Utils::OpenHandle(this);
+  return static_cast<int>(GetProperty(data_obj, "startPos")->Number());
+}
+
+
+int Message::GetEndPosition() {
+  if (IsDeadCheck("v8::Message::GetEndPosition()")) return 0;
+  HandleScope scope;
+  i::Handle<i::JSObject> data_obj = Utils::OpenHandle(this);
+  return static_cast<int>(GetProperty(data_obj, "endPos")->Number());
+}
+
+
+int Message::GetStartColumn() {
+  if (IsDeadCheck("v8::Message::GetStartColumn()")) return 0;
+  HandleScope scope;
+  i::Handle<i::JSObject> data_obj = Utils::OpenHandle(this);
+  EXCEPTION_PREAMBLE();
+  i::Handle<i::Object> start_col_obj = CallV8HeapFunction(
+      "GetPositionInLine",
+      data_obj,
+      &has_pending_exception);
+  EXCEPTION_BAILOUT_CHECK(0);
+  return static_cast<int>(start_col_obj->Number());
+}
+
+
+int Message::GetEndColumn() {
+  if (IsDeadCheck("v8::Message::GetEndColumn()")) return 0;
+  HandleScope scope;
+  i::Handle<i::JSObject> data_obj = Utils::OpenHandle(this);
+  EXCEPTION_PREAMBLE();
+  i::Handle<i::Object> start_col_obj = CallV8HeapFunction(
+      "GetPositionInLine",
+      data_obj,
+      &has_pending_exception);
+  EXCEPTION_BAILOUT_CHECK(0);
+  int start = static_cast<int>(GetProperty(data_obj, "startPos")->Number());
+  int end = static_cast<int>(GetProperty(data_obj, "endPos")->Number());
+  return static_cast<int>(start_col_obj->Number()) + (end - start);
+}
+
+
+Local<String> Message::GetSourceLine() {
+  ON_BAILOUT("v8::Message::GetSourceLine()", return Local<String>());
   HandleScope scope;
   EXCEPTION_PREAMBLE();
   i::Handle<i::Object> result = CallV8HeapFunction("GetSourceLine",
                                                    Utils::OpenHandle(this),
                                                    &has_pending_exception);
-  EXCEPTION_BAILOUT_CHECK(Local<v8::Value>());
-  return scope.Close(Utils::ToLocal(result));
+  EXCEPTION_BAILOUT_CHECK(Local<v8::String>());
+  if (result->IsString()) {
+    return scope.Close(Utils::ToLocal(i::Handle<i::String>::cast(result)));
+  } else {
+    return Local<String>();
+  }
 }
 
 
@@ -1925,6 +1998,53 @@ int String::Length() {
 }
 
 
+int String::Utf8Length() {
+  if (IsDeadCheck("v8::String::Utf8Length()")) return 0;
+  return Utils::OpenHandle(this)->Utf8Length();
+}
+
+
+int String::WriteUtf8(char* buffer, int capacity) {
+  if (IsDeadCheck("v8::String::WriteUtf8()")) return 0;
+  LOG_API("String::WriteUtf8");
+  i::Handle<i::String> str = Utils::OpenHandle(this);
+  write_input_buffer.Reset(0, *str);
+  int len = str->length();
+  // Encode the first K - 3 bytes directly into the buffer since we
+  // know there's room for them.  If no capacity is given we copy all
+  // of them here.
+  int fast_end = capacity - (unibrow::Utf8::kMaxEncodedSize - 1);
+  int i;
+  int pos = 0;
+  for (i = 0; i < len && (capacity == -1 || pos < fast_end); i++) {
+    i::uc32 c = write_input_buffer.GetNext();
+    int written = unibrow::Utf8::Encode(buffer + pos, c);
+    pos += written;
+  }
+  if (i < len) {
+    // For the last characters we need to check the length for each one
+    // because they may be longer than the remaining space in the
+    // buffer.
+    char intermediate[unibrow::Utf8::kMaxEncodedSize];
+    for (; i < len && pos < capacity; i++) {
+      i::uc32 c = write_input_buffer.GetNext();
+      int written = unibrow::Utf8::Encode(intermediate, c);
+      if (pos + written <= capacity) {
+        for (int j = 0; j < written; j++)
+          buffer[pos + j] = intermediate[j];
+        pos += written;
+      } else {
+        // We've reached the end of the buffer
+        break;
+      }
+    }
+  }
+  if (i == len && (capacity == -1 || pos < capacity))
+    buffer[pos++] = '\0';
+  return pos;
+}
+
+
 int String::WriteAscii(char* buffer, int start, int length) {
   if (IsDeadCheck("v8::String::WriteAscii()")) return 0;
   LOG_API("String::WriteAscii");
@@ -2096,7 +2216,7 @@ bool v8::V8::Initialize() {
 
 
 const char* v8::V8::GetVersion() {
-  return "0.3.0";
+  return "0.3.1";
 }
 
 
@@ -2501,13 +2621,40 @@ void V8::SetGlobalGCEpilogueCallback(GCCallback callback) {
 }
 
 
+String::Utf8Value::Utf8Value(v8::Handle<v8::Value> obj) {
+  EnsureInitialized("v8::String::Utf8Value::Utf8Value()");
+  HandleScope scope;
+  TryCatch try_catch;
+  Handle<String> str = obj->ToString();
+  if (str.IsEmpty()) {
+    str_ = NULL;
+    length_ = 0;
+  } else {
+    length_ = str->Utf8Length();
+    str_ = i::NewArray<char>(length_ + 1);
+    str->WriteUtf8(str_);
+  }
+}
+
+
+String::Utf8Value::~Utf8Value() {
+  i::DeleteArray(str_);
+}
+
+
 String::AsciiValue::AsciiValue(v8::Handle<v8::Value> obj) {
   EnsureInitialized("v8::String::AsciiValue::AsciiValue()");
   HandleScope scope;
+  TryCatch try_catch;
   Handle<String> str = obj->ToString();
-  int length = str->Length();
-  str_ = i::NewArray<char>(length + 1);
-  str->WriteAscii(str_);
+  if (str.IsEmpty()) {
+    str_ = NULL;
+    length_ = 0;
+  } else {
+    length_ = str->Length();
+    str_ = i::NewArray<char>(length_ + 1);
+    str->WriteAscii(str_);
+  }
 }
 
 
@@ -2519,10 +2666,16 @@ String::AsciiValue::~AsciiValue() {
 String::Value::Value(v8::Handle<v8::Value> obj) {
   EnsureInitialized("v8::String::Value::Value()");
   HandleScope scope;
+  TryCatch try_catch;
   Handle<String> str = obj->ToString();
-  int length = str->Length();
-  str_ = i::NewArray<uint16_t>(length + 1);
-  str->Write(str_);
+  if (str.IsEmpty()) {
+    str_ = NULL;
+    length_ = 0;
+  } else {
+    length_ = str->Length();
+    str_ = i::NewArray<uint16_t>(length_ + 1);
+    str->Write(str_);
+  }
 }
 
 
diff --git a/src/api.h b/src/api.h
index cd81174bcce6..18dea431632c 100644
--- a/src/api.h
+++ b/src/api.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/apinatives.js b/src/apinatives.js
index 9ec20902fbe8..7d4025615ffb 100644
--- a/src/apinatives.js
+++ b/src/apinatives.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/arguments.h b/src/arguments.h
index 55e9c45f0f9f..2ec68ed20bcd 100644
--- a/src/arguments.h
+++ b/src/arguments.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/array.js b/src/array.js
index 105f41ba2b06..a62cf4da8bab 100644
--- a/src/array.js
+++ b/src/array.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -31,15 +31,6 @@
 
 // -------------------------------------------------------------------
 
-// Determines if the array contains the element.
-function Contains(array, element) {
-  var length = array.length;
-  for (var i = 0; i < length; i++) {
-    if (array[i] === element) return true;
-  }
-  return false;
-};
-
 
 // Global list of arrays visited during toString, toLocaleString and
 // join invocations.
@@ -111,8 +102,7 @@ function Join(array, length, separator, convert) {
   if (is_array) {
     // If the array is cyclic, return the empty string for already
     // visited arrays.
-    if (Contains(visited_arrays, array)) return '';
-    visited_arrays[visited_arrays.length] = array;
+    if (!%PushIfAbsent(visited_arrays, array)) return '';
   }
 
   // Attempt to convert the elements.
@@ -121,6 +111,14 @@ function Join(array, length, separator, convert) {
       return SparseJoin(array, length, convert);
     }
 
+    // Fast case for one-element arrays.
+    if (length == 1) {
+      var e = array[0];
+      if (!IS_UNDEFINED(e) || (0 in array)) {
+        return convert(e);
+      }
+    }
+
     var builder = new StringBuilder();
 
     for (var i = 0; i < length; i++) {
@@ -219,8 +217,9 @@ function SmartMove(array, start_i, del_count, len, num_additional_args) {
         // %HasLocalProperty would be the appropriate test.  We follow
         // KJS in consulting the prototype.
         var current = array[j];
-        if (!IS_UNDEFINED(current) || j in array)
+        if (!IS_UNDEFINED(current) || j in array) {
           new_array[j] = current;
+        }
         j++;
       }
       j = start_i + del_count;
@@ -230,8 +229,9 @@ function SmartMove(array, start_i, del_count, len, num_additional_args) {
         // appropriate test.  We follow KJS in consulting the
         // prototype.
         var current = array[j];
-        if (!IS_UNDEFINED(current) || j in array)
+        if (!IS_UNDEFINED(current) || j in array) {
           new_array[j - del_count + num_additional_args] = current;
+        }
         j++;
       }
     } else {
@@ -241,16 +241,18 @@ function SmartMove(array, start_i, del_count, len, num_additional_args) {
           // %HasLocalProperty would be the appropriate test.  We follow
           // KJS in consulting the prototype.
           var current = array[key];
-          if (!IS_UNDEFINED(current) || key in array)
+          if (!IS_UNDEFINED(current) || key in array) {
             new_array[key] = current;
+          }
         } else if (key >= start_i + del_count) {
           // ECMA-262 15.4.4.12 lines 24 and 41.  The spec could also
           // be interpreted such that %HasLocalProperty would be the
           // appropriate test.  We follow KJS in consulting the
           // prototype.
           var current = array[key];
-          if (!IS_UNDEFINED(current) || key in array)
+          if (!IS_UNDEFINED(current) || key in array) {
             new_array[key - del_count + num_additional_args] = current;
+          }
         }
       }
     }
@@ -658,6 +660,9 @@ function ArraySort(comparefn) {
     if (IS_FUNCTION(comparefn)) {
       return comparefn.call(null, x, y);
     }
+    if (%_IsSmi(x) && %_IsSmi(y)) {
+      return %SmiLexicographicCompare(x, y);
+    }
     x = ToString(x);
     y = ToString(y);
     if (x == y) return 0;
@@ -677,7 +682,7 @@ function ArraySort(comparefn) {
       var parent_index = ((child_index + 1) >> 1) - 1;
       var parent_value = this[parent_index], child_value = this[child_index];
       if (Compare(parent_value, child_value) < 0) {
-        this[parent_index] = child_value; 
+        this[parent_index] = child_value;
         this[child_index] = parent_value;
       } else {
         break;
@@ -695,17 +700,17 @@ function ArraySort(comparefn) {
     while (true) {
       var child_index = ((parent_index + 1) << 1) - 1;
       if (child_index >= i) break;
-      var child1_value = this[child_index]; 
+      var child1_value = this[child_index];
       var child2_value = this[child_index + 1];
       var parent_value = this[parent_index];
       if (child_index + 1 >= i || Compare(child1_value, child2_value) > 0) {
         if (Compare(parent_value, child1_value) > 0) break;
-        this[child_index] = parent_value; 
+        this[child_index] = parent_value;
         this[parent_index] = child1_value;
         parent_index = child_index;
       } else {
         if (Compare(parent_value, child2_value) > 0) break;
-        this[child_index + 1] = parent_value; 
+        this[child_index + 1] = parent_value;
         this[parent_index] = child2_value;
         parent_index = child_index + 1;
       }
diff --git a/src/assembler-arm-inl.h b/src/assembler-arm-inl.h
index 6bc900a39ca2..d94981138879 100644
--- a/src/assembler-arm-inl.h
+++ b/src/assembler-arm-inl.h
@@ -32,7 +32,7 @@
 
 // The original source code covered by the above license above has been modified
 // significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #ifndef V8_ASSEMBLER_ARM_INL_H_
 #define V8_ASSEMBLER_ARM_INL_H_
diff --git a/src/assembler-arm.cc b/src/assembler-arm.cc
index 6089b0f67664..e057fe033b77 100644
--- a/src/assembler-arm.cc
+++ b/src/assembler-arm.cc
@@ -32,7 +32,7 @@
 
 // The original source code covered by the above license above has been modified
 // significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include "v8.h"
 
diff --git a/src/assembler-arm.h b/src/assembler-arm.h
index f8cdb00e2599..85913623e66f 100644
--- a/src/assembler-arm.h
+++ b/src/assembler-arm.h
@@ -32,7 +32,7 @@
 
 // The original source code covered by the above license above has been modified
 // significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 // A light-weight ARM Assembler
 // Generates user mode instructions for the ARM architecture up to version 5
diff --git a/src/assembler-ia32-inl.h b/src/assembler-ia32-inl.h
index 837f295d4966..66102e66c68f 100644
--- a/src/assembler-ia32-inl.h
+++ b/src/assembler-ia32-inl.h
@@ -30,7 +30,7 @@
 
 // The original source code covered by the above license above has been
 // modified significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 // A light-weight IA32 Assembler.
 
diff --git a/src/assembler-ia32.cc b/src/assembler-ia32.cc
index b9e1bdb7b120..483ae0efbaa9 100644
--- a/src/assembler-ia32.cc
+++ b/src/assembler-ia32.cc
@@ -32,7 +32,7 @@
 
 // The original source code covered by the above license above has been modified
 // significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include "v8.h"
 
diff --git a/src/assembler-ia32.h b/src/assembler-ia32.h
index 183ad2ee062b..700253efa68d 100644
--- a/src/assembler-ia32.h
+++ b/src/assembler-ia32.h
@@ -30,7 +30,7 @@
 
 // The original source code covered by the above license above has been
 // modified significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 // A light-weight IA32 Assembler.
 
diff --git a/src/assembler.cc b/src/assembler.cc
index ebe0d6a0c5bc..7b4ffc789436 100644
--- a/src/assembler.cc
+++ b/src/assembler.cc
@@ -30,7 +30,7 @@
 
 // The original source code covered by the above license above has been
 // modified significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include "v8.h"
 
diff --git a/src/assembler.h b/src/assembler.h
index 33fc056bb071..d50de61ad957 100644
--- a/src/assembler.h
+++ b/src/assembler.h
@@ -30,7 +30,7 @@
 
 // The original source code covered by the above license above has been
 // modified significantly by Google Inc.
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #ifndef V8_ASSEMBLER_H_
 #define V8_ASSEMBLER_H_
diff --git a/src/ast.cc b/src/ast.cc
index 6296f950892e..6e60078b9980 100644
--- a/src/ast.cc
+++ b/src/ast.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/ast.h b/src/ast.h
index 55dda269b3d3..ab7bc8d6ac57 100644
--- a/src/ast.h
+++ b/src/ast.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/bootstrapper.cc b/src/bootstrapper.cc
index de04d1a7c4ec..100610856c16 100644
--- a/src/bootstrapper.cc
+++ b/src/bootstrapper.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/bootstrapper.h b/src/bootstrapper.h
index ff905ce2eac7..6b5f9879177e 100644
--- a/src/bootstrapper.h
+++ b/src/bootstrapper.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/builtins-arm.cc b/src/builtins-arm.cc
index ef9f093154bd..74f157fdceda 100644
--- a/src/builtins-arm.cc
+++ b/src/builtins-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/builtins-ia32.cc b/src/builtins-ia32.cc
index a432197ad1ad..bf63464ffc18 100644
--- a/src/builtins-ia32.cc
+++ b/src/builtins-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/builtins.cc b/src/builtins.cc
index dc264b4a0078..02f3d8a541f8 100644
--- a/src/builtins.cc
+++ b/src/builtins.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/builtins.h b/src/builtins.h
index 4e04bbc92344..13bd3d5caada 100644
--- a/src/builtins.h
+++ b/src/builtins.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/char-predicates-inl.h b/src/char-predicates-inl.h
index 32f60ddf2949..b575bdfe5822 100644
--- a/src/char-predicates-inl.h
+++ b/src/char-predicates-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/char-predicates.h b/src/char-predicates.h
index 2800f02300ab..3fcaeb626f45 100644
--- a/src/char-predicates.h
+++ b/src/char-predicates.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/checks.cc b/src/checks.cc
index 14889f113a13..c01c9b247b5e 100644
--- a/src/checks.cc
+++ b/src/checks.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -74,8 +74,8 @@ void CheckEqualsHelper(const char* file,
                        const char* value_source,
                        v8::Handle<v8::Value> value) {
   if (!expected->Equals(value)) {
-    v8::String::AsciiValue value_str(value);
-    v8::String::AsciiValue expected_str(expected);
+    v8::String::Utf8Value value_str(value);
+    v8::String::Utf8Value expected_str(expected);
     V8_Fatal(file, line,
              "CHECK_EQ(%s, %s) failed\n#   Expected: %s\n#   Found: %s",
              expected_source, value_source, *expected_str, *value_str);
@@ -90,7 +90,7 @@ void CheckNonEqualsHelper(const char* file,
                           const char* value_source,
                           v8::Handle<v8::Value> value) {
   if (unexpected->Equals(value)) {
-    v8::String::AsciiValue value_str(value);
+    v8::String::Utf8Value value_str(value);
     V8_Fatal(file, line, "CHECK_NE(%s, %s) failed\n#   Value: %s",
              unexpected_source, value_source, *value_str);
   }
diff --git a/src/checks.h b/src/checks.h
index 6b3b602a55d1..9dd45ce4fb0f 100644
--- a/src/checks.h
+++ b/src/checks.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/code-stubs.cc b/src/code-stubs.cc
index a8ee99c73716..ebc30aeca2f4 100644
--- a/src/code-stubs.cc
+++ b/src/code-stubs.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/code-stubs.h b/src/code-stubs.h
index b4f7c289cde5..6e8c0246fc24 100644
--- a/src/code-stubs.h
+++ b/src/code-stubs.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/code.h b/src/code.h
index 004c3627a57a..87e07949047e 100644
--- a/src/code.h
+++ b/src/code.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/codegen-arm.cc b/src/codegen-arm.cc
index c4d3f3867c7d..fa58084555ce 100644
--- a/src/codegen-arm.cc
+++ b/src/codegen-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -295,6 +295,8 @@ class ArmCodeGenerator: public CodeGenerator {
   virtual void GenerateSetValueOf(ZoneList<Expression*>* args);
 
   virtual void GenerateFastCharCodeAt(ZoneList<Expression*>* args);
+
+  virtual void GenerateObjectEquals(ZoneList<Expression*>* args);
 };
 
 
@@ -3998,6 +4000,19 @@ void ArmCodeGenerator::GenerateArgumentsAccess(ZoneList<Expression*>* args) {
 }
 
 
+void ArmCodeGenerator::GenerateObjectEquals(ZoneList<Expression*>* args) {
+  ASSERT(args->length() == 2);
+
+  // Load the two objects into registers and perform the comparison.
+  Load(args->at(0));
+  Load(args->at(1));
+  __ pop(r0);
+  __ pop(r1);
+  __ cmp(r0, Operand(r1));
+  cc_reg_ = eq;
+}
+
+
 void ArmCodeGenerator::GenerateShiftDownAndTailCall(
     ZoneList<Expression*>* args) {
   // r0 = number of arguments
diff --git a/src/codegen-ia32.cc b/src/codegen-ia32.cc
index 6d38136bea42..52f5a4eefb19 100644
--- a/src/codegen-ia32.cc
+++ b/src/codegen-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -314,6 +314,8 @@ class Ia32CodeGenerator: public CodeGenerator {
   virtual void GenerateSetValueOf(ZoneList<Expression*>* args);
 
   virtual void GenerateFastCharCodeAt(ZoneList<Expression*>* args);
+
+  virtual void GenerateObjectEquals(ZoneList<Expression*>* args);
 };
 
 
@@ -4264,6 +4266,18 @@ void Ia32CodeGenerator::GenerateArgumentsAccess(ZoneList<Expression*>* args) {
 }
 
 
+void Ia32CodeGenerator::GenerateObjectEquals(ZoneList<Expression*>* args) {
+  ASSERT(args->length() == 2);
+
+  // Load the two objects into registers and perform the comparison.
+  Load(args->at(0));
+  Load(args->at(1));
+  __ pop(eax);
+  __ pop(ecx);
+  __ cmp(eax, Operand(ecx));
+  cc_reg_ = equal;
+}
+
 
 void Ia32CodeGenerator::VisitCallRuntime(CallRuntime* node) {
   if (CheckForInlineRuntimeCall(node)) return;
diff --git a/src/codegen-inl.h b/src/codegen-inl.h
index 912d20544fa2..c6abbec230ee 100644
--- a/src/codegen-inl.h
+++ b/src/codegen-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/codegen.cc b/src/codegen.cc
index 14ab511bd735..3631a95d3f7b 100644
--- a/src/codegen.cc
+++ b/src/codegen.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -256,7 +256,9 @@ bool CodeGenerator::CheckForInlineRuntimeCall(CallRuntime* node) {
     {&v8::internal::CodeGenerator::GenerateSetValueOf,
      "_SetValueOf"},
     {&v8::internal::CodeGenerator::GenerateFastCharCodeAt,
-     "_FastCharCodeAt"}
+     "_FastCharCodeAt"},
+    {&v8::internal::CodeGenerator::GenerateObjectEquals,
+     "_ObjectEquals"}
   };
   if (node->name()->length() > 0 && node->name()->Get(0) == '_') {
     for (unsigned i = 0;
diff --git a/src/codegen.h b/src/codegen.h
index 9833445c878b..8f0e265cf564 100644
--- a/src/codegen.h
+++ b/src/codegen.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -173,6 +173,9 @@ class CodeGenerator: public Visitor {
   // Fast support for charCodeAt(n).
   virtual void GenerateFastCharCodeAt(ZoneList<Expression*>* args) = 0;
 
+  // Fast support for object equality testing.
+  virtual void GenerateObjectEquals(ZoneList<Expression*>* args) = 0;
+
  private:
   bool is_eval_;  // Tells whether code is generated for eval.
   Handle<Script> script_;
diff --git a/src/compiler.cc b/src/compiler.cc
index 7d2e661f5ccb..78772a1eafe8 100644
--- a/src/compiler.cc
+++ b/src/compiler.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/compiler.h b/src/compiler.h
index 3ee86b12a809..1f37ad6aa7db 100644
--- a/src/compiler.h
+++ b/src/compiler.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/constants-arm.h b/src/constants-arm.h
index 41fd5bab1e3c..a388009a131a 100644
--- a/src/constants-arm.h
+++ b/src/constants-arm.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/contexts.cc b/src/contexts.cc
index 895fbeb49e9b..2142fac160e5 100644
--- a/src/contexts.cc
+++ b/src/contexts.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/contexts.h b/src/contexts.h
index 5fb3160559a4..f0869ac96f91 100644
--- a/src/contexts.h
+++ b/src/contexts.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/conversions-inl.h b/src/conversions-inl.h
index 67ea104ed9f1..e3db4e95b350 100644
--- a/src/conversions-inl.h
+++ b/src/conversions-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/conversions.cc b/src/conversions.cc
index 45956bc35cd3..85637ee78a3a 100644
--- a/src/conversions.cc
+++ b/src/conversions.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/conversions.h b/src/conversions.h
index 58ef7e485620..605327db7f88 100644
--- a/src/conversions.h
+++ b/src/conversions.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/counters.cc b/src/counters.cc
index bf1df7b80e37..3baad2943757 100644
--- a/src/counters.cc
+++ b/src/counters.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/counters.h b/src/counters.h
index ff34b0357b93..6dd9e94f362b 100644
--- a/src/counters.h
+++ b/src/counters.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/cpu-arm.cc b/src/cpu-arm.cc
index c0373f94e54a..7369661290df 100644
--- a/src/cpu-arm.cc
+++ b/src/cpu-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/cpu-ia32.cc b/src/cpu-ia32.cc
index 73b8e51820a2..d61a548677e3 100644
--- a/src/cpu-ia32.cc
+++ b/src/cpu-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/cpu.h b/src/cpu.h
index 3b8795a85587..d12c30c8ca42 100644
--- a/src/cpu.h
+++ b/src/cpu.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/date-delay.js b/src/date-delay.js
index a2e9ac428c4c..d45883d35c02 100644
--- a/src/date-delay.js
+++ b/src/date-delay.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/dateparser.cc b/src/dateparser.cc
index 926b8528fbf9..69cf748629c2 100644
--- a/src/dateparser.cc
+++ b/src/dateparser.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/dateparser.h b/src/dateparser.h
index a53698a0ce8f..bf968525f5f6 100644
--- a/src/dateparser.h
+++ b/src/dateparser.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/debug-delay.js b/src/debug-delay.js
index 19461dfbd17c..9ca5b0b0afd2 100644
--- a/src/debug-delay.js
+++ b/src/debug-delay.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/debug.cc b/src/debug.cc
index 7487cdcb8217..f69b6b79f71a 100644
--- a/src/debug.cc
+++ b/src/debug.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -537,8 +537,10 @@ bool Debug::CompileDebuggerScript(int index) {
 
   // Check for caught exceptions.
   if (caught_exception) {
-    MessageHandler::ReportMessage("error_loading_debugger", NULL,
-                                  HandleVector<Object>(&result, 1));
+    Handle<Object> message = MessageHandler::MakeMessageObject(
+        "error_loading_debugger", NULL, HandleVector<Object>(&result, 1),
+        Handle<String>());
+    MessageHandler::ReportMessage(NULL, message);
     return false;
   }
 
diff --git a/src/debug.h b/src/debug.h
index a26a1bfcb032..23b0ff2bdde1 100644
--- a/src/debug.h
+++ b/src/debug.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -25,8 +25,8 @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-#ifndef V8_DEBUG_H_
-#define V8_DEBUG_H_
+#ifndef V8_V8_DEBUG_H_
+#define V8_V8_DEBUG_H_
 
 #include "../include/v8-debug.h"
 #include "assembler.h"
@@ -574,4 +574,4 @@ class Debug_Address {
 
 } }  // namespace v8::internal
 
-#endif  // V8_DEBUG_H_
+#endif  // V8_V8_DEBUG_H_
diff --git a/src/disasm-arm.cc b/src/disasm-arm.cc
index 15c93ac0459b..0b69bdf70604 100644
--- a/src/disasm-arm.cc
+++ b/src/disasm-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/disasm-ia32.cc b/src/disasm-ia32.cc
index 36282c80749b..ac12e1f4cb68 100644
--- a/src/disasm-ia32.cc
+++ b/src/disasm-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/disasm.h b/src/disasm.h
index 18cad8b93d89..f590b281d8da 100644
--- a/src/disasm.h
+++ b/src/disasm.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/disassembler.cc b/src/disassembler.cc
index 51a9bf12ae2c..635440dddbd9 100644
--- a/src/disassembler.cc
+++ b/src/disassembler.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/disassembler.h b/src/disassembler.h
index e61967b1fb51..5003c00e21a2 100644
--- a/src/disassembler.h
+++ b/src/disassembler.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/dtoa-config.c b/src/dtoa-config.c
index 5a4cf096e9c2..cb73c173debb 100644
--- a/src/dtoa-config.c
+++ b/src/dtoa-config.c
@@ -1,5 +1,5 @@
 /*
- * Copyright 2007-2008 Google, Inc. All Rights Reserved.
+ * Copyright 2007-2008 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:
diff --git a/src/execution.cc b/src/execution.cc
index 7f55c6f992c9..ce2259e0c764 100644
--- a/src/execution.cc
+++ b/src/execution.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -130,9 +130,12 @@ Handle<Object> Execution::TryCall(Handle<JSFunction> func,
                                   Object*** args,
                                   bool* caught_exception) {
   // Enter a try-block while executing the JavaScript code. To avoid
-  // duplicate error printing it must be non-verbose.
+  // duplicate error printing it must be non-verbose.  Also, to avoid
+  // creating message objects during stack overflow we shouldn't
+  // capture messages.
   v8::TryCatch catcher;
   catcher.SetVerbose(false);
+  catcher.SetCaptureMessage(false);
 
   Handle<Object> result = Invoke(false, func, receiver, argc, args,
                                  caught_exception);
@@ -656,7 +659,7 @@ v8::Handle<v8::FunctionTemplate> GCExtension::GetNativeFunction(
 
 v8::Handle<v8::Value> GCExtension::GC(const v8::Arguments& args) {
   // All allocation spaces other than NEW_SPACE have the same effect.
-  Heap::CollectGarbage(0, OLD_SPACE);
+  Heap::CollectGarbage(0, OLD_DATA_SPACE);
   return v8::Undefined();
 }
 
diff --git a/src/execution.h b/src/execution.h
index 5d408a98eaf8..2dc7540cb2c2 100644
--- a/src/execution.h
+++ b/src/execution.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/factory.cc b/src/factory.cc
index 39bc763ca6e4..9149cb8c464e 100644
--- a/src/factory.cc
+++ b/src/factory.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -49,7 +49,7 @@ Handle<DescriptorArray> Factory::NewDescriptorArray(int number_of_descriptors) {
 }
 
 
-// Symbols are created in the old generation (code space).
+// Symbols are created in the old generation (data space).
 Handle<String> Factory::LookupSymbol(Vector<const char> string) {
   CALL_HEAP_FUNCTION(Heap::LookupSymbol(string), String);
 }
diff --git a/src/factory.h b/src/factory.h
index 40e13053dbc3..9efbcd52bd51 100644
--- a/src/factory.h
+++ b/src/factory.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/flags-inl.h b/src/flags-inl.h
index e394e3a4e3bf..2bbf581bbc58 100644
--- a/src/flags-inl.h
+++ b/src/flags-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/flags.cc b/src/flags.cc
index 7ce4b8afd4a7..1f8413cd3bad 100644
--- a/src/flags.cc
+++ b/src/flags.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/flags.h b/src/flags.h
index da5520f97e58..07eb6915343f 100644
--- a/src/flags.h
+++ b/src/flags.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames-arm.cc b/src/frames-arm.cc
index ace49b83e46e..238eded753a3 100644
--- a/src/frames-arm.cc
+++ b/src/frames-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames-arm.h b/src/frames-arm.h
index e08758f2b087..463ae60c5054 100644
--- a/src/frames-arm.h
+++ b/src/frames-arm.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames-ia32.cc b/src/frames-ia32.cc
index 691118938484..ddf4bfdaf6da 100644
--- a/src/frames-ia32.cc
+++ b/src/frames-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames-ia32.h b/src/frames-ia32.h
index 0e9176cb22a4..a39e5b947e3e 100644
--- a/src/frames-ia32.h
+++ b/src/frames-ia32.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames-inl.h b/src/frames-inl.h
index 2bd81bbd9542..fac14184d679 100644
--- a/src/frames-inl.h
+++ b/src/frames-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames.cc b/src/frames.cc
index ef976a0a6eb3..3b1a9219178b 100644
--- a/src/frames.cc
+++ b/src/frames.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/frames.h b/src/frames.h
index 693cfedf2c3a..9dc931939fc9 100644
--- a/src/frames.h
+++ b/src/frames.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/global-handles.cc b/src/global-handles.cc
index de071df49fd5..bb36e35c4fa4 100644
--- a/src/global-handles.cc
+++ b/src/global-handles.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/global-handles.h b/src/global-handles.h
index b7783f6696c2..78fb3a1147f9 100644
--- a/src/global-handles.h
+++ b/src/global-handles.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/globals.h b/src/globals.h
index 7bf5802c07bc..fa7038b16dea 100644
--- a/src/globals.h
+++ b/src/globals.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -214,17 +214,19 @@ typedef bool (*WeakSlotCallback)(Object** pointer);
 // NOTE: SpaceIterator depends on AllocationSpace enumeration values being
 // consecutive.
 enum AllocationSpace {
-  NEW_SPACE,
-  OLD_SPACE,
-  CODE_SPACE,
-  MAP_SPACE,
-  LO_SPACE,
+  NEW_SPACE,          // Semispaces collected with copying collector.
+  OLD_POINTER_SPACE,  // Must be first of the paged spaces - see PagedSpaces.
+  OLD_DATA_SPACE,     // May not have pointers to new space.
+  CODE_SPACE,         // Also one of the old spaces.  Marked executable.
+  MAP_SPACE,          // Only map objects.
+  LO_SPACE,           // Large objects.
   FIRST_SPACE = NEW_SPACE,
-  LAST_SPACE = LO_SPACE
+  LAST_SPACE = LO_SPACE  // <= 5 (see kSpaceBits and kLOSpacePointer)
 };
 const int kSpaceTagSize = 3;
 const int kSpaceTagMask = (1 << kSpaceTagSize) - 1;
 
+
 // A flag that indicates whether objects should be pretenured when
 // allocated (allocated directly into the old generation) or not
 // (allocated in the young generation if the object size and type
@@ -233,6 +235,8 @@ enum PretenureFlag { NOT_TENURED, TENURED };
 
 enum GarbageCollector { SCAVENGER, MARK_COMPACTOR };
 
+enum Executability { NOT_EXECUTABLE, EXECUTABLE };
+
 
 // A CodeDesc describes a buffer holding instructions and relocation
 // information. The instructions start at the beginning of the buffer
diff --git a/src/handles-inl.h b/src/handles-inl.h
index ab18141bd981..502aeab0e6e2 100644
--- a/src/handles-inl.h
+++ b/src/handles-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/handles.cc b/src/handles.cc
index 0e8826d54dde..6c41a574ad76 100644
--- a/src/handles.cc
+++ b/src/handles.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/handles.h b/src/handles.h
index 6fea67b25050..229b6a44b5b8 100644
--- a/src/handles.h
+++ b/src/handles.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/hashmap.cc b/src/hashmap.cc
index 6e42d2f6c729..126f73924111 100644
--- a/src/hashmap.cc
+++ b/src/hashmap.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/hashmap.h b/src/hashmap.h
index 1ea92916c11b..78263111bf86 100644
--- a/src/hashmap.h
+++ b/src/hashmap.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/heap-inl.h b/src/heap-inl.h
index 22ef4417c181..c03c22c918d0 100644
--- a/src/heap-inl.h
+++ b/src/heap-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -44,7 +44,8 @@ int Heap::MaxHeapObjectSize() {
 }
 
 
-Object* Heap::AllocateRaw(int size_in_bytes, AllocationSpace space) {
+Object* Heap::AllocateRaw(int size_in_bytes,
+                          AllocationSpace space) {
   ASSERT(allocation_allowed_ && gc_state_ == NOT_IN_GC);
 #ifdef DEBUG
   if (FLAG_gc_interval >= 0 &&
@@ -60,8 +61,10 @@ Object* Heap::AllocateRaw(int size_in_bytes, AllocationSpace space) {
   }
 
   Object* result;
-  if (OLD_SPACE == space) {
-    result = old_space_->AllocateRaw(size_in_bytes);
+  if (OLD_POINTER_SPACE == space) {
+    result = old_pointer_space_->AllocateRaw(size_in_bytes);
+  } else if (OLD_DATA_SPACE == space) {
+    result = old_data_space_->AllocateRaw(size_in_bytes);
   } else if (CODE_SPACE == space) {
     result = code_space_->AllocateRaw(size_in_bytes);
   } else if (LO_SPACE == space) {
@@ -75,32 +78,6 @@ Object* Heap::AllocateRaw(int size_in_bytes, AllocationSpace space) {
 }
 
 
-Object* Heap::AllocateForDeserialization(int size_in_bytes,
-                                         AllocationSpace space) {
-  ASSERT(allocation_allowed_ && gc_state_ == NOT_IN_GC);
-  PagedSpace* where;
-
-  switch (space) {
-    case NEW_SPACE:
-      return new_space_->AllocateRaw(size_in_bytes);
-    case LO_SPACE:
-      return lo_space_->AllocateRaw(size_in_bytes);
-    case OLD_SPACE:
-      where = old_space_;
-      break;
-    case CODE_SPACE:
-      where = code_space_;
-      break;
-    case MAP_SPACE:
-      where = map_space_;
-      break;
-  }
-
-  // Only paged spaces fall through.
-  return where->AllocateForDeserialization(size_in_bytes);
-}
-
-
 Object* Heap::NumberFromInt32(int32_t value) {
   if (Smi::IsValid(value)) return Smi::FromInt(value);
   // Bypass NumberFromDouble to avoid various redundant checks.
@@ -160,9 +137,9 @@ void Heap::RecordWrite(Address address, int offset) {
 }
 
 
-AllocationSpace Heap::TargetSpace(HeapObject* object) {
-  // Heap numbers and sequential strings are promoted to code space, all
-  // other object types are promoted to old space.  We do not use
+OldSpace* Heap::TargetSpace(HeapObject* object) {
+  // Heap numbers and sequential strings are promoted to old data space, all
+  // other object types are promoted to old pointer space.  We do not use
   // object->IsHeapNumber() and object->IsSeqString() because we already
   // know that object has the heap object tag.
   InstanceType type = object->map()->instance_type();
@@ -171,7 +148,7 @@ AllocationSpace Heap::TargetSpace(HeapObject* object) {
       type != HEAP_NUMBER_TYPE &&
       (type >= FIRST_NONSTRING_TYPE ||
        String::cast(object)->representation_tag() != kSeqStringTag);
-  return has_pointers ? OLD_SPACE : CODE_SPACE;
+  return has_pointers ? old_pointer_space_ : old_data_space_;
 }
 
 
diff --git a/src/heap.cc b/src/heap.cc
index b04b4c1c40a5..5548fe93a95f 100644
--- a/src/heap.cc
+++ b/src/heap.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -83,7 +83,8 @@ DECLARE_bool(log_gc);
 
 
 NewSpace* Heap::new_space_ = NULL;
-OldSpace* Heap::old_space_ = NULL;
+OldSpace* Heap::old_pointer_space_ = NULL;
+OldSpace* Heap::old_data_space_ = NULL;
 OldSpace* Heap::code_space_ = NULL;
 MapSpace* Heap::map_space_ = NULL;
 LargeObjectSpace* Heap::lo_space_ = NULL;
@@ -127,7 +128,8 @@ int Heap::Capacity() {
   if (!HasBeenSetup()) return 0;
 
   return new_space_->Capacity() +
-      old_space_->Capacity() +
+      old_pointer_space_->Capacity() +
+      old_data_space_->Capacity() +
       code_space_->Capacity() +
       map_space_->Capacity();
 }
@@ -137,7 +139,8 @@ int Heap::Available() {
   if (!HasBeenSetup()) return 0;
 
   return new_space_->Available() +
-      old_space_->Available() +
+      old_pointer_space_->Available() +
+      old_data_space_->Available() +
       code_space_->Available() +
       map_space_->Available();
 }
@@ -145,10 +148,11 @@ int Heap::Available() {
 
 bool Heap::HasBeenSetup() {
   return new_space_ != NULL &&
-      old_space_ != NULL &&
-      code_space_ != NULL &&
-      map_space_ != NULL &&
-      lo_space_ != NULL;
+         old_pointer_space_ != NULL &&
+         old_data_space_ != NULL &&
+         code_space_ != NULL &&
+         map_space_ != NULL &&
+         lo_space_ != NULL;
 }
 
 
@@ -175,13 +179,13 @@ GarbageCollector Heap::SelectGarbageCollector(AllocationSpace space) {
   // Is there enough space left in OLD to guarantee that a scavenge can
   // succeed?
   //
-  // Note that old_space_->MaxAvailable() undercounts the memory available
+  // Note that MemoryAllocator->MaxAvailable() undercounts the memory available
   // for object promotion. It counts only the bytes that the memory
   // allocator has not yet allocated from the OS and assigned to any space,
   // and does not count available bytes already in the old space or code
   // space.  Undercounting is safe---we may get an unrequested full GC when
   // a scavenge would have succeeded.
-  if (old_space_->MaxAvailable() <= new_space_->Size()) {
+  if (MemoryAllocator::MaxAvailable() <= new_space_->Size()) {
     Counters::gc_compactor_caused_by_oldspace_exhaustion.Increment();
     return MARK_COMPACTOR;
   }
@@ -256,9 +260,8 @@ void Heap::GarbageCollectionPrologue() {
   if (FLAG_gc_verbose) Print();
 
   if (FLAG_print_rset) {
-    // By definition, code space does not have remembered set bits that we
-    // care about.
-    old_space_->PrintRSet();
+    // Not all spaces have remembered set bits that we care about.
+    old_pointer_space_->PrintRSet();
     map_space_->PrintRSet();
     lo_space_->PrintRSet();
   }
@@ -270,11 +273,10 @@ void Heap::GarbageCollectionPrologue() {
 }
 
 int Heap::SizeOfObjects() {
-  return new_space_->Size() +
-      old_space_->Size() +
-      code_space_->Size() +
-      map_space_->Size() +
-      lo_space_->Size();
+  int total = 0;
+  AllSpaces spaces;
+  while (Space* space = spaces.next()) total += space->Size();
+  return total;
 }
 
 void Heap::GarbageCollectionEpilogue() {
@@ -303,6 +305,14 @@ void Heap::GarbageCollectionEpilogue() {
 }
 
 
+void Heap::CollectAllGarbage() {
+  // Since we are ignoring the return value, the exact choice of space does
+  // not matter, so long as we do not specify NEW_SPACE, which would not
+  // cause a full GC.
+  CollectGarbage(0, OLD_POINTER_SPACE);
+}
+
+
 bool Heap::CollectGarbage(int requested_size, AllocationSpace space) {
   // The VM is in the GC state until exiting this function.
   VMState state(GC);
@@ -344,8 +354,10 @@ bool Heap::CollectGarbage(int requested_size, AllocationSpace space) {
   switch (space) {
     case NEW_SPACE:
       return new_space_->Available() >= requested_size;
-    case OLD_SPACE:
-      return old_space_->Available() >= requested_size;
+    case OLD_POINTER_SPACE:
+      return old_pointer_space_->Available() >= requested_size;
+    case OLD_DATA_SPACE:
+      return old_data_space_->Available() >= requested_size;
     case CODE_SPACE:
       return code_space_->Available() >= requested_size;
     case MAP_SPACE:
@@ -381,7 +393,7 @@ void Heap::PerformGarbageCollection(AllocationSpace space,
 
     // If we have used the mark-compact collector to collect the new
     // space, and it has not compacted the new space, we force a
-    // separate scavenge collection.  THIS IS A HACK.  It covers the
+    // separate scavenge collection.  This is a hack.  It covers the
     // case where (1) a new space collection was requested, (2) the
     // collector selection policy selected the mark-compact collector,
     // and (3) the mark-compact collector policy selected not to
@@ -435,6 +447,10 @@ void Heap::MarkCompact(GCTracer* tracer) {
 
 
 void Heap::MarkCompactPrologue() {
+  // Empty eval caches
+  Heap::eval_cache_global_ = Heap::null_value();
+  Heap::eval_cache_non_global_ = Heap::null_value();
+
   RegExpImpl::OldSpaceCollectionPrologue();
   Top::MarkCompactPrologue();
   ThreadManager::MarkCompactPrologue();
@@ -483,9 +499,9 @@ static Address promoted_top = NULL;
 
 
 #ifdef DEBUG
-// Visitor class to verify pointers in code space do not point into
+// Visitor class to verify pointers in code or data space do not point into
 // new space.
-class VerifyCodeSpacePointersVisitor: public ObjectVisitor {
+class VerifyNonPointerSpacePointersVisitor: public ObjectVisitor {
  public:
   void VisitPointers(Object** start, Object**end) {
     for (Object** current = start; current < end; current++) {
@@ -500,7 +516,7 @@ class VerifyCodeSpacePointersVisitor: public ObjectVisitor {
 void Heap::Scavenge() {
 #ifdef DEBUG
   if (FLAG_enable_slow_asserts) {
-    VerifyCodeSpacePointersVisitor v;
+    VerifyNonPointerSpacePointersVisitor v;
     HeapObjectIterator it(code_space_);
     while (it.has_next()) {
       HeapObject* object = it.next();
@@ -560,8 +576,8 @@ void Heap::Scavenge() {
   IterateRoots(&copy_visitor);
 
   // Copy objects reachable from the old generation.  By definition, there
-  // are no intergenerational pointers in code space.
-  IterateRSet(old_space_, &CopyObject);
+  // are no intergenerational pointers in code or data spaces.
+  IterateRSet(old_pointer_space_, &CopyObject);
   IterateRSet(map_space_, &CopyObject);
   lo_space_->IterateRSet(&CopyObject);
 
@@ -694,12 +710,13 @@ int Heap::UpdateRSet(HeapObject* obj) {
 
 
 void Heap::RebuildRSets() {
-  // By definition, we do not care about remembered set bits in code space.
+  // By definition, we do not care about remembered set bits in code or data
+  // spaces.
   map_space_->ClearRSet();
   RebuildRSets(map_space_);
 
-  old_space_->ClearRSet();
-  RebuildRSets(old_space_);
+  old_pointer_space_->ClearRSet();
+  RebuildRSets(old_pointer_space_);
 
   Heap::lo_space_->ClearRSet();
   RebuildRSets(lo_space_);
@@ -767,7 +784,7 @@ void Heap::CopyObject(HeapObject** p) {
 
   // We use the first word (where the map pointer usually is) of a heap
   // object to record the forwarding pointer.  A forwarding pointer can
-  // point to the old space, the code space, or the to space of the new
+  // point to an old space, the code space, or the to space of the new
   // generation.
   MapWord first_word = object->map_word();
 
@@ -802,26 +819,23 @@ void Heap::CopyObject(HeapObject** p) {
   Object* result;
   // If the object should be promoted, we try to copy it to old space.
   if (ShouldBePromoted(object->address(), object_size)) {
-    AllocationSpace target_space = Heap::TargetSpace(object);
-    if (target_space == OLD_SPACE) {
-      result = old_space_->AllocateRaw(object_size);
-    } else {
-      ASSERT(target_space == CODE_SPACE);
-      result = code_space_->AllocateRaw(object_size);
-    }
+    OldSpace* target_space = Heap::TargetSpace(object);
+    ASSERT(target_space == Heap::old_pointer_space_ ||
+           target_space == Heap::old_data_space_);
+    result = target_space->AllocateRaw(object_size);
 
     if (!result->IsFailure()) {
       *p = MigrateObject(p, HeapObject::cast(result), object_size);
-      if (target_space == OLD_SPACE) {
+      if (target_space == Heap::old_pointer_space_) {
         // Record the object's address at the top of the to space, to allow
         // it to be swept by the scavenger.
         promoted_top -= kPointerSize;
         Memory::Object_at(promoted_top) = *p;
       } else {
 #ifdef DEBUG
-        // Objects promoted to the code space should not have pointers to
+        // Objects promoted to the data space should not have pointers to
         // new space.
-        VerifyCodeSpacePointersVisitor v;
+        VerifyNonPointerSpacePointersVisitor v;
         (*p)->Iterate(&v);
 #endif
       }
@@ -890,7 +904,7 @@ bool Heap::CreateInitialMaps() {
   if (obj->IsFailure()) return false;
   empty_fixed_array_ = FixedArray::cast(obj);
 
-  obj = Allocate(oddball_map(), CODE_SPACE);
+  obj = Allocate(oddball_map(), OLD_DATA_SPACE);
   if (obj->IsFailure()) return false;
   null_value_ = obj;
 
@@ -1016,7 +1030,7 @@ Object* Heap::AllocateHeapNumber(double value, PretenureFlag pretenure) {
   // Statically ensure that it is safe to allocate heap numbers in paged
   // spaces.
   STATIC_ASSERT(HeapNumber::kSize <= Page::kMaxHeapObjectSize);
-  AllocationSpace space = (pretenure == TENURED) ? CODE_SPACE : NEW_SPACE;
+  AllocationSpace space = (pretenure == TENURED) ? OLD_DATA_SPACE : NEW_SPACE;
   Object* result = AllocateRaw(HeapNumber::kSize, space);
   if (result->IsFailure()) return result;
 
@@ -1042,7 +1056,7 @@ Object* Heap::AllocateHeapNumber(double value) {
 Object* Heap::CreateOddball(Map* map,
                             const char* to_string,
                             Object* to_number) {
-  Object* result = Allocate(map, CODE_SPACE);
+  Object* result = Allocate(map, OLD_DATA_SPACE);
   if (result->IsFailure()) return result;
   return Oddball::cast(result)->Initialize(to_string, to_number);
 }
@@ -1112,7 +1126,7 @@ bool Heap::CreateInitialObjects() {
   if (obj->IsFailure()) return false;
   nan_value_ = obj;
 
-  obj = Allocate(oddball_map(), CODE_SPACE);
+  obj = Allocate(oddball_map(), OLD_DATA_SPACE);
   if (obj->IsFailure()) return false;
   undefined_value_ = obj;
   ASSERT(!InNewSpace(undefined_value()));
@@ -1194,6 +1208,10 @@ bool Heap::CreateInitialObjects() {
   if (obj->IsFailure()) return false;
   natives_source_cache_ = FixedArray::cast(obj);
 
+  // Initialized eval cache to null value.
+  eval_cache_global_ = null_value();
+  eval_cache_non_global_ = null_value();
+
   return true;
 }
 
@@ -1295,7 +1313,8 @@ Object* Heap::NumberFromDouble(double value, PretenureFlag pretenure) {
 Object* Heap::AllocateProxy(Address proxy, PretenureFlag pretenure) {
   // Statically ensure that it is safe to allocate proxies in paged spaces.
   STATIC_ASSERT(Proxy::kSize <= Page::kMaxHeapObjectSize);
-  AllocationSpace space = (pretenure == TENURED) ? OLD_SPACE : NEW_SPACE;
+  AllocationSpace space =
+      (pretenure == TENURED) ? OLD_DATA_SPACE : NEW_SPACE;
   Object* result = Allocate(proxy_map(), space);
   if (result->IsFailure()) return result;
 
@@ -1491,9 +1510,11 @@ Object* Heap:: LookupSingleCharacterStringFromCode(uint16_t code) {
 
 Object* Heap::AllocateByteArray(int length) {
   int size = ByteArray::SizeFor(length);
-  AllocationSpace space = size > MaxHeapObjectSize() ? LO_SPACE : NEW_SPACE;
+  AllocationSpace space =
+      size > MaxHeapObjectSize() ? LO_SPACE : NEW_SPACE;
 
   Object* result = AllocateRaw(size, space);
+
   if (result->IsFailure()) return result;
 
   reinterpret_cast<Array*>(result)->set_map(byte_array_map());
@@ -1510,10 +1531,13 @@ Object* Heap::CreateCode(const CodeDesc& desc,
   int sinfo_size = 0;
   if (sinfo != NULL) sinfo_size = sinfo->Serialize(NULL);
   int obj_size = Code::SizeFor(body_size, sinfo_size);
-  AllocationSpace space =
-      (obj_size > MaxHeapObjectSize()) ? LO_SPACE : CODE_SPACE;
+  Object* result;
+  if (obj_size > MaxHeapObjectSize()) {
+    result = lo_space_->AllocateRawCode(obj_size);
+  } else {
+    result = code_space_->AllocateRaw(obj_size);
+  }
 
-  Object* result = AllocateRaw(obj_size, space);
   if (result->IsFailure()) return result;
 
   // Initialize the object
@@ -1530,9 +1554,6 @@ Object* Heap::CreateCode(const CodeDesc& desc,
 #ifdef DEBUG
   code->Verify();
 #endif
-
-  CPU::FlushICache(code->instruction_start(), code->instruction_size());
-
   return code;
 }
 
@@ -1540,9 +1561,13 @@ Object* Heap::CreateCode(const CodeDesc& desc,
 Object* Heap::CopyCode(Code* code) {
   // Allocate an object the same size as the code object.
   int obj_size = code->Size();
-  AllocationSpace space =
-      (obj_size > MaxHeapObjectSize()) ? LO_SPACE : CODE_SPACE;
-  Object* result = AllocateRaw(obj_size, space);
+  Object* result;
+  if (obj_size > MaxHeapObjectSize()) {
+    result = lo_space_->AllocateRawCode(obj_size);
+  } else {
+    result = code_space_->AllocateRaw(obj_size);
+  }
+
   if (result->IsFailure()) return result;
 
   // Copy code object.
@@ -1553,9 +1578,6 @@ Object* Heap::CopyCode(Code* code) {
   // Relocate the copy.
   Code* new_code = Code::cast(result);
   new_code->Relocate(new_addr - old_addr);
-
-  CPU::FlushICache(new_code->instruction_start(), new_code->instruction_size());
-
   return new_code;
 }
 
@@ -1603,7 +1625,7 @@ Object* Heap::AllocateFunctionPrototype(JSFunction* function) {
 Object* Heap::AllocateFunction(Map* function_map,
                                SharedFunctionInfo* shared,
                                Object* prototype) {
-  Object* result = Allocate(function_map, OLD_SPACE);
+  Object* result = Allocate(function_map, OLD_POINTER_SPACE);
   if (result->IsFailure()) return result;
   return InitializeFunction(JSFunction::cast(result), shared, prototype);
 }
@@ -1687,7 +1709,8 @@ Object* Heap::AllocateJSObjectFromMap(Map* map, PretenureFlag pretenure) {
   if (properties->IsFailure()) return properties;
 
   // Allocate the JSObject.
-  AllocationSpace space = (pretenure == TENURED) ? OLD_SPACE : NEW_SPACE;
+  AllocationSpace space =
+      (pretenure == TENURED) ? OLD_POINTER_SPACE : NEW_SPACE;
   if (map->instance_size() > MaxHeapObjectSize()) space = LO_SPACE;
   Object* obj = Allocate(map, space);
   if (obj->IsFailure()) return obj;
@@ -1912,7 +1935,8 @@ Object* Heap::AllocateSymbol(unibrow::CharacterStream* buffer,
   }
 
   // Allocate string.
-  AllocationSpace space = (size > MaxHeapObjectSize()) ? LO_SPACE : CODE_SPACE;
+  AllocationSpace space =
+      (size > MaxHeapObjectSize()) ? LO_SPACE : OLD_DATA_SPACE;
   Object* result = AllocateRaw(size, space);
   if (result->IsFailure()) return result;
 
@@ -1931,7 +1955,7 @@ Object* Heap::AllocateSymbol(unibrow::CharacterStream* buffer,
 
 
 Object* Heap::AllocateRawAsciiString(int length, PretenureFlag pretenure) {
-  AllocationSpace space = (pretenure == TENURED) ? CODE_SPACE : NEW_SPACE;
+  AllocationSpace space = (pretenure == TENURED) ? OLD_DATA_SPACE : NEW_SPACE;
   int size = AsciiString::SizeFor(length);
   if (size > MaxHeapObjectSize()) {
     space = LO_SPACE;
@@ -1961,7 +1985,7 @@ Object* Heap::AllocateRawAsciiString(int length, PretenureFlag pretenure) {
 
 
 Object* Heap::AllocateRawTwoByteString(int length, PretenureFlag pretenure) {
-  AllocationSpace space = (pretenure == TENURED) ? CODE_SPACE : NEW_SPACE;
+  AllocationSpace space = (pretenure == TENURED) ? OLD_DATA_SPACE : NEW_SPACE;
   int size = TwoByteString::SizeFor(length);
   if (size > MaxHeapObjectSize()) {
     space = LO_SPACE;
@@ -1992,7 +2016,7 @@ Object* Heap::AllocateRawTwoByteString(int length, PretenureFlag pretenure) {
 
 Object* Heap::AllocateEmptyFixedArray() {
   int size = FixedArray::SizeFor(0);
-  Object* result = AllocateRaw(size, CODE_SPACE);
+  Object* result = AllocateRaw(size, OLD_DATA_SPACE);
   if (result->IsFailure()) return result;
   // Initialize the object.
   reinterpret_cast<Array*>(result)->set_map(fixed_array_map());
@@ -2010,7 +2034,8 @@ Object* Heap::AllocateFixedArray(int length, PretenureFlag pretenure) {
   if (size > MaxHeapObjectSize()) {
     result = lo_space_->AllocateRawFixedArray(size);
   } else {
-    AllocationSpace space = (pretenure == TENURED) ? OLD_SPACE : NEW_SPACE;
+    AllocationSpace space =
+        (pretenure == TENURED) ? OLD_POINTER_SPACE : NEW_SPACE;
     result = AllocateRaw(size, space);
   }
   if (result->IsFailure()) return result;
@@ -2108,7 +2133,7 @@ STRUCT_LIST(MAKE_CASE)
   }
   int size = map->instance_size();
   AllocationSpace space =
-      (size > MaxHeapObjectSize()) ? LO_SPACE : OLD_SPACE;
+      (size > MaxHeapObjectSize()) ? LO_SPACE : OLD_POINTER_SPACE;
   Object* result = Heap::Allocate(map, space);
   if (result->IsFailure()) return result;
   Struct::cast(result)->InitializeBody(size);
@@ -2121,11 +2146,8 @@ STRUCT_LIST(MAKE_CASE)
 void Heap::Print() {
   if (!HasBeenSetup()) return;
   Top::PrintStack();
-  new_space_->Print();
-  old_space_->Print();
-  code_space_->Print();
-  map_space_->Print();
-  lo_space_->Print();
+  AllSpaces spaces;
+  while (Space* space = spaces.next()) space->Print();
 }
 
 
@@ -2159,8 +2181,10 @@ void Heap::ReportHeapStatistics(const char* title) {
   MemoryAllocator::ReportStatistics();
   PrintF("To space : ");
   new_space_->ReportStatistics();
-  PrintF("Old space : ");
-  old_space_->ReportStatistics();
+  PrintF("Old pointer space : ");
+  old_pointer_space_->ReportStatistics();
+  PrintF("Old data space : ");
+  old_data_space_->ReportStatistics();
   PrintF("Code space : ");
   code_space_->ReportStatistics();
   PrintF("Map space : ");
@@ -2181,7 +2205,8 @@ bool Heap::Contains(Address addr) {
   if (OS::IsOutsideAllocatedSpace(addr)) return false;
   return HasBeenSetup() &&
     (new_space_->ToSpaceContains(addr) ||
-     old_space_->Contains(addr) ||
+     old_pointer_space_->Contains(addr) ||
+     old_data_space_->Contains(addr) ||
      code_space_->Contains(addr) ||
      map_space_->Contains(addr) ||
      lo_space_->SlowContains(addr));
@@ -2200,8 +2225,10 @@ bool Heap::InSpace(Address addr, AllocationSpace space) {
   switch (space) {
     case NEW_SPACE:
       return new_space_->ToSpaceContains(addr);
-    case OLD_SPACE:
-      return old_space_->Contains(addr);
+    case OLD_POINTER_SPACE:
+      return old_pointer_space_->Contains(addr);
+    case OLD_DATA_SPACE:
+      return old_data_space_->Contains(addr);
     case CODE_SPACE:
       return code_space_->Contains(addr);
     case MAP_SPACE:
@@ -2221,11 +2248,10 @@ void Heap::Verify() {
   VerifyPointersVisitor visitor;
   Heap::IterateRoots(&visitor);
 
-  Heap::new_space_->Verify();
-  Heap::old_space_->Verify();
-  Heap::code_space_->Verify();
-  Heap::map_space_->Verify();
-  Heap::lo_space_->Verify();
+  AllSpaces spaces;
+  while (Space* space = spaces.next()) {
+    space->Verify();
+  }
 }
 #endif  // DEBUG
 
@@ -2253,6 +2279,34 @@ Object* Heap::LookupSymbol(String* string) {
 }
 
 
+Object* Heap::LookupEvalCache(bool is_global_context, String* src) {
+  Object* cache = is_global_context ?
+      eval_cache_global_ : eval_cache_non_global_;
+  return cache == null_value() ?
+      null_value() : EvalCache::cast(cache)->Lookup(src);
+}
+
+
+Object* Heap::PutInEvalCache(bool is_global_context, String* src,
+                             JSFunction* value) {
+  Object** cache_ptr = is_global_context ?
+      &eval_cache_global_ : &eval_cache_non_global_;
+
+  if (*cache_ptr == null_value()) {
+    Object* obj = EvalCache::Allocate(kInitialEvalCacheSize);
+    if (obj->IsFailure()) return false;
+    *cache_ptr = obj;
+  }
+
+  Object* new_cache =
+      EvalCache::cast(*cache_ptr)->Put(src, value);
+  if (new_cache->IsFailure()) return new_cache;
+  *cache_ptr = new_cache;
+
+  return value;
+}
+
+
 #ifdef DEBUG
 void Heap::ZapFromSpace() {
   ASSERT(HAS_HEAP_OBJECT_TAG(kFromSpaceZapValue));
@@ -2314,7 +2368,7 @@ void Heap::IterateRSetRange(Address object_start,
 
 void Heap::IterateRSet(PagedSpace* space, ObjectSlotCallback copy_object_func) {
   ASSERT(Page::is_rset_in_use());
-  ASSERT(space == old_space_ || space == map_space_);
+  ASSERT(space == old_pointer_space_ || space == map_space_);
 
   PageIterator it(space, PageIterator::PAGES_IN_USE);
   while (it.has_next()) {
@@ -2419,7 +2473,8 @@ bool Heap::ConfigureHeapDefault() {
 
 
 int Heap::PromotedSpaceSize() {
-  return old_space_->Size()
+  return old_pointer_space_->Size()
+      + old_data_space_->Size()
       + code_space_->Size()
       + map_space_->Size()
       + lo_space_->Size();
@@ -2466,23 +2521,33 @@ bool Heap::Setup(bool create_heap_objects) {
   int old_space_size = new_space_start - old_space_start;
   int code_space_size = young_generation_size_ - old_space_size;
 
-  // Initialize new space. It will not contain code.
+  // Initialize new space.
   new_space_ = new NewSpace(initial_semispace_size_,
                             semispace_size_,
-                            NEW_SPACE,
-                            false);
+                            NEW_SPACE);
   if (new_space_ == NULL) return false;
   if (!new_space_->Setup(new_space_start, young_generation_size_)) return false;
 
   // Initialize old space, set the maximum capacity to the old generation
   // size. It will not contain code.
-  old_space_ = new OldSpace(old_generation_size_, OLD_SPACE, false);
-  if (old_space_ == NULL) return false;
-  if (!old_space_->Setup(old_space_start, old_space_size)) return false;
+  old_pointer_space_ =
+      new OldSpace(old_generation_size_, OLD_POINTER_SPACE, NOT_EXECUTABLE);
+  if (old_pointer_space_ == NULL) return false;
+  if (!old_pointer_space_->Setup(old_space_start, old_space_size >> 1)) {
+    return false;
+  }
+  old_data_space_ =
+      new OldSpace(old_generation_size_, OLD_DATA_SPACE, NOT_EXECUTABLE);
+  if (old_data_space_ == NULL) return false;
+  if (!old_data_space_->Setup(old_space_start + (old_space_size >> 1),
+                              old_space_size >> 1)) {
+    return false;
+  }
 
   // Initialize the code space, set its maximum capacity to the old
   // generation size. It needs executable memory.
-  code_space_ = new OldSpace(old_generation_size_, CODE_SPACE, true);
+  code_space_ =
+      new OldSpace(old_generation_size_, CODE_SPACE, EXECUTABLE);
   if (code_space_ == NULL) return false;
   if (!code_space_->Setup(code_space_start, code_space_size)) return false;
 
@@ -2493,8 +2558,10 @@ bool Heap::Setup(bool create_heap_objects) {
   // enough to hold at least a page will cause it to allocate.
   if (!map_space_->Setup(NULL, 0)) return false;
 
-  // The large object space may contain code, so it needs executable memory.
-  lo_space_ = new LargeObjectSpace(LO_SPACE, true);
+  // The large object code space may contain code or data.  We set the memory
+  // to be non-executable here for safety, but this means we need to enable it
+  // explicitly when allocating large code objects.
+  lo_space_ = new LargeObjectSpace(LO_SPACE);
   if (lo_space_ == NULL) return false;
   if (!lo_space_->Setup()) return false;
 
@@ -2523,10 +2590,16 @@ void Heap::TearDown() {
     new_space_ = NULL;
   }
 
-  if (old_space_ != NULL) {
-    old_space_->TearDown();
-    delete old_space_;
-    old_space_ = NULL;
+  if (old_pointer_space_ != NULL) {
+    old_pointer_space_->TearDown();
+    delete old_pointer_space_;
+    old_pointer_space_ = NULL;
+  }
+
+  if (old_data_space_ != NULL) {
+    old_data_space_->TearDown();
+    delete old_data_space_;
+    old_data_space_ = NULL;
   }
 
   if (code_space_ != NULL) {
@@ -2554,7 +2627,8 @@ void Heap::TearDown() {
 void Heap::Shrink() {
   // Try to shrink map, old, and code spaces.
   map_space_->Shrink();
-  old_space_->Shrink();
+  old_pointer_space_->Shrink();
+  old_data_space_->Shrink();
   code_space_->Shrink();
 }
 
@@ -2578,6 +2652,57 @@ void Heap::PrintHandles() {
 #endif
 
 
+Space* AllSpaces::next() {
+  switch (counter_++) {
+    case NEW_SPACE:
+      return Heap::new_space();
+    case OLD_POINTER_SPACE:
+      return Heap::old_pointer_space();
+    case OLD_DATA_SPACE:
+      return Heap::old_data_space();
+    case CODE_SPACE:
+      return Heap::code_space();
+    case MAP_SPACE:
+      return Heap::map_space();
+    case LO_SPACE:
+      return Heap::lo_space();
+    default:
+      return NULL;
+  }
+}
+
+
+PagedSpace* PagedSpaces::next() {
+  switch (counter_++) {
+    case OLD_POINTER_SPACE:
+      return Heap::old_pointer_space();
+    case OLD_DATA_SPACE:
+      return Heap::old_data_space();
+    case CODE_SPACE:
+      return Heap::code_space();
+    case MAP_SPACE:
+      return Heap::map_space();
+    default:
+      return NULL;
+  }
+}
+
+
+
+OldSpace* OldSpaces::next() {
+  switch (counter_++) {
+    case OLD_POINTER_SPACE:
+      return Heap::old_pointer_space();
+    case OLD_DATA_SPACE:
+      return Heap::old_data_space();
+    case CODE_SPACE:
+      return Heap::code_space();
+    default:
+      return NULL;
+  }
+}
+
+
 SpaceIterator::SpaceIterator() : current_space_(FIRST_SPACE), iterator_(NULL) {
 }
 
@@ -2618,8 +2743,11 @@ ObjectIterator* SpaceIterator::CreateIterator() {
     case NEW_SPACE:
       iterator_ = new SemiSpaceIterator(Heap::new_space());
       break;
-    case OLD_SPACE:
-      iterator_ = new HeapObjectIterator(Heap::old_space());
+    case OLD_POINTER_SPACE:
+      iterator_ = new HeapObjectIterator(Heap::old_pointer_space());
+      break;
+    case OLD_DATA_SPACE:
+      iterator_ = new HeapObjectIterator(Heap::old_data_space());
       break;
     case CODE_SPACE:
       iterator_ = new HeapObjectIterator(Heap::code_space());
diff --git a/src/heap.h b/src/heap.h
index a40780cc5808..2fdcea2dd4b2 100644
--- a/src/heap.h
+++ b/src/heap.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -122,7 +122,9 @@ namespace v8 { namespace internal {
   V(Code, c_entry_debug_break_code)                     \
   V(FixedArray, number_string_cache)                    \
   V(FixedArray, single_character_string_cache)          \
-  V(FixedArray, natives_source_cache)
+  V(FixedArray, natives_source_cache)                   \
+  V(Object, eval_cache_global)                          \
+  V(Object, eval_cache_non_global)
 
 #define ROOT_LIST(V)                                  \
   STRONG_ROOT_LIST(V)                                 \
@@ -247,7 +249,8 @@ class Heap : public AllStatic {
   static Address NewSpaceTop() { return new_space_->top(); }
 
   static NewSpace* new_space() { return new_space_; }
-  static OldSpace* old_space() { return old_space_; }
+  static OldSpace* old_pointer_space() { return old_pointer_space_; }
+  static OldSpace* old_data_space() { return old_data_space_; }
   static OldSpace* code_space() { return code_space_; }
   static MapSpace* map_space() { return map_space_; }
   static LargeObjectSpace* lo_space() { return lo_space_; }
@@ -500,18 +503,13 @@ class Heap : public AllStatic {
   static Object* AllocateExternalStringFromTwoByte(
       ExternalTwoByteString::Resource* resource);
 
-  // Allocates an uninitialized object.
+  // Allocates an uninitialized object.  The memory is non-executable if the
+  // hardware and OS allow.
   // Returns Failure::RetryAfterGC(requested_bytes, space) if the allocation
   // failed.
   // Please note this function does not perform a garbage collection.
-  static inline Object* AllocateRaw(int size_in_bytes, AllocationSpace space);
-
-
-  // Allocate an unitialized object during deserialization.  Performs linear
-  // allocation (ie, guaranteed no free list allocation) and assumes the
-  // spaces are all preexpanded so allocation should not fail.
-  static inline Object* AllocateForDeserialization(int size_in_bytes,
-                                                   AllocationSpace space);
+  static inline Object* AllocateRaw(int size_in_bytes,
+                                    AllocationSpace space);
 
   // Makes a new native code object
   // Returns Failure::RetryAfterGC(requested_bytes, space) if the allocation
@@ -533,6 +531,28 @@ class Heap : public AllStatic {
   }
   static Object* LookupSymbol(String* str);
 
+  // EvalCache caches function boilerplates for compiled scripts
+  // from 'eval' function.
+  // Source string is used as the key, and compiled function
+  // boilerplate as value. Because the same source has different
+  // compiled code in global or local context, we use separate
+  // caches for global and local contexts.
+  // Caches are cleared before mark-compact/mark-sweep GC's.
+
+  // Finds the function boilerplate of a source string.
+  // It returns a JSFunction object if found in the cache.
+  // The first parameter specifies whether the code is
+  // compiled in a global context.
+  static Object* LookupEvalCache(bool is_global_context, String* src);
+
+  // Put a source string and its compiled function boilerplate
+  // in the eval cache.  The cache may expand, and returns failure
+  // if it cannot expand the cache, otherwise the value is returned.
+  // The first parameter specifies whether the boilerplate is
+  // compiled in a global context.
+  static Object* PutInEvalCache(bool is_global_context,
+                                String* src, JSFunction* value);
+
   // Compute the matching symbol map for a string if possible.
   // NULL is returned if string is in new space or not flattened.
   static Map* SymbolMapForString(String* str);
@@ -551,6 +571,9 @@ class Heap : public AllStatic {
   // Returns whether required_space bytes are available after the collection.
   static bool CollectGarbage(int required_space, AllocationSpace space);
 
+  // Performs a full garbage collection.
+  static void CollectAllGarbage();
+
   // Utility to invoke the scavenger. This is needed in test code to
   // ensure correct callback for weak global handles.
   static void PerformScavenge();
@@ -609,7 +632,7 @@ class Heap : public AllStatic {
   static bool InSpace(HeapObject* value, AllocationSpace space);
 
   // Finds out which space an object should get promoted to based on its type.
-  static inline AllocationSpace TargetSpace(HeapObject* object);
+  static inline OldSpace* TargetSpace(HeapObject* object);
 
   // Sets the stub_cache_ (only used when expanding the dictionary).
   static void set_code_stubs(Dictionary* value) { code_stubs_ = value; }
@@ -726,7 +749,8 @@ class Heap : public AllStatic {
   static const int kMaxMapSpaceSize = 8*MB;
 
   static NewSpace* new_space_;
-  static OldSpace* old_space_;
+  static OldSpace* old_pointer_space_;
+  static OldSpace* old_data_space_;
   static OldSpace* code_space_;
   static MapSpace* map_space_;
   static LargeObjectSpace* lo_space_;
@@ -801,11 +825,10 @@ class Heap : public AllStatic {
                                        bool new_object,
                                        PretenureFlag pretenure = NOT_TENURED);
 
-  // Allocate an uninitialized object in map space.  The behavior is
-  // identical to Heap::AllocateRaw(size_in_bytes, MAP_SPACE), except that
-  // (a) it doesn't have to test the allocation space argument and (b) can
-  // reduce code size (since both AllocateRaw and AllocateRawMap are
-  // inlined).
+  // Allocate an uninitialized object in map space.  The behavior is identical
+  // to Heap::AllocateRaw(size_in_bytes, MAP_SPACE), except that (a) it doesn't
+  // have to test the allocation space argument and (b) can reduce code size
+  // (since both AllocateRaw and AllocateRawMap are inlined).
   static inline Object* AllocateRawMap(int size_in_bytes);
 
 
@@ -865,6 +888,7 @@ class Heap : public AllStatic {
   static void RebuildRSets(LargeObjectSpace* space);
 
   static const int kInitialSymbolTableSize = 2048;
+  static const int kInitialEvalCacheSize = 64;
 
   friend class Factory;
   friend class DisallowAllocationFailure;
@@ -912,10 +936,44 @@ class VerifyPointersAndRSetVisitor: public ObjectVisitor {
 #endif
 
 
+// Space iterator for iterating over all spaces of the heap.
+// Returns each space in turn, and null when it is done.
+class AllSpaces BASE_EMBEDDED {
+ public:
+  Space* next();
+  AllSpaces() { counter_ = FIRST_SPACE; }
+ private:
+  int counter_;
+};
+
+
+// Space iterator for iterating over all old spaces of the heap: Old pointer
+// space, old data space and code space.
+// Returns each space in turn, and null when it is done.
+class OldSpaces BASE_EMBEDDED {
+ public:
+  OldSpace* next();
+  OldSpaces() { counter_ = OLD_POINTER_SPACE; }
+ private:
+  int counter_;
+};
+
+
+// Space iterator for iterating over all the paged spaces of the heap:
+// Map space, old pointer space, old data space and code space.
+// Returns each space in turn, and null when it is done.
+class PagedSpaces BASE_EMBEDDED {
+ public:
+  PagedSpace* next();
+  PagedSpaces() { counter_ = OLD_POINTER_SPACE; }
+ private:
+  int counter_;
+};
+
+
 // Space iterator for iterating over all spaces of the heap.
 // For each space an object iterator is provided. The deallocation of the
 // returned object iterators is handled by the space iterator.
-
 class SpaceIterator : public Malloced {
  public:
   SpaceIterator();
@@ -1132,7 +1190,6 @@ class GCTracer BASE_EMBEDDED {
   int previous_marked_count_;
 };
 
-
 } }  // namespace v8::internal
 
 #endif  // V8_HEAP_H_
diff --git a/src/ic-arm.cc b/src/ic-arm.cc
index 869ffcbc896d..61b516ea3d53 100644
--- a/src/ic-arm.cc
+++ b/src/ic-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/ic-ia32.cc b/src/ic-ia32.cc
index 56dde615e508..6b0f2c4eab69 100644
--- a/src/ic-ia32.cc
+++ b/src/ic-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/ic-inl.h b/src/ic-inl.h
index 32e8df31ddd0..201048ad7c9d 100644
--- a/src/ic-inl.h
+++ b/src/ic-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/ic.cc b/src/ic.cc
index 2074a76a251d..baac44b576b1 100644
--- a/src/ic.cc
+++ b/src/ic.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -250,6 +250,26 @@ void KeyedStoreIC::Clear(Address address, Code* target) {
 }
 
 
+Object* CallIC::TryCallAsFunction(Object* object) {
+  HandleScope scope;
+  Handle<Object> target(object);
+  Handle<Object> delegate = Execution::GetFunctionDelegate(target);
+
+  if (delegate->IsJSFunction()) {
+    // Patch the receiver and use the delegate as the function to
+    // invoke. This is used for invoking objects as if they were
+    // functions.
+    const int argc = this->target()->arguments_count();
+    StackFrameLocator locator;
+    JavaScriptFrame* frame = locator.FindJavaScriptFrame(0);
+    int index = frame->ComputeExpressionsCount() - (argc + 1);
+    frame->SetExpression(index, *target);
+  }
+
+  return *delegate;
+}
+
+
 Object* CallIC::LoadFunction(State state,
                              Handle<Object> object,
                              Handle<String> name) {
@@ -259,12 +279,26 @@ Object* CallIC::LoadFunction(State state,
     return TypeError("non_object_property_call", object, name);
   }
 
+  Object* result = Heap::the_hole_value();
+
+  // Check if the name is trivially convertible to an index and get
+  // the element if so.
+  uint32_t index;
+  if (name->AsArrayIndex(&index)) {
+    result = object->GetElement(index);
+    if (result->IsJSFunction()) return result;
+
+    // Try to find a suitable function delegate for the object at hand.
+    result = TryCallAsFunction(result);
+    if (result->IsJSFunction()) return result;
+
+    // Otherwise, it will fail in the lookup step.
+  }
+
   // Lookup the property in the object.
   LookupResult lookup;
   object->Lookup(*name, &lookup);
 
-  Object* result = Heap::the_hole_value();
-
   if (!lookup.IsValid()) {
     // If the object does not have the requested property, check which
     // exception we need to throw.
@@ -328,23 +362,9 @@ Object* CallIC::LoadFunction(State state,
   }
 
   // Try to find a suitable function delegate for the object at hand.
-  HandleScope scope;
-  Handle<Object> target(result);
-  Handle<Object> delegate = Execution::GetFunctionDelegate(target);
-
-  if (delegate->IsJSFunction()) {
-    // Patch the receiver and use the delegate as the function to
-    // invoke. This is used for invoking objects as if they were
-    // functions.
-    const int argc = this->target()->arguments_count();
-    StackFrameLocator locator;
-    JavaScriptFrame* frame = locator.FindJavaScriptFrame(0);
-    int index = frame->ComputeExpressionsCount() - (argc + 1);
-    frame->SetExpression(index, *target);
-    return *delegate;
-  } else {
-    return TypeError("property_not_function", object, name);
-  }
+  result = TryCallAsFunction(result);
+  return result->IsJSFunction() ?
+      result : TypeError("property_not_function", object, name);
 }
 
 
diff --git a/src/ic.h b/src/ic.h
index b474e9f4d63c..fa45c7b4349e 100644
--- a/src/ic.h
+++ b/src/ic.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -183,6 +183,11 @@ class CallIC: public IC {
                     Handle<Object> object,
                     Handle<String> name);
 
+  // Returns a JSFunction if the object can be called as a function,
+  // and patches the stack to be ready for the call.
+  // Otherwise, it returns the undefined value.
+  Object* TryCallAsFunction(Object* object);
+
   static void Clear(Address address, Code* target);
   friend class IC;
 };
diff --git a/src/jsregexp.cc b/src/jsregexp.cc
index 0c22a79f6fcf..51bfd3777cf0 100644
--- a/src/jsregexp.cc
+++ b/src/jsregexp.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/jsregexp.h b/src/jsregexp.h
index c6316f9fcda7..32835bf5c66f 100644
--- a/src/jsregexp.h
+++ b/src/jsregexp.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/list-inl.h b/src/list-inl.h
index 1a133f827c50..a185af3197f9 100644
--- a/src/list-inl.h
+++ b/src/list-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/list.h b/src/list.h
index 50b66f804281..34b18fbe9866 100644
--- a/src/list.h
+++ b/src/list.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/log.cc b/src/log.cc
index a0d67b99756a..dbefc044aac4 100644
--- a/src/log.cc
+++ b/src/log.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/log.h b/src/log.h
index ec1c684e19ae..1c9d0b6e0534 100644
--- a/src/log.h
+++ b/src/log.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macro-assembler-arm.cc b/src/macro-assembler-arm.cc
index 21fcea420857..9817e42d08b2 100644
--- a/src/macro-assembler-arm.cc
+++ b/src/macro-assembler-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macro-assembler-arm.h b/src/macro-assembler-arm.h
index 00cf621587f7..4837f009667c 100644
--- a/src/macro-assembler-arm.h
+++ b/src/macro-assembler-arm.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macro-assembler-ia32.cc b/src/macro-assembler-ia32.cc
index c56d3349d160..50b43c90ff84 100644
--- a/src/macro-assembler-ia32.cc
+++ b/src/macro-assembler-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macro-assembler-ia32.h b/src/macro-assembler-ia32.h
index b3aba9a712c8..35fe73f51adf 100644
--- a/src/macro-assembler-ia32.h
+++ b/src/macro-assembler-ia32.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macro-assembler.h b/src/macro-assembler.h
index 3f4b63a4fbdd..f2893460847f 100644
--- a/src/macro-assembler.h
+++ b/src/macro-assembler.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/macros.py b/src/macros.py
index 32f714c297dd..a33df25c5135 100644
--- a/src/macros.py
+++ b/src/macros.py
@@ -1,4 +1,4 @@
-# Copyright 2006-2008 Google Inc. All Rights Reserved.
+# Copyright 2006-2008 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:
diff --git a/src/mark-compact.cc b/src/mark-compact.cc
index ab2bc5abd250..e155e779d757 100644
--- a/src/mark-compact.cc
+++ b/src/mark-compact.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -73,8 +73,9 @@ MarkCompactCollector::CollectorState MarkCompactCollector::state_ = IDLE;
 // collection.
 int MarkCompactCollector::live_bytes_ = 0;
 int MarkCompactCollector::live_young_objects_ = 0;
-int MarkCompactCollector::live_old_objects_ = 0;
-int MarkCompactCollector::live_immutable_objects_ = 0;
+int MarkCompactCollector::live_old_data_objects_ = 0;
+int MarkCompactCollector::live_old_pointer_objects_ = 0;
+int MarkCompactCollector::live_code_objects_ = 0;
 int MarkCompactCollector::live_map_objects_ = 0;
 int MarkCompactCollector::live_lo_objects_ = 0;
 #endif
@@ -131,14 +132,16 @@ void MarkCompactCollector::Prepare() {
   // because objects do not get promoted out of new space on non-compacting
   // GCs.
   if (!compacting_collection_) {
-    int old_gen_recoverable = Heap::old_space()->Waste()
-                            + Heap::old_space()->AvailableFree()
-                            + Heap::code_space()->Waste()
-                            + Heap::code_space()->AvailableFree();
-    int old_gen_used = old_gen_recoverable
-                     + Heap::old_space()->Size()
-                     + Heap::code_space()->Size();
-    int old_gen_fragmentation = (old_gen_recoverable * 100) / old_gen_used;
+    int old_gen_recoverable = 0;
+    int old_gen_used = 0;
+
+    OldSpaces spaces;
+    while (OldSpace* space = spaces.next()) {
+      old_gen_recoverable += space->Waste() + space->AvailableFree();
+      old_gen_used += space->Size();
+    }
+    int old_gen_fragmentation =
+      static_cast<int>((old_gen_recoverable * 100.0) / old_gen_used);
     if (old_gen_fragmentation > kFragmentationLimit) {
       compacting_collection_ = true;
     }
@@ -154,17 +157,19 @@ void MarkCompactCollector::Prepare() {
   }
 #endif
 
-  Heap::map_space()->PrepareForMarkCompact(compacting_collection_);
-  Heap::old_space()->PrepareForMarkCompact(compacting_collection_);
-  Heap::code_space()->PrepareForMarkCompact(compacting_collection_);
+  PagedSpaces spaces;
+  while (PagedSpace* space = spaces.next()) {
+    space->PrepareForMarkCompact(compacting_collection_);
+  }
 
   Counters::global_objects.Set(0);
 
 #ifdef DEBUG
   live_bytes_ = 0;
   live_young_objects_ = 0;
-  live_old_objects_ = 0;
-  live_immutable_objects_ = 0;
+  live_old_pointer_objects_ = 0;
+  live_old_data_objects_ = 0;
+  live_code_objects_ = 0;
   live_map_objects_ = 0;
   live_lo_objects_ = 0;
 #endif
@@ -216,15 +221,15 @@ static MarkingStack marking_stack;
 
 
 inline HeapObject* ShortCircuitConsString(Object** p) {
-  // Optimization: If the heap object pointed to by p is a cons string whose
-  // right substring is Heap::empty_string, update it in place to its left
-  // substring.  Return the updated value.
+  // Optimization: If the heap object pointed to by p is a non-symbol
+  // cons string whose right substring is Heap::empty_string, update
+  // it in place to its left substring.  Return the updated value.
   //
   // Here we assume that if we change *p, we replace it with a heap object
   // (ie, the left substring of a cons string is always a heap object).
   //
   // The check performed is:
-  //   object->IsConsString() &&
+  //   object->IsConsString() && !object->IsSymbol() &&
   //   (ConsString::cast(object)->second() == Heap::empty_string())
   // except the maps for the object and its possible substrings might be
   // marked.
@@ -232,7 +237,9 @@ inline HeapObject* ShortCircuitConsString(Object** p) {
   MapWord map_word = object->map_word();
   map_word.ClearMark();
   InstanceType type = map_word.ToMap()->instance_type();
-  if (type >= FIRST_NONSTRING_TYPE) return object;
+  if (type >= FIRST_NONSTRING_TYPE || (type & kIsSymbolMask) != 0) {
+    return object;
+  }
 
   StringRepresentationTag rep =
       static_cast<StringRepresentationTag>(type & kStringRepresentationMask);
@@ -575,8 +582,13 @@ void MarkCompactCollector::RefillMarkingStack() {
   ScanOverflowedObjects(&new_it);
   if (marking_stack.is_full()) return;
 
-  HeapObjectIterator old_it(Heap::old_space(), &OverflowObjectSize);
-  ScanOverflowedObjects(&old_it);
+  HeapObjectIterator old_pointer_it(Heap::old_pointer_space(),
+                                    &OverflowObjectSize);
+  ScanOverflowedObjects(&old_pointer_it);
+  if (marking_stack.is_full()) return;
+
+  HeapObjectIterator old_data_it(Heap::old_data_space(), &OverflowObjectSize);
+  ScanOverflowedObjects(&old_data_it);
   if (marking_stack.is_full()) return;
 
   HeapObjectIterator code_it(Heap::code_space(), &OverflowObjectSize);
@@ -683,10 +695,12 @@ void MarkCompactCollector::UpdateLiveObjectCount(HeapObject* obj) {
   } else if (Heap::map_space()->Contains(obj)) {
     ASSERT(obj->IsMap());
     live_map_objects_++;
-  } else if (Heap::old_space()->Contains(obj)) {
-    live_old_objects_++;
+  } else if (Heap::old_pointer_space()->Contains(obj)) {
+    live_old_pointer_objects_++;
+  } else if (Heap::old_data_space()->Contains(obj)) {
+    live_old_data_objects_++;
   } else if (Heap::code_space()->Contains(obj)) {
-    live_immutable_objects_++;
+    live_code_objects_++;
   } else if (Heap::lo_space()->Contains(obj)) {
     live_lo_objects_++;
   } else {
@@ -704,7 +718,8 @@ static int CountMarkedCallback(HeapObject* obj) {
 
 void MarkCompactCollector::VerifyHeapAfterMarkingPhase() {
   Heap::new_space()->Verify();
-  Heap::old_space()->Verify();
+  Heap::old_pointer_space()->Verify();
+  Heap::old_data_space()->Verify();
   Heap::code_space()->Verify();
   Heap::map_space()->Verify();
 
@@ -721,11 +736,15 @@ void MarkCompactCollector::VerifyHeapAfterMarkingPhase() {
   SemiSpaceIterator new_it(Heap::new_space(), &CountMarkedCallback);
   CHECK_LIVE_OBJECTS(new_it, live_young_objects_);
 
-  HeapObjectIterator old_it(Heap::old_space(), &CountMarkedCallback);
-  CHECK_LIVE_OBJECTS(old_it, live_old_objects_);
+  HeapObjectIterator old_pointer_it(Heap::old_pointer_space(),
+                                    &CountMarkedCallback);
+  CHECK_LIVE_OBJECTS(old_pointer_it, live_old_pointer_objects_);
+
+  HeapObjectIterator old_data_it(Heap::old_data_space(), &CountMarkedCallback);
+  CHECK_LIVE_OBJECTS(old_data_it, live_old_data_objects_);
 
   HeapObjectIterator code_it(Heap::code_space(), &CountMarkedCallback);
-  CHECK_LIVE_OBJECTS(code_it, live_immutable_objects_);
+  CHECK_LIVE_OBJECTS(code_it, live_code_objects_);
 
   HeapObjectIterator map_it(Heap::map_space(), &CountMarkedCallback);
   CHECK_LIVE_OBJECTS(map_it, live_map_objects_);
@@ -807,14 +826,10 @@ void EncodeFreeRegion(Address free_start, int free_size) {
 // Try to promote all objects in new space.  Heap numbers and sequential
 // strings are promoted to the code space, all others to the old space.
 inline Object* MCAllocateFromNewSpace(HeapObject* object, int object_size) {
-  AllocationSpace target_space = Heap::TargetSpace(object);
-  Object* forwarded;
-  if (target_space == OLD_SPACE) {
-    forwarded = Heap::old_space()->MCAllocateRaw(object_size);
-  } else {
-    ASSERT(target_space == CODE_SPACE);
-    forwarded = Heap::code_space()->MCAllocateRaw(object_size);
-  }
+  OldSpace* target_space = Heap::TargetSpace(object);
+  ASSERT(target_space == Heap::old_pointer_space() ||
+         target_space == Heap::old_data_space());
+  Object* forwarded = target_space->MCAllocateRaw(object_size);
 
   if (forwarded->IsFailure()) {
     forwarded = Heap::new_space()->MCAllocateRaw(object_size);
@@ -824,8 +839,14 @@ inline Object* MCAllocateFromNewSpace(HeapObject* object, int object_size) {
 
 
 // Allocation functions for the paged spaces call the space's MCAllocateRaw.
-inline Object* MCAllocateFromOldSpace(HeapObject* object, int object_size) {
-  return Heap::old_space()->MCAllocateRaw(object_size);
+inline Object* MCAllocateFromOldPointerSpace(HeapObject* object,
+                                             int object_size) {
+  return Heap::old_pointer_space()->MCAllocateRaw(object_size);
+}
+
+
+inline Object* MCAllocateFromOldDataSpace(HeapObject* object, int object_size) {
+  return Heap::old_data_space()->MCAllocateRaw(object_size);
 }
 
 
@@ -1058,10 +1079,16 @@ static void SweepSpace(PagedSpace* space, DeallocateFunction dealloc) {
 }
 
 
-void MarkCompactCollector::DeallocateOldBlock(Address start,
-                                              int size_in_bytes) {
+void MarkCompactCollector::DeallocateOldPointerBlock(Address start,
+                                                     int size_in_bytes) {
   Heap::ClearRSetRange(start, size_in_bytes);
-  Heap::old_space()->Free(start, size_in_bytes);
+  Heap::old_pointer_space()->Free(start, size_in_bytes);
+}
+
+
+void MarkCompactCollector::DeallocateOldDataBlock(Address start,
+                                                  int size_in_bytes) {
+  Heap::old_data_space()->Free(start, size_in_bytes);
 }
 
 
@@ -1093,9 +1120,13 @@ void MarkCompactCollector::EncodeForwardingAddresses() {
   Heap::new_space()->MCResetRelocationInfo();
 
   // Compute the forwarding pointers in each space.
-  EncodeForwardingAddressesInPagedSpace<MCAllocateFromOldSpace,
+  EncodeForwardingAddressesInPagedSpace<MCAllocateFromOldPointerSpace,
                                         IgnoreNonLiveObject>(
-      Heap::old_space());
+      Heap::old_pointer_space());
+
+  EncodeForwardingAddressesInPagedSpace<MCAllocateFromOldDataSpace,
+                                        IgnoreNonLiveObject>(
+      Heap::old_data_space());
 
   EncodeForwardingAddressesInPagedSpace<MCAllocateFromCodeSpace,
                                         LogNonLiveCodeObject>(
@@ -1115,7 +1146,8 @@ void MarkCompactCollector::EncodeForwardingAddresses() {
   // Write relocation info to the top page, so we can use it later.  This is
   // done after promoting objects from the new space so we get the correct
   // allocation top.
-  Heap::old_space()->MCWriteRelocationInfoToPage();
+  Heap::old_pointer_space()->MCWriteRelocationInfoToPage();
+  Heap::old_data_space()->MCWriteRelocationInfoToPage();
   Heap::code_space()->MCWriteRelocationInfoToPage();
   Heap::map_space()->MCWriteRelocationInfoToPage();
 }
@@ -1129,7 +1161,8 @@ void MarkCompactCollector::SweepSpaces() {
   // the map space last because freeing non-live maps overwrites them and
   // the other spaces rely on possibly non-live maps to get the sizes for
   // non-live objects.
-  SweepSpace(Heap::old_space(), &DeallocateOldBlock);
+  SweepSpace(Heap::old_pointer_space(), &DeallocateOldPointerBlock);
+  SweepSpace(Heap::old_data_space(), &DeallocateOldDataBlock);
   SweepSpace(Heap::code_space(), &DeallocateCodeBlock);
   SweepSpace(Heap::new_space());
   SweepSpace(Heap::map_space(), &DeallocateMapBlock);
@@ -1193,19 +1226,16 @@ static int VerifyMapObject(HeapObject* obj) {
 
 
 void MarkCompactCollector::VerifyHeapAfterEncodingForwardingAddresses() {
-  Heap::new_space()->Verify();
-  Heap::old_space()->Verify();
-  Heap::code_space()->Verify();
-  Heap::map_space()->Verify();
+  AllSpaces spaces;
+  while (Space* space = spaces.next()) space->Verify();
 
   ASSERT(state_ == ENCODE_FORWARDING_ADDRESSES);
   int live_maps = IterateLiveObjects(Heap::map_space(), &VerifyMapObject);
   ASSERT(live_maps == live_map_objects_);
 
   // Verify page headers in paged spaces.
-  VerifyPageHeaders(Heap::old_space());
-  VerifyPageHeaders(Heap::code_space());
-  VerifyPageHeaders(Heap::map_space());
+  PagedSpaces paged_spaces;
+  while (PagedSpace* space = paged_spaces.next()) VerifyPageHeaders(space);
 }
 
 
@@ -1264,7 +1294,8 @@ class UpdatingVisitor: public ObjectVisitor {
       new_addr = Memory::Address_at(f_addr);
 
 #ifdef DEBUG
-      ASSERT(Heap::old_space()->Contains(new_addr) ||
+      ASSERT(Heap::old_pointer_space()->Contains(new_addr) ||
+             Heap::old_data_space()->Contains(new_addr) ||
              Heap::code_space()->Contains(new_addr) ||
              Heap::new_space()->FromSpaceContains(new_addr));
 
@@ -1279,19 +1310,24 @@ class UpdatingVisitor: public ObjectVisitor {
       return;
 
     } else {
-      ASSERT(Heap::old_space()->Contains(obj) ||
+      ASSERT(Heap::old_pointer_space()->Contains(obj) ||
+             Heap::old_data_space()->Contains(obj) ||
              Heap::code_space()->Contains(obj) ||
              Heap::map_space()->Contains(obj));
 
       new_addr = MarkCompactCollector::GetForwardingAddressInOldSpace(obj);
-      ASSERT(Heap::old_space()->Contains(new_addr) ||
+      ASSERT(Heap::old_pointer_space()->Contains(new_addr) ||
+             Heap::old_data_space()->Contains(new_addr) ||
              Heap::code_space()->Contains(new_addr) ||
              Heap::map_space()->Contains(new_addr));
 
 #ifdef DEBUG
-      if (Heap::old_space()->Contains(obj)) {
-        ASSERT(Heap::old_space()->MCSpaceOffsetForAddress(new_addr) <=
-               Heap::old_space()->MCSpaceOffsetForAddress(old_addr));
+      if (Heap::old_pointer_space()->Contains(obj)) {
+        ASSERT(Heap::old_pointer_space()->MCSpaceOffsetForAddress(new_addr) <=
+               Heap::old_pointer_space()->MCSpaceOffsetForAddress(old_addr));
+      } else if (Heap::old_data_space()->Contains(obj)) {
+        ASSERT(Heap::old_data_space()->MCSpaceOffsetForAddress(new_addr) <=
+               Heap::old_data_space()->MCSpaceOffsetForAddress(old_addr));
       } else if (Heap::code_space()->Contains(obj)) {
         ASSERT(Heap::code_space()->MCSpaceOffsetForAddress(new_addr) <=
                Heap::code_space()->MCSpaceOffsetForAddress(old_addr));
@@ -1325,10 +1361,12 @@ void MarkCompactCollector::UpdatePointers() {
 
   int live_maps = IterateLiveObjects(Heap::map_space(),
                                      &UpdatePointersInOldObject);
-  int live_olds = IterateLiveObjects(Heap::old_space(),
-                                     &UpdatePointersInOldObject);
-  int live_immutables = IterateLiveObjects(Heap::code_space(),
-                                           &UpdatePointersInOldObject);
+  int live_pointer_olds = IterateLiveObjects(Heap::old_pointer_space(),
+                                             &UpdatePointersInOldObject);
+  int live_data_olds = IterateLiveObjects(Heap::old_data_space(),
+                                          &UpdatePointersInOldObject);
+  int live_codes = IterateLiveObjects(Heap::code_space(),
+                                      &UpdatePointersInOldObject);
   int live_news = IterateLiveObjects(Heap::new_space(),
                                      &UpdatePointersInNewObject);
 
@@ -1337,14 +1375,16 @@ void MarkCompactCollector::UpdatePointers() {
   while (it.has_next()) UpdatePointersInNewObject(it.next());
 
   USE(live_maps);
-  USE(live_olds);
-  USE(live_immutables);
+  USE(live_pointer_olds);
+  USE(live_data_olds);
+  USE(live_codes);
   USE(live_news);
 
 #ifdef DEBUG
   ASSERT(live_maps == live_map_objects_);
-  ASSERT(live_olds == live_old_objects_);
-  ASSERT(live_immutables == live_immutable_objects_);
+  ASSERT(live_data_olds == live_old_data_objects_);
+  ASSERT(live_pointer_olds == live_old_pointer_objects_);
+  ASSERT(live_codes == live_code_objects_);
   ASSERT(live_news == live_young_objects_);
 
   if (FLAG_verify_global_gc) VerifyHeapAfterUpdatingPointers();
@@ -1457,16 +1497,10 @@ Address MarkCompactCollector::GetForwardingAddressInOldSpace(HeapObject* obj) {
 void MarkCompactCollector::VerifyHeapAfterUpdatingPointers() {
   ASSERT(state_ == UPDATE_POINTERS);
 
-  Heap::new_space()->Verify();
-  Heap::old_space()->Verify();
-  Heap::code_space()->Verify();
-  Heap::map_space()->Verify();
-
-  // We don't have object size info after updating pointers, not much we can
-  // do here.
-  VerifyPageHeaders(Heap::old_space());
-  VerifyPageHeaders(Heap::code_space());
-  VerifyPageHeaders(Heap::map_space());
+  AllSpaces spaces;
+  while (Space* space = spaces.next()) space->Verify();
+  PagedSpaces paged_spaces;
+  while (PagedSpace* space = paged_spaces.next()) VerifyPageHeaders(space);
 }
 #endif
 
@@ -1482,19 +1516,23 @@ void MarkCompactCollector::RelocateObjects() {
   // Relocates objects, always relocate map objects first. Relocating
   // objects in other space relies on map objects to get object size.
   int live_maps = IterateLiveObjects(Heap::map_space(), &RelocateMapObject);
-  int live_olds = IterateLiveObjects(Heap::old_space(), &RelocateOldObject);
-  int live_immutables =
-      IterateLiveObjects(Heap::code_space(), &RelocateCodeObject);
+  int live_pointer_olds = IterateLiveObjects(Heap::old_pointer_space(),
+                                             &RelocateOldPointerObject);
+  int live_data_olds = IterateLiveObjects(Heap::old_data_space(),
+                                          &RelocateOldDataObject);
+  int live_codes = IterateLiveObjects(Heap::code_space(), &RelocateCodeObject);
   int live_news = IterateLiveObjects(Heap::new_space(), &RelocateNewObject);
 
   USE(live_maps);
-  USE(live_olds);
-  USE(live_immutables);
+  USE(live_data_olds);
+  USE(live_pointer_olds);
+  USE(live_codes);
   USE(live_news);
 #ifdef DEBUG
   ASSERT(live_maps == live_map_objects_);
-  ASSERT(live_olds == live_old_objects_);
-  ASSERT(live_immutables == live_immutable_objects_);
+  ASSERT(live_data_olds == live_old_data_objects_);
+  ASSERT(live_pointer_olds == live_old_pointer_objects_);
+  ASSERT(live_codes == live_code_objects_);
   ASSERT(live_news == live_young_objects_);
 #endif
 
@@ -1516,9 +1554,8 @@ void MarkCompactCollector::RelocateObjects() {
   // page-by-page basis after committing the m-c forwarding pointer.
   Page::set_rset_state(Page::IN_USE);
 #endif
-  Heap::map_space()->MCCommitRelocationInfo();
-  Heap::old_space()->MCCommitRelocationInfo();
-  Heap::code_space()->MCCommitRelocationInfo();
+  PagedSpaces spaces;
+  while (PagedSpace* space = spaces.next()) space->MCCommitRelocationInfo();
 
 #ifdef DEBUG
   if (FLAG_verify_global_gc) VerifyHeapAfterRelocatingObjects();
@@ -1563,15 +1600,10 @@ int MarkCompactCollector::RelocateMapObject(HeapObject* obj) {
 }
 
 
-int MarkCompactCollector::RelocateOldObject(HeapObject* obj) {
-  // decode map pointer (forwarded address)
-  MapWord encoding = obj->map_word();
-  Address map_addr = encoding.DecodeMapAddress(Heap::map_space());
-  ASSERT(Heap::map_space()->Contains(map_addr));
-
-  // Get forwarding address before resetting map pointer
-  Address new_addr = GetForwardingAddressInOldSpace(obj);
-
+static inline int RelocateOldObject(HeapObject* obj,
+                                    OldSpace* space,
+                                    Address new_addr,
+                                    Address map_addr) {
   // recover map pointer
   obj->set_map(reinterpret_cast<Map*>(HeapObject::FromAddress(map_addr)));
 
@@ -1580,28 +1612,14 @@ int MarkCompactCollector::RelocateOldObject(HeapObject* obj) {
   int obj_size = obj->Size();
   ASSERT_OBJECT_SIZE(obj_size);
 
-  Address old_addr = obj->address();
-
-  ASSERT(Heap::old_space()->MCSpaceOffsetForAddress(new_addr) <=
-         Heap::old_space()->MCSpaceOffsetForAddress(old_addr));
+  ASSERT(space->MCSpaceOffsetForAddress(new_addr) <=
+         space->MCSpaceOffsetForAddress(obj->address()));
 
-  Heap::old_space()->MCAdjustRelocationEnd(new_addr, obj_size);
-
-  if (new_addr != old_addr) {
-    memmove(new_addr, old_addr, obj_size);  // copy contents
-  }
-
-  HeapObject* copied_to = HeapObject::FromAddress(new_addr);
-  if (copied_to->IsCode()) {
-    // may also update inline cache target.
-    Code::cast(copied_to)->Relocate(new_addr - old_addr);
-    // Notify the logger that compile code has moved.
-    LOG(CodeMoveEvent(old_addr, new_addr));
-  }
+  space->MCAdjustRelocationEnd(new_addr, obj_size);
 
 #ifdef DEBUG
   if (FLAG_gc_verbose) {
-    PrintF("relocate %p -> %p\n", old_addr, new_addr);
+    PrintF("relocate %p -> %p\n", obj->address(), new_addr);
   }
 #endif
 
@@ -1609,29 +1627,50 @@ int MarkCompactCollector::RelocateOldObject(HeapObject* obj) {
 }
 
 
-int MarkCompactCollector::RelocateCodeObject(HeapObject* obj) {
+int MarkCompactCollector::RelocateOldNonCodeObject(HeapObject* obj,
+                                                   OldSpace* space) {
   // decode map pointer (forwarded address)
   MapWord encoding = obj->map_word();
   Address map_addr = encoding.DecodeMapAddress(Heap::map_space());
-  ASSERT(Heap::map_space()->Contains(HeapObject::FromAddress(map_addr)));
+  ASSERT(Heap::map_space()->Contains(map_addr));
 
   // Get forwarding address before resetting map pointer
   Address new_addr = GetForwardingAddressInOldSpace(obj);
 
-  // recover map pointer
-  obj->set_map(reinterpret_cast<Map*>(HeapObject::FromAddress(map_addr)));
-
-  // This is a non-map object, it relies on the assumption that the Map space
-  // is compacted before the other spaces (see RelocateObjects).
-  int obj_size = obj->Size();
-  ASSERT_OBJECT_SIZE(obj_size);
+  int obj_size = RelocateOldObject(obj, space, new_addr, map_addr);
 
   Address old_addr = obj->address();
 
-  ASSERT(Heap::code_space()->MCSpaceOffsetForAddress(new_addr) <=
-         Heap::code_space()->MCSpaceOffsetForAddress(old_addr));
+  if (new_addr != old_addr) {
+    memmove(new_addr, old_addr, obj_size);  // copy contents
+  }
 
-  Heap::code_space()->MCAdjustRelocationEnd(new_addr, obj_size);
+  ASSERT(!HeapObject::FromAddress(new_addr)->IsCode());
+
+  return obj_size;
+}
+
+
+int MarkCompactCollector::RelocateOldPointerObject(HeapObject* obj) {
+  return RelocateOldNonCodeObject(obj, Heap::old_pointer_space());
+}
+
+
+int MarkCompactCollector::RelocateOldDataObject(HeapObject* obj) {
+  return RelocateOldNonCodeObject(obj, Heap::old_data_space());
+}
+
+
+int MarkCompactCollector::RelocateCodeObject(HeapObject* obj) {
+  // decode map pointer (forwarded address)
+  MapWord encoding = obj->map_word();
+  Address map_addr = encoding.DecodeMapAddress(Heap::map_space());
+  ASSERT(Heap::map_space()->Contains(HeapObject::FromAddress(map_addr)));
+
+  // Get forwarding address before resetting map pointer
+  Address new_addr = GetForwardingAddressInOldSpace(obj);
+
+  int obj_size = RelocateOldObject(obj, Heap::code_space(), new_addr, map_addr);
 
   // convert inline cache target to address using old address
   if (obj->IsCode()) {
@@ -1639,6 +1678,8 @@ int MarkCompactCollector::RelocateCodeObject(HeapObject* obj) {
     Code::cast(obj)->ConvertICTargetsFromObjectToAddress();
   }
 
+  Address old_addr = obj->address();
+
   if (new_addr != old_addr) {
     memmove(new_addr, old_addr, obj_size);  // copy contents
   }
@@ -1651,12 +1692,6 @@ int MarkCompactCollector::RelocateCodeObject(HeapObject* obj) {
     LOG(CodeMoveEvent(old_addr, new_addr));
   }
 
-#ifdef DEBUG
-  if (FLAG_gc_verbose) {
-    PrintF("relocate %p -> %p\n", old_addr, new_addr);
-  }
-#endif
-
   return obj_size;
 }
 
@@ -1687,13 +1722,10 @@ int MarkCompactCollector::RelocateNewObject(HeapObject* obj) {
     ASSERT(Heap::new_space()->FromSpaceOffsetForAddress(new_addr) <=
            Heap::new_space()->ToSpaceOffsetForAddress(old_addr));
   } else {
-    AllocationSpace target_space = Heap::TargetSpace(obj);
-    if (target_space == OLD_SPACE) {
-      Heap::old_space()->MCAdjustRelocationEnd(new_addr, obj_size);
-    } else {
-      ASSERT(target_space == CODE_SPACE);
-      Heap::code_space()->MCAdjustRelocationEnd(new_addr, obj_size);
-    }
+    OldSpace* target_space = Heap::TargetSpace(obj);
+    ASSERT(target_space == Heap::old_pointer_space() ||
+           target_space == Heap::old_data_space());
+    target_space->MCAdjustRelocationEnd(new_addr, obj_size);
   }
 
   // New and old addresses cannot overlap.
@@ -1721,26 +1753,14 @@ void MarkCompactCollector::VerifyHeapAfterRelocatingObjects() {
   ASSERT(state_ == RELOCATE_OBJECTS);
 
   Heap::new_space()->Verify();
-  Heap::old_space()->Verify();
-  Heap::code_space()->Verify();
-  Heap::map_space()->Verify();
-
-  PageIterator old_it(Heap::old_space(), PageIterator::PAGES_IN_USE);
-  while (old_it.has_next()) {
-    Page* p = old_it.next();
-    ASSERT_PAGE_OFFSET(p->Offset(p->AllocationTop()));
-  }
-
-  PageIterator code_it(Heap::code_space(), PageIterator::PAGES_IN_USE);
-  while (code_it.has_next()) {
-    Page* p = code_it.next();
-    ASSERT_PAGE_OFFSET(p->Offset(p->AllocationTop()));
-  }
-
-  PageIterator map_it(Heap::map_space(), PageIterator::PAGES_IN_USE);
-  while (map_it.has_next()) {
-    Page* p = map_it.next();
-    ASSERT_PAGE_OFFSET(p->Offset(p->AllocationTop()));
+  PagedSpaces spaces;
+  while (PagedSpace* space = spaces.next()) {
+    space->Verify();
+    PageIterator it(space, PageIterator::PAGES_IN_USE);
+    while (it.has_next()) {
+      Page* p = it.next();
+      ASSERT_PAGE_OFFSET(p->Offset(p->AllocationTop()));
+    }
   }
 }
 #endif
diff --git a/src/mark-compact.h b/src/mark-compact.h
index 7fe0fb55c896..f3b4e2ab0ee3 100644
--- a/src/mark-compact.h
+++ b/src/mark-compact.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -241,7 +241,8 @@ class MarkCompactCollector : public AllStatic {
 
   // Callback functions for deallocating non-live blocks in the old
   // generation.
-  static void DeallocateOldBlock(Address start, int size_in_bytes);
+  static void DeallocateOldPointerBlock(Address start, int size_in_bytes);
+  static void DeallocateOldDataBlock(Address start, int size_in_bytes);
   static void DeallocateCodeBlock(Address start, int size_in_bytes);
   static void DeallocateMapBlock(Address start, int size_in_bytes);
 
@@ -295,9 +296,13 @@ class MarkCompactCollector : public AllStatic {
   static int RelocateMapObject(HeapObject* obj);
 
   // Relocates an old object.
-  static int RelocateOldObject(HeapObject* obj);
+  static int RelocateOldPointerObject(HeapObject* obj);
+  static int RelocateOldDataObject(HeapObject* obj);
 
-  // Relocates an immutable object in the code space.
+  // Helper function.
+  static inline int RelocateOldNonCodeObject(HeapObject* obj, OldSpace* space);
+
+  // Relocates an object in the code space.
   static int RelocateCodeObject(HeapObject* obj);
 
   // Copy a new object.
@@ -322,11 +327,14 @@ class MarkCompactCollector : public AllStatic {
   // Number of live objects in Heap::to_space_.
   static int live_young_objects_;
 
-  // Number of live objects in Heap::old_space_.
-  static int live_old_objects_;
+  // Number of live objects in Heap::old_pointer_space_.
+  static int live_old_pointer_objects_;
+
+  // Number of live objects in Heap::old_data_space_.
+  static int live_old_data_objects_;
 
   // Number of live objects in Heap::code_space_.
-  static int live_immutable_objects_;
+  static int live_code_objects_;
 
   // Number of live objects in Heap::map_space_.
   static int live_map_objects_;
diff --git a/src/math.js b/src/math.js
index 12bf70d1a71c..cb5cfb9b5eaa 100644
--- a/src/math.js
+++ b/src/math.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/memory.h b/src/memory.h
index 61e13fb22fcc..2397bc6c7a5b 100644
--- a/src/memory.h
+++ b/src/memory.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/messages.cc b/src/messages.cc
index a50bf6115379..6e8a3710d333 100644
--- a/src/messages.cc
+++ b/src/messages.cc
@@ -1,5 +1,5 @@
 
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -60,8 +60,11 @@ void MessageHandler::ReportMessage(const char* msg) {
 }
 
 
-void MessageHandler::ReportMessage(const char* type, MessageLocation* loc,
-                                   Vector< Handle<Object> > args) {
+Handle<Object> MessageHandler::MakeMessageObject(
+    const char* type,
+    MessageLocation* loc,
+    Vector< Handle<Object> > args,
+    Handle<String> stack_trace) {
   // Build error message object
   HandleScope scope;
   Handle<Object> type_str = Factory::LookupAsciiSymbol(type);
@@ -82,12 +85,16 @@ void MessageHandler::ReportMessage(const char* type, MessageLocation* loc,
   }
   Handle<Object> start_handle(Smi::FromInt(start));
   Handle<Object> end_handle(Smi::FromInt(end));
-  const int argc = 5;
+  Handle<Object> stack_trace_val = stack_trace.is_null()
+    ? Factory::undefined_value()
+    : Handle<Object>::cast(stack_trace);
+  const int argc = 6;
   Object** argv[argc] = { type_str.location(),
                           array.location(),
                           start_handle.location(),
                           end_handle.location(),
-                          script.location() };
+                          script.location(),
+                          stack_trace_val.location() };
 
   bool caught_exception = false;
   Handle<Object> message =
@@ -97,8 +104,13 @@ void MessageHandler::ReportMessage(const char* type, MessageLocation* loc,
   // skip doing the callback. This usually only happens in case of
   // stack overflow exceptions being thrown by the parser when the
   // stack is almost full.
-  if (caught_exception) return;
+  if (caught_exception) return Handle<Object>();
+  return message.EscapeFrom(&scope);
+}
+
 
+void MessageHandler::ReportMessage(MessageLocation* loc,
+                                   Handle<Object> message) {
   v8::Local<v8::Message> api_message_obj = v8::Utils::MessageToLocal(message);
 
   v8::NeanderArray global_listeners(Factory::message_listeners());
diff --git a/src/messages.h b/src/messages.h
index 2e1dda4b0d47..1ff10aae8915 100644
--- a/src/messages.h
+++ b/src/messages.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -70,6 +70,7 @@ class MessageLocation {
       : script_(script),
         start_pos_(start_pos),
         end_pos_(end_pos) { }
+  MessageLocation() : start_pos_(-1), end_pos_(-1) { }
 
   Handle<Script> script() const { return script_; }
   int start_pos() const { return start_pos_; }
@@ -89,10 +90,14 @@ class MessageHandler {
   // Report a message (w/o JS heap allocation).
   static void ReportMessage(const char* msg);
 
+  // Returns a message object for the API to use.
+  static Handle<Object> MakeMessageObject(const char* type,
+                                          MessageLocation* loc,
+                                          Vector< Handle<Object> > args,
+                                          Handle<String> stack_trace);
+
   // Report a formatted message (needs JS allocation).
-  static void ReportMessage(const char* type,
-                            MessageLocation* loc,
-                            Vector< Handle<Object> > args);
+  static void ReportMessage(MessageLocation* loc, Handle<Object> message);
 
   static void DefaultMessageReport(const MessageLocation* loc,
                                    Handle<Object> message_obj);
diff --git a/src/messages.js b/src/messages.js
index 49b0241f7d29..d27502d21b92 100644
--- a/src/messages.js
+++ b/src/messages.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -148,6 +148,8 @@ function MakeGenericError(constructor, type, args) {
         args[i] = elem.slice(0,20).concat("...");
       }
     }
+  } else if (IS_UNDEFINED(args)) {
+    args = [];
   }
 
   var e = new constructor();
@@ -555,17 +557,18 @@ function GetPositionInLine(message) {
 };
 
 
-function ErrorMessage(type, args, startPos, endPos, script) {
+function ErrorMessage(type, args, startPos, endPos, script, stackTrace) {
   this.startPos = startPos;
   this.endPos = endPos;
   this.type = type;
   this.args = args;
   this.script = script;
+  this.stackTrace = stackTrace;
 };
 
 
-function MakeMessage(type, args, startPos, endPos, script) {
-  return new ErrorMessage(type, args, startPos, endPos, script);
+function MakeMessage(type, args, startPos, endPos, script, stackTrace) {
+  return new ErrorMessage(type, args, startPos, endPos, script, stackTrace);
 };
 
 
diff --git a/src/mirror-delay.js b/src/mirror-delay.js
index c1ffed1b0f50..5f7ab0319ef1 100644
--- a/src/mirror-delay.js
+++ b/src/mirror-delay.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -708,7 +708,7 @@ ObjectMirror.prototype.lookupProperty = function(value) {
     // Skip properties which are defined through assessors.
     var property = properties[i];
     if (property.propertyType() != PropertyType.Callbacks) {
-      if (%ObjectEquals(property.value_, value.value_) == 0) {
+      if (%_ObjectEquals(property.value_, value.value_)) {
         return property;
       }
     }
@@ -728,12 +728,12 @@ ObjectMirror.prototype.lookupProperty = function(value) {
 ObjectMirror.prototype.referencedBy = function(opt_max_instances) {
   // Find all objects constructed from this function.
   var result = %DebugReferencedBy(this.value_, Mirror.prototype, opt_max_instances || 0);
-    
+
   // Make mirrors for all the instances found.
   for (var i = 0; i < result.length; i++) {
     result[i] = MakeMirror(result[i]);
   }
-    
+
   return result;
 };
 
diff --git a/src/mksnapshot.cc b/src/mksnapshot.cc
index d0a67ce55122..5ee9511d195e 100644
--- a/src/mksnapshot.cc
+++ b/src/mksnapshot.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -182,8 +182,8 @@ int main(int argc, char** argv) {
       i::Bootstrapper::NativesSourceLookup(i);
     }
   }
-  // Get rid of unreferenced scripts.
-  i::Heap::CollectGarbage(0, i::OLD_SPACE);
+  // Get rid of unreferenced scripts with a global GC.
+  i::Heap::CollectAllGarbage();
   i::Serializer ser;
   ser.Serialize();
   char* str;
diff --git a/src/natives.h b/src/natives.h
index 2e2e50737bc5..0bb879f27c30 100644
--- a/src/natives.h
+++ b/src/natives.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/objects-debug.cc b/src/objects-debug.cc
index 00b086e6b31b..dd656e08fcd4 100644
--- a/src/objects-debug.cc
+++ b/src/objects-debug.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/objects-inl.h b/src/objects-inl.h
index 37919f1f8ab9..e690327f4682 100644
--- a/src/objects-inl.h
+++ b/src/objects-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -314,6 +314,13 @@ bool Object::IsSymbolTable() {
 }
 
 
+bool Object::IsEvalCache() {
+  return IsHashTable() &&
+      (this == Heap::eval_cache_global() ||
+       this == Heap::eval_cache_non_global());
+}
+
+
 bool Object::IsPrimitive() {
   return IsOddball() || IsNumber() || IsString();
 }
@@ -1089,6 +1096,7 @@ CAST_ACCESSOR(FixedArray)
 CAST_ACCESSOR(DescriptorArray)
 CAST_ACCESSOR(Dictionary)
 CAST_ACCESSOR(SymbolTable)
+CAST_ACCESSOR(EvalCache)
 CAST_ACCESSOR(String)
 CAST_ACCESSOR(SeqString)
 CAST_ACCESSOR(AsciiString)
diff --git a/src/objects.cc b/src/objects.cc
index 2be4ccd80c2d..3f29c71e952a 100644
--- a/src/objects.cc
+++ b/src/objects.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -931,7 +931,7 @@ Object* JSObject::Copy(PretenureFlag pretenure) {
   // Make the clone.
   Object* clone = (pretenure == NOT_TENURED) ?
       Heap::Allocate(map(), NEW_SPACE) :
-      Heap::Allocate(map(), OLD_SPACE);
+      Heap::Allocate(map(), OLD_POINTER_SPACE);
   if (clone->IsFailure()) return clone;
   JSObject::cast(clone)->CopyBody(this);
 
@@ -1124,8 +1124,7 @@ Object* JSObject::ReplaceConstantFunctionProperty(String* name,
   if (value->IsJSFunction()) {
     JSFunction* function = JSFunction::cast(value);
 
-    Object* new_map =
-      map()->CopyDropTransitions();
+    Object* new_map = map()->CopyDropTransitions();
     if (new_map->IsFailure()) return new_map;
     set_map(Map::cast(new_map));
 
@@ -2646,7 +2645,7 @@ Object* DescriptorArray::CopyInsert(Descriptor* descriptor,
   int new_size = number_of_descriptors() - transitions - null_descriptors;
 
   // If key is in descriptor, we replace it in-place when filtering.
-  int index = Search(descriptor->key());
+  int index = Search(descriptor->GetKey());
   const bool inserting = (index == kNotFound);
   const bool replacing = !inserting;
   bool keep_enumeration_index = false;
@@ -2689,7 +2688,7 @@ Object* DescriptorArray::CopyInsert(Descriptor* descriptor,
   // and inserting or replacing a descriptor.
   DescriptorWriter w(new_descriptors);
   DescriptorReader r(this);
-  uint32_t descriptor_hash = descriptor->key()->Hash();
+  uint32_t descriptor_hash = descriptor->GetKey()->Hash();
 
   for (; !r.eos(); r.advance()) {
     if (r.GetKey()->Hash() > descriptor_hash ||
@@ -2915,6 +2914,22 @@ bool String::LooksValid() {
 }
 
 
+int String::Utf8Length() {
+  if (is_ascii()) return length();
+  // Attempt to flatten before accessing the string.  It probably
+  // doesn't make Utf8Length faster, but it is very likely that
+  // the string will be accessed later (for example by WriteUtf8)
+  // so it's still a good idea.
+  TryFlatten();
+  Access<StringInputBuffer> buffer(&string_input_buffer);
+  buffer->Reset(0, this);
+  int result = 0;
+  while (buffer->has_more())
+    result += unibrow::Utf8::Length(buffer->GetNext());
+  return result;
+}
+
+
 SmartPointer<char> String::ToCString(AllowNullsFlag allow_nulls,
                                      RobustnessFlag robust_flag,
                                      int offset,
@@ -4072,6 +4087,7 @@ void Code::Relocate(int delta) {
   for (RelocIterator it(this, RelocInfo::kApplyMask); !it.done(); it.next()) {
     it.rinfo()->apply(delta);
   }
+  CPU::FlushICache(instruction_start(), instruction_size());
 }
 
 
@@ -4112,6 +4128,7 @@ void Code::CopyFrom(const CodeDesc& desc) {
       it.rinfo()->apply(delta);
     }
   }
+  CPU::FlushICache(instruction_start(), instruction_size());
 }
 
 
@@ -5233,7 +5250,7 @@ int JSObject::GetEnumElementKeys(FixedArray* storage) {
 
 // The NumberKey uses carries the uint32_t as key.
 // This avoids allocation in HasProperty.
-class Dictionary::NumberKey : public Dictionary::Key {
+class NumberKey : public HashTableKey {
  public:
   explicit NumberKey(uint32_t number) {
     number_ = number;
@@ -5279,14 +5296,14 @@ class Dictionary::NumberKey : public Dictionary::Key {
   uint32_t number_;
 };
 
+
 // StringKey simply carries a string object as key.
-class Dictionary::StringKey : public Dictionary::Key {
+class StringKey : public HashTableKey {
  public:
   explicit StringKey(String* string) {
     string_ = string;
   }
 
- private:
   bool IsMatch(Object* other) {
     if (!other->IsString()) return false;
     return string_->Equals(String::cast(other));
@@ -5307,10 +5324,10 @@ class Dictionary::StringKey : public Dictionary::Key {
   String* string_;
 };
 
-// Utf8Key carries a vector of chars as key.
-class SymbolTable::Utf8Key : public SymbolTable::Key {
+// Utf8SymbolKey carries a vector of chars as key.
+class Utf8SymbolKey : public HashTableKey {
  public:
-  explicit Utf8Key(Vector<const char> string)
+  explicit Utf8SymbolKey(Vector<const char> string)
       : string_(string), hash_(0) { }
 
   bool IsMatch(Object* other) {
@@ -5350,10 +5367,10 @@ class SymbolTable::Utf8Key : public SymbolTable::Key {
 };
 
 
-// StringKey carries a string object as key.
-class SymbolTable::StringKey : public SymbolTable::Key {
+// SymbolKey carries a string/symbol object as key.
+class SymbolKey : public HashTableKey {
  public:
-  explicit StringKey(String* string) : string_(string) { }
+  explicit SymbolKey(String* string) : string_(string) { }
 
   HashFunction GetHashFunction() {
     return StringHash;
@@ -5367,6 +5384,15 @@ class SymbolTable::StringKey : public SymbolTable::Key {
   uint32_t Hash() { return string_->Hash(); }
 
   Object* GetObject() {
+    // If the string is a cons string, attempt to flatten it so that
+    // symbols will most often be flat strings.
+    if (string_->IsConsString()) {
+      ConsString* cons_string = ConsString::cast(string_);
+      cons_string->TryFlatten();
+      if (cons_string->second() == Heap::empty_string()) {
+        string_ = String::cast(cons_string->first());
+      }
+    }
     // Transform string to symbol if possible.
     Map* map = Heap::SymbolMapForString(string_);
     if (map != NULL) {
@@ -5417,7 +5443,7 @@ Object* HashTable<prefix_size, element_size>::Allocate(int at_least_space_for) {
 
 // Find entry for key otherwise return -1.
 template <int prefix_size, int element_size>
-int HashTable<prefix_size, element_size>::FindEntry(Key* key) {
+int HashTable<prefix_size, element_size>::FindEntry(HashTableKey* key) {
   uint32_t nof = NumberOfElements();
   if (nof == 0) return -1;  // Bail out if empty.
 
@@ -5444,7 +5470,8 @@ int HashTable<prefix_size, element_size>::FindEntry(Key* key) {
 
 
 template<int prefix_size, int element_size>
-Object* HashTable<prefix_size, element_size>::EnsureCapacity(int n, Key* key) {
+Object* HashTable<prefix_size, element_size>::EnsureCapacity(
+    int n, HashTableKey* key) {
   int capacity = Capacity();
   int nof = NumberOfElements() + n;
   // Make sure 20% is free
@@ -5502,19 +5529,23 @@ template class HashTable<0, 1>;
 template class HashTable<2, 3>;
 
 
+// Force instantiation of EvalCache's base class
+template class HashTable<0, 2>;
+
+
 Object* SymbolTable::LookupString(String* string, Object** s) {
-  StringKey key(string);
+  SymbolKey key(string);
   return LookupKey(&key, s);
 }
 
 
 Object* SymbolTable::LookupSymbol(Vector<const char> str, Object** s) {
-  Utf8Key key(str);
+  Utf8SymbolKey key(str);
   return LookupKey(&key, s);
 }
 
 
-Object* SymbolTable::LookupKey(Key* key, Object** s) {
+Object* SymbolTable::LookupKey(HashTableKey* key, Object** s) {
   int entry = FindEntry(key);
 
   // Symbol already in table.
@@ -5545,6 +5576,31 @@ Object* SymbolTable::LookupKey(Key* key, Object** s) {
 }
 
 
+Object* EvalCache::Lookup(String* src) {
+  StringKey key(src);
+  int entry = FindEntry(&key);
+  if (entry != -1) {
+    return get(EntryToIndex(entry) + 1);
+  } else {
+    return Heap::undefined_value();
+  }
+}
+
+
+Object* EvalCache::Put(String* src, Object* value) {
+  StringKey key(src);
+  Object* obj = EnsureCapacity(1, &key);
+  if (obj->IsFailure()) return obj;
+
+  EvalCache* cache = reinterpret_cast<EvalCache*>(obj);
+  int entry = cache->FindInsertionEntry(src, key.Hash());
+  cache->set(EntryToIndex(entry), src);
+  cache->set(EntryToIndex(entry) + 1, value);
+  cache->ElementAdded();
+  return cache;
+}
+
+
 Object* Dictionary::Allocate(int at_least_space_for) {
   Object* obj = DictionaryBase::Allocate(at_least_space_for);
   // Initialize the next enumeration index.
@@ -5607,7 +5663,7 @@ Object* Dictionary::GenerateNewEnumerationIndices() {
 }
 
 
-Object* Dictionary::EnsureCapacity(int n, Key* key) {
+Object* Dictionary::EnsureCapacity(int n, HashTableKey* key) {
   // Check whether there are enough enumeration indices to add n elements.
   if (key->IsStringKey() &&
       !PropertyDetails::IsValidIndex(NextEnumerationIndex() + n)) {
@@ -5663,7 +5719,7 @@ int Dictionary::FindNumberEntry(uint32_t index) {
 }
 
 
-Object* Dictionary::AtPut(Key* key, Object* value) {
+Object* Dictionary::AtPut(HashTableKey* key, Object* value) {
   int entry = FindEntry(key);
 
   // If the entry is present set the value;
@@ -5683,7 +5739,8 @@ Object* Dictionary::AtPut(Key* key, Object* value) {
 }
 
 
-Object* Dictionary::Add(Key* key, Object* value, PropertyDetails details) {
+Object* Dictionary::Add(HashTableKey* key, Object* value,
+                        PropertyDetails details) {
   // Check whether the dictionary should be extended.
   Object* obj = EnsureCapacity(1, key);
   if (obj->IsFailure()) return obj;
diff --git a/src/objects.h b/src/objects.h
index 1f1a80512c67..ba9de248a06d 100644
--- a/src/objects.h
+++ b/src/objects.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -614,6 +614,7 @@ class Object BASE_EMBEDDED {
   inline bool IsHashTable();
   inline bool IsDictionary();
   inline bool IsSymbolTable();
+  inline bool IsEvalCache();
   inline bool IsPrimitive();
   inline bool IsGlobalObject();
   inline bool IsJSGlobalObject();
@@ -1681,6 +1682,26 @@ class DescriptorArray: public FixedArray {
 // table.  The prefix size indicates an amount of memory in the
 // beginning of the backing storage that can be used for non-element
 // information by subclasses.
+
+// HashTableKey is an abstract superclass keys.
+class HashTableKey {
+ public:
+  // Returns whether the other object matches this key.
+  virtual bool IsMatch(Object* other) = 0;
+  typedef uint32_t (*HashFunction)(Object* obj);
+  // Returns the hash function used for this key.
+  virtual HashFunction GetHashFunction() = 0;
+  // Returns the hash value for this key.
+  virtual uint32_t Hash() = 0;
+  // Returns the key object for storing into the dictionary.
+  // If allocations fails a failure object is returned.
+  virtual Object* GetObject() = 0;
+  virtual bool IsStringKey() = 0;
+  // Required.
+  virtual ~HashTableKey() {}
+};
+
+
 template<int prefix_size, int element_size>
 class HashTable: public FixedArray {
  public:
@@ -1722,24 +1743,6 @@ class HashTable: public FixedArray {
   // Casting.
   static inline HashTable* cast(Object* obj);
 
-  // Key is an abstract superclass keys.
-  class Key {
-   public:
-    // Returns whether the other object matches this key.
-    virtual bool IsMatch(Object* other) = 0;
-    typedef uint32_t (*HashFunction)(Object* obj);
-    // Returns the hash function used for this key.
-    virtual HashFunction GetHashFunction() = 0;
-    // Returns the hash value for this key.
-    virtual uint32_t Hash() = 0;
-    // Returns the key object for storing into the dictionary.
-    // If allocations fails a failure object is returned.
-    virtual Object* GetObject() = 0;
-    virtual bool IsStringKey() = 0;
-    // Required.
-    virtual ~Key() {}
-  };
-
   // Compute the probe offset (quadratic probing).
   INLINE(static uint32_t GetProbeOffset(uint32_t n)) {
     return (n + n * n) >> 1;
@@ -1755,7 +1758,7 @@ class HashTable: public FixedArray {
 
  protected:
   // Find entry for key otherwise return -1.
-  int FindEntry(Key* key);
+  int FindEntry(HashTableKey* key);
 
   // Find the entry at which to insert element with the given key that
   // has the given hash value.
@@ -1788,7 +1791,7 @@ class HashTable: public FixedArray {
   }
 
   // Ensure enough space for n additional elements.
-  Object* EnsureCapacity(int n, Key* key);
+  Object* EnsureCapacity(int n, HashTableKey* key);
 };
 
 
@@ -1809,14 +1812,28 @@ class SymbolTable: public HashTable<0, 1> {
   static inline SymbolTable* cast(Object* obj);
 
  private:
-  Object* LookupKey(Key* key, Object** s);
-  class Utf8Key;   // Key based on utf8 string.
-  class StringKey;  // Key based on String*.
+  Object* LookupKey(HashTableKey* key, Object** s);
 
   DISALLOW_IMPLICIT_CONSTRUCTORS(SymbolTable);
 };
 
 
+// EvalCache for caching eval'ed string and function.
+//
+// The cache is cleaned up during a mark-compact GC.
+class EvalCache: public HashTable<0, 2> {
+ public:
+  // Find cached value for a string key, otherwise return null.
+  Object* Lookup(String* src);
+  Object* Put(String* src, Object* value);
+
+  static inline EvalCache* cast(Object* obj);
+
+ private:
+  DISALLOW_IMPLICIT_CONSTRUCTORS(EvalCache);
+};
+
+
 // Dictionary for keeping properties and elements in slow case.
 //
 // One element in the prefix is used for storing non-element
@@ -1924,7 +1941,7 @@ class Dictionary: public DictionaryBase {
   static Object* Allocate(int at_least_space_for);
 
   // Ensure enough space for n additional elements.
-  Object* EnsureCapacity(int n, Key* key);
+  Object* EnsureCapacity(int n, HashTableKey* key);
 
 #ifdef DEBUG
   void Print();
@@ -1939,9 +1956,9 @@ class Dictionary: public DictionaryBase {
 
  private:
   // Generic at put operation.
-  Object* AtPut(Key* key, Object* value);
+  Object* AtPut(HashTableKey* key, Object* value);
 
-  Object* Add(Key* key, Object* value, PropertyDetails details);
+  Object* Add(HashTableKey* key, Object* value, PropertyDetails details);
 
   // Add entry to dictionary.
   void AddEntry(Object* key,
@@ -1963,9 +1980,6 @@ class Dictionary: public DictionaryBase {
   static const int kMaxNumberKeyIndex = kPrefixStartIndex;
   static const int kNextEnumnerationIndexIndex = kMaxNumberKeyIndex + 1;
 
-  class NumberKey;  // Key containing uint32_t.
-  class StringKey;  // Key containing String*.
-
   DISALLOW_IMPLICIT_CONSTRUCTORS(Dictionary);
 };
 
@@ -2842,6 +2856,8 @@ class String: public HeapObject {
       RobustnessFlag robustness_flag = FAST_STRING_TRAVERSAL,
       int* length_output = 0);
 
+  int Utf8Length();
+
   // Return a 16 bit Unicode representation of the string.
   // The string should be nearly flat, otherwise the performance of
   // of this method may be very bad.  Setting robustness_flag to
@@ -3327,6 +3343,8 @@ class Oddball: public HeapObject {
 
 
 // Proxy describes objects pointing from JavaScript to C structures.
+// Since they cannot contain references to JS HeapObjects they can be
+// placed in old_data_space.
 class Proxy: public HeapObject {
  public:
   // [proxy]: field containing the address.
diff --git a/src/parser.cc b/src/parser.cc
index d9a65f3a3f37..5d7ed0f3aff4 100644
--- a/src/parser.cc
+++ b/src/parser.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -151,6 +151,13 @@ class Parser {
   Expression* ParseObjectLiteral(bool* ok);
   Expression* ParseRegExpLiteral(bool seen_equal, bool* ok);
 
+  // Decide if a property should be the object boilerplate.
+  bool IsBoilerplateProperty(ObjectLiteral::Property* property);
+  // If the property is CONSTANT type, it returns the literal value,
+  // otherwise, it return undefined literal as the placeholder
+  // in the object literal boilerplate.
+  Literal* GetBoilerplateValue(ObjectLiteral::Property* property);
+
   enum FunctionLiteralType {
     EXPRESSION,
     DECLARATION,
@@ -1477,7 +1484,7 @@ Statement* Parser::ParseContinueStatement(bool* ok) {
   Handle<String> label(static_cast<String**>(NULL));
   Token::Value tok = peek();
   if (!scanner_.has_line_terminator_before_next() &&
-      tok != Token::SEMICOLON && tok != Token::RBRACE) {
+      tok != Token::SEMICOLON && tok != Token::RBRACE && tok != Token::EOS) {
     label = ParseIdentifier(CHECK_OK);
   }
   IterationStatement* target = NULL;
@@ -1505,7 +1512,7 @@ Statement* Parser::ParseBreakStatement(ZoneStringList* labels, bool* ok) {
   Handle<String> label;
   Token::Value tok = peek();
   if (!scanner_.has_line_terminator_before_next() &&
-      tok != Token::SEMICOLON && tok != Token::RBRACE) {
+      tok != Token::SEMICOLON && tok != Token::RBRACE && tok != Token::EOS) {
     label = ParseIdentifier(CHECK_OK);
   }
   // Parse labelled break statements that target themselves into
@@ -2549,7 +2556,7 @@ Expression* Parser::ParsePrimaryExpression(bool* ok) {
       Consume(Token::STRING);
       Handle<String> symbol =
           factory()->LookupSymbol(scanner_.literal_string(),
-                                scanner_.literal_length());
+                                  scanner_.literal_length());
       result = NEW(Literal(symbol));
       break;
     }
@@ -2643,6 +2650,19 @@ Expression* Parser::ParseArrayLiteral(bool* ok) {
 }
 
 
+bool Parser::IsBoilerplateProperty(ObjectLiteral::Property* property) {
+  return property != NULL &&
+         property->kind() != ObjectLiteral::Property::PROTOTYPE;
+}
+
+
+Literal* Parser::GetBoilerplateValue(ObjectLiteral::Property* property) {
+  if (property->kind() == ObjectLiteral::Property::CONSTANT)
+    return property->value()->AsLiteral();
+  return GetLiteralUndefined();
+}
+
+
 Expression* Parser::ParseObjectLiteral(bool* ok) {
   // ObjectLiteral ::
   //   '{' (
@@ -2652,7 +2672,7 @@ Expression* Parser::ParseObjectLiteral(bool* ok) {
 
   ZoneListWrapper<ObjectLiteral::Property> properties =
       factory()->NewList<ObjectLiteral::Property>(4);
-  int number_of_constant_properties = 0;
+  int number_of_boilerplate_properties = 0;
 
   Expect(Token::LBRACE, CHECK_OK);
   while (peek() != Token::RBRACE) {
@@ -2674,6 +2694,8 @@ Expression* Parser::ParseObjectLiteral(bool* ok) {
                 ParseFunctionLiteral(name, kNoPosition, DECLARATION, CHECK_OK);
             ObjectLiteral::Property* property =
                 NEW(ObjectLiteral::Property(is_getter, value));
+            if (IsBoilerplateProperty(property))
+              number_of_boilerplate_properties++;
             properties.Add(property);
             if (peek() != Token::RBRACE) Expect(Token::COMMA, CHECK_OK);
             continue;  // restart the while
@@ -2686,8 +2708,8 @@ Expression* Parser::ParseObjectLiteral(bool* ok) {
       case Token::STRING: {
         Consume(Token::STRING);
         Handle<String> string =
-          factory()->LookupSymbol(scanner_.literal_string(),
-                                  scanner_.literal_length());
+            factory()->LookupSymbol(scanner_.literal_string(),
+                                    scanner_.literal_length());
         uint32_t index;
         if (!string.is_null() && string->AsArrayIndex(&index)) {
           key = NewNumberLiteral(index);
@@ -2715,10 +2737,10 @@ Expression* Parser::ParseObjectLiteral(bool* ok) {
 
     ObjectLiteral::Property* property =
         NEW(ObjectLiteral::Property(key, value));
-    if ((property != NULL) &&
-        property->kind() == ObjectLiteral::Property::CONSTANT) {
-      number_of_constant_properties++;
-    }
+
+    // Count CONSTANT or COMPUTED properties to maintain the enumeration order.
+    if (IsBoilerplateProperty(property))
+      number_of_boilerplate_properties++;
     properties.Add(property);
 
     // TODO(1240767): Consider allowing trailing comma.
@@ -2730,17 +2752,21 @@ Expression* Parser::ParseObjectLiteral(bool* ok) {
   if (is_pre_parsing_) return NULL;
 
   Handle<FixedArray> constant_properties =
-      Factory::NewFixedArray(number_of_constant_properties * 2, TENURED);
+      Factory::NewFixedArray(number_of_boilerplate_properties * 2, TENURED);
   int position = 0;
   for (int i = 0; i < properties.length(); i++) {
     ObjectLiteral::Property* property = properties.at(i);
-    if (property->kind() == ObjectLiteral::Property::CONSTANT) {
-      Handle<Object> key = property->key()->handle();
-      Literal* literal = property->value()->AsLiteral();
-      // Add name, value pair to the fixed array.
-      constant_properties->set(position++, *key);
-      constant_properties->set(position++, *literal->handle());
-    }
+    if (!IsBoilerplateProperty(property)) continue;
+
+    // Add CONSTANT and COMPUTED properties to boilerplate. Use undefined
+    // value for COMPUTED properties, the real value is filled in at
+    // runtime. The enumeration order is maintained.
+    Handle<Object> key = property->key()->handle();
+    Literal* literal = GetBoilerplateValue(property);
+
+    // Add name, value pair to the fixed array.
+    constant_properties->set(position++, *key);
+    constant_properties->set(position++, *literal->handle());
   }
 
   // Construct the expression for calling Runtime::CreateObjectLiteral
@@ -3006,7 +3032,7 @@ Handle<String> Parser::ParseIdentifier(bool* ok) {
   Expect(Token::IDENTIFIER, ok);
   if (!*ok) return Handle<String>();
   return factory()->LookupSymbol(scanner_.literal_string(),
-                               scanner_.literal_length());
+                                 scanner_.literal_length());
 }
 
 // This function reads an identifier and determines whether or not it
diff --git a/src/parser.h b/src/parser.h
index 6c1753d89e20..d331d73c45a0 100644
--- a/src/parser.h
+++ b/src/parser.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/platform-linux.cc b/src/platform-linux.cc
index e19faad29909..ba72768a7ceb 100644
--- a/src/platform-linux.cc
+++ b/src/platform-linux.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -67,7 +67,12 @@ double ceiling(double x) {
 
 void OS::Setup() {
   // Seed the random number generator.
-  srandom(static_cast<unsigned int>(TimeCurrentMillis()));
+  // Convert the current time to a 64-bit integer first, before converting it
+  // to an unsigned. Going directly can cause an overflow and the seed to be
+  // set to all ones. The seed will be identical for different instances that
+  // call this setup code within the same millisecond.
+  uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis());
+  srandom(static_cast<unsigned int>(seed));
 }
 
 
@@ -256,7 +261,11 @@ OS::MemoryMappedFile* OS::MemoryMappedFile::create(const char* name, int size,
     void* initial) {
   FILE* file = fopen(name, "w+");
   if (file == NULL) return NULL;
-  fwrite(initial, size, 1, file);
+  int result = fwrite(initial, size, 1, file);
+  if (result < 1) {
+    fclose(file);
+    return NULL;
+  }
   void* memory =
       mmap(0, size, PROT_READ | PROT_WRITE, MAP_SHARED, fileno(file), 0);
   return new PosixMemoryMappedFile(file, memory, size);
@@ -285,11 +294,14 @@ void OS::LogSharedLibraryAddresses() {
     addr_buffer[0] = '0';
     addr_buffer[1] = 'x';
     addr_buffer[10] = 0;
-    read(fd, addr_buffer + 2, 8);
+    int result = read(fd, addr_buffer + 2, 8);
+    if (result < 8) break;
     unsigned start = StringToLongLong(addr_buffer);
-    read(fd, addr_buffer + 2, 1);
-    if (addr_buffer[2] != '-') return;
-    read(fd, addr_buffer + 2, 8);
+    result = read(fd, addr_buffer + 2, 1);
+    if (result < 1) break;
+    if (addr_buffer[2] != '-') break;
+    result = read(fd, addr_buffer + 2, 8);
+    if (result < 8) break;
     unsigned end = StringToLongLong(addr_buffer);
     char buffer[MAP_LENGTH];
     int bytes_read = -1;
@@ -297,9 +309,8 @@ void OS::LogSharedLibraryAddresses() {
       bytes_read++;
       if (bytes_read >= MAP_LENGTH - 1)
         break;
-      int result = read(fd, buffer + bytes_read, 1);
-      // A read error means that -1 is returned.
-      if (result < 1) return;
+      result = read(fd, buffer + bytes_read, 1);
+      if (result < 1) break;
     } while (buffer[bytes_read] != '\n');
     buffer[bytes_read] = 0;
     // There are 56 chars to ignore at this point in the line.
@@ -309,6 +320,7 @@ void OS::LogSharedLibraryAddresses() {
     buffer[bytes_read] = 0;
     LOG(SharedLibraryEvent(buffer + 56, start, end));
   }
+  close(fd);
 #endif
 }
 
@@ -346,8 +358,8 @@ static const int kMmapFd = -1;
 static const int kMmapFdOffset = 0;
 
 
-VirtualMemory::VirtualMemory(size_t size, void* address_hint) {
-  address_ = mmap(address_hint, size, PROT_NONE,
+VirtualMemory::VirtualMemory(size_t size) {
+  address_ = mmap(NULL, size, PROT_NONE,
                   MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE,
                   kMmapFd, kMmapFdOffset);
   size_ = size;
diff --git a/src/platform-macos.cc b/src/platform-macos.cc
index 58e16a837447..757312533580 100644
--- a/src/platform-macos.cc
+++ b/src/platform-macos.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -73,7 +73,12 @@ double ceiling(double x) {
 
 void OS::Setup() {
   // Seed the random number generator.
-  srandom(static_cast<unsigned int>(TimeCurrentMillis()));
+  // Convert the current time to a 64-bit integer first, before converting it
+  // to an unsigned. Going directly will cause an overflow and the seed to be
+  // set to all ones. The seed will be identical for different instances that
+  // call this setup code within the same millisecond.
+  uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis());
+  srandom(static_cast<unsigned int>(seed));
 }
 
 
@@ -312,8 +317,8 @@ static const int kMmapFd = -1;
 static const int kMmapFdOffset = 0;
 
 
-VirtualMemory::VirtualMemory(size_t size, void* address_hint) {
-  address_ = mmap(address_hint, size, PROT_NONE,
+VirtualMemory::VirtualMemory(size_t size) {
+  address_ = mmap(NULL, size, PROT_NONE,
                   MAP_PRIVATE | MAP_ANON | MAP_NORESERVE,
                   kMmapFd, kMmapFdOffset);
   size_ = size;
diff --git a/src/platform-nullos.cc b/src/platform-nullos.cc
index 214ee94b4265..98cb23032a5d 100644
--- a/src/platform-nullos.cc
+++ b/src/platform-nullos.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/platform-win32.cc b/src/platform-win32.cc
index c697028c7f79..60354659d281 100644
--- a/src/platform-win32.cc
+++ b/src/platform-win32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -493,7 +493,12 @@ char* Time::LocalTimezone() {
 
 void OS::Setup() {
   // Seed the random number generator.
-  srand(static_cast<unsigned int>(TimeCurrentMillis()));
+  // Convert the current time to a 64-bit integer first, before converting it
+  // to an unsigned. Going directly can cause an overflow and the seed to be
+  // set to all ones. The seed will be identical for different instances that
+  // call this setup code within the same millisecond.
+  uint64_t seed = static_cast<uint64_t>(TimeCurrentMillis());
+  srand(static_cast<unsigned int>(seed));
 }
 
 
@@ -1171,9 +1176,8 @@ bool VirtualMemory::IsReserved() {
 }
 
 
-VirtualMemory::VirtualMemory(size_t size, void* address_hint) {
-  address_ =
-      VirtualAlloc(address_hint, size, MEM_RESERVE, PAGE_NOACCESS);
+VirtualMemory::VirtualMemory(size_t size) {
+  address_ = VirtualAlloc(NULL, size, MEM_RESERVE, PAGE_NOACCESS);
   size_ = size;
 }
 
diff --git a/src/platform.h b/src/platform.h
index 50fc4112cad6..1cb42d26d4a1 100644
--- a/src/platform.h
+++ b/src/platform.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -222,7 +222,7 @@ class OS {
 class VirtualMemory {
  public:
   // Reserves virtual memory with size.
-  VirtualMemory(size_t size, void* address_hint = 0);
+  explicit VirtualMemory(size_t size);
   ~VirtualMemory();
 
   // Returns whether the memory has been reserved.
diff --git a/src/prettyprinter.cc b/src/prettyprinter.cc
index 2160cb6e2900..2f377d80335e 100644
--- a/src/prettyprinter.cc
+++ b/src/prettyprinter.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/prettyprinter.h b/src/prettyprinter.h
index 4d683f102f25..e10b35706a5a 100644
--- a/src/prettyprinter.h
+++ b/src/prettyprinter.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/property.cc b/src/property.cc
index 7546195871ea..6c2153008a95 100644
--- a/src/property.cc
+++ b/src/property.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/property.h b/src/property.h
index deaedd10db7c..4b6de3a98470 100644
--- a/src/property.h
+++ b/src/property.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -44,8 +44,6 @@ class Descriptor BASE_EMBEDDED {
     return Smi::cast(value)->value();
   }
 
-  String* key() { return key_; }
-
   Object* KeyToSymbol() {
     if (!key_->IsSymbol()) {
       Object* result = Heap::LookupSymbol(key_);
diff --git a/src/regexp-delay.js b/src/regexp-delay.js
index 320e65bd16c1..716ad9b265bd 100644
--- a/src/regexp-delay.js
+++ b/src/regexp-delay.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/rewriter.cc b/src/rewriter.cc
index a417b424b61a..6954b23328c2 100644
--- a/src/rewriter.cc
+++ b/src/rewriter.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/rewriter.h b/src/rewriter.h
index dd2845b7411f..aa1cd2a893f0 100644
--- a/src/rewriter.h
+++ b/src/rewriter.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/runtime.cc b/src/runtime.cc
index 310611cdf75f..5bab87510922 100644
--- a/src/runtime.cc
+++ b/src/runtime.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -2309,14 +2309,6 @@ static Object* Runtime_NumberSar(Arguments args) {
 }
 
 
-static Object* Runtime_ObjectEquals(Arguments args) {
-  NoHandleAllocation ha;
-  ASSERT(args.length() == 2);
-
-  return Smi::FromInt(args[0] == args[1] ? EQUAL : NOT_EQUAL);
-}
-
-
 static Object* Runtime_NumberEquals(Arguments args) {
   NoHandleAllocation ha;
   ASSERT(args.length() == 2);
@@ -2387,6 +2379,66 @@ static Object* Runtime_NumberCompare(Arguments args) {
 }
 
 
+// Compare two Smis as if they were converted to strings and then
+// compared lexicographically.
+static Object* Runtime_SmiLexicographicCompare(Arguments args) {
+  NoHandleAllocation ha;
+  ASSERT(args.length() == 2);
+
+  // Arrays for the individual characters of the two Smis.  Smis are
+  // 31 bit integers and 10 decimal digits are therefore enough.
+  static int x_elms[10];
+  static int y_elms[10];
+
+  // Extract the integer values from the Smis.
+  CONVERT_CHECKED(Smi, x, args[0]);
+  CONVERT_CHECKED(Smi, y, args[1]);
+  int x_value = x->value();
+  int y_value = y->value();
+
+  // If the integers are equal so are the string representations.
+  if (x_value == y_value) return Smi::FromInt(EQUAL);
+
+  // If one of the integers are zero the normal integer order is the
+  // same as the lexicographic order of the string representations.
+  if (x_value == 0 || y_value == 0) return Smi::FromInt(x_value - y_value);
+
+  // If only one of the intergers is negative the negative number is
+  // smallest because the char code of '-' is less than the char code
+  // of any digit.  Otherwise, we make both values positive.
+  if (x_value < 0 || y_value < 0) {
+    if (y_value >= 0) return Smi::FromInt(LESS);
+    if (x_value >= 0) return Smi::FromInt(GREATER);
+    x_value = -x_value;
+    y_value = -y_value;
+  }
+
+  // Convert the integers to arrays of their decimal digits.
+  int x_index = 0;
+  int y_index = 0;
+  while (x_value > 0) {
+    x_elms[x_index++] = x_value % 10;
+    x_value /= 10;
+  }
+  while (y_value > 0) {
+    y_elms[y_index++] = y_value % 10;
+    y_value /= 10;
+  }
+
+  // Loop through the arrays of decimal digits finding the first place
+  // where they differ.
+  while (--x_index >= 0 && --y_index >= 0) {
+    int diff = x_elms[x_index] - y_elms[y_index];
+    if (diff != 0) return Smi::FromInt(diff);
+  }
+
+  // If one array is a suffix of the other array, the longest array is
+  // the representation of the largest of the Smis in the
+  // lexicographic ordering.
+  return Smi::FromInt(x_index - y_index);
+}
+
+
 static Object* Runtime_StringCompare(Arguments args) {
   NoHandleAllocation ha;
   ASSERT(args.length() == 2);
@@ -3169,7 +3221,8 @@ static Object* Runtime_DebugPrint(Arguments args) {
   }
   args[0]->Print();
 #else
-  PrintF("DebugPrint: %p", args[0]);
+  // ShortPrint is available in release mode. Print is not.
+  args[0]->ShortPrint();
 #endif
   PrintF("\n");
 
@@ -3328,10 +3381,26 @@ static Object* Runtime_CompileString(Arguments args) {
   }
 
   // Compile eval() source.
+  bool is_global_context = context->IsGlobalContext();
   Handle<String> source(String::cast(args[0]));
-  Handle<JSFunction> boilerplate =
-      Compiler::CompileEval(context->IsGlobalContext(), source);
-  if (boilerplate.is_null()) return Failure::Exception();
+  Object* obj = Heap::LookupEvalCache(is_global_context, *source);
+  if (obj->IsFailure()) return obj;
+
+  Handle<JSFunction> boilerplate;
+  if (!obj->IsJSFunction()) {
+    Counters::eval_cache_misses.Increment();
+    boilerplate = Compiler::CompileEval(is_global_context, source);
+    if (boilerplate.is_null()) return Failure::Exception();
+
+    Object* obj =
+        Heap::PutInEvalCache(is_global_context, *source, *boilerplate);
+    if (obj->IsFailure()) return obj;
+
+  } else {
+    Counters::eval_cache_hits.Increment();
+    boilerplate = Handle<JSFunction>(JSFunction::cast(obj));
+  }
+
   Handle<JSFunction> fun =
       Factory::NewFunctionFromBoilerplate(boilerplate, context);
   return *fun;
@@ -3375,6 +3444,25 @@ static Object* Runtime_SetNewFunctionAttributes(Arguments args) {
 }
 
 
+// Push an array unto an array of arrays if it is not already in the
+// array.  Returns true if the element was pushed on the stack and
+// false otherwise.
+static Object* Runtime_PushIfAbsent(Arguments args) {
+  ASSERT(args.length() == 2);
+  CONVERT_CHECKED(JSArray, array, args[0]);
+  CONVERT_CHECKED(JSArray, element, args[1]);
+  RUNTIME_ASSERT(array->HasFastElements());
+  int length = Smi::cast(array->length())->value();
+  FixedArray* elements = FixedArray::cast(array->elements());
+  for (int i = 0; i < length; i++) {
+    if (elements->get(i) == element) return Heap::false_value();
+  }
+  Object* obj = array->SetFastElement(length, element);
+  if (obj->IsFailure()) return obj;
+  return Heap::true_value();
+}
+
+
 // This will not allocate (flatten the string), but it may run
 // very slowly for very deeply nested ConsStrings.  For debugging use only.
 static Object* Runtime_GlobalPrint(Arguments args) {
@@ -4536,8 +4624,8 @@ static Object* Runtime_DebugGetLoadedScripts(Arguments args) {
   // Perform two GCs to get rid of all unreferenced scripts. The first GC gets
   // rid of all the cached script wrappes and the second gets rid of the
   // scripts which is no longer referenced.
-  Heap::CollectGarbage(0, OLD_SPACE);
-  Heap::CollectGarbage(0, OLD_SPACE);
+  Heap::CollectAllGarbage();
+  Heap::CollectAllGarbage();
 
   // Get the number of scripts.
   int count;
@@ -4641,7 +4729,7 @@ static Object* Runtime_DebugReferencedBy(Arguments args) {
   ASSERT(args.length() == 3);
 
   // First perform a full GC in order to avoid references from dead objects.
-  Heap::CollectGarbage(0, OLD_SPACE);
+  Heap::CollectAllGarbage();
 
   // Check parameters.
   CONVERT_CHECKED(JSObject, target, args[0]);
@@ -4721,7 +4809,7 @@ static Object* Runtime_DebugConstructedBy(Arguments args) {
   ASSERT(args.length() == 2);
 
   // First perform a full GC in order to avoid dead objects.
-  Heap::CollectGarbage(0, OLD_SPACE);
+  Heap::CollectAllGarbage();
 
   // Check parameters.
   CONVERT_CHECKED(JSFunction, constructor, args[0]);
diff --git a/src/runtime.h b/src/runtime.h
index d56e0b364970..794a5ca7e75f 100644
--- a/src/runtime.h
+++ b/src/runtime.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -61,6 +61,9 @@ namespace v8 { namespace internal {
   F(LazyCompile, 1) \
   F(SetNewFunctionAttributes, 1) \
   \
+  /* Array join support */ \
+  F(PushIfAbsent, 2) \
+  \
   /* ConsStrings */ \
   F(ConsStringFst, 1) \
   F(ConsStringSnd, 1) \
@@ -106,11 +109,11 @@ namespace v8 { namespace internal {
   F(NumberSar, 2) \
   \
   /* Comparisons */ \
-  F(ObjectEquals, 2) \
   F(NumberEquals, 2) \
   F(StringEquals, 2) \
   \
   F(NumberCompare, 3) \
+  F(SmiLexicographicCompare, 2) \
   F(StringCompare, 2) \
   \
   /* Math */ \
diff --git a/src/runtime.js b/src/runtime.js
index 78c20c1c36e5..46a61d8dfb96 100644
--- a/src/runtime.js
+++ b/src/runtime.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -57,13 +57,13 @@ function EQUALS(y) {
   // NOTE: We use iteration instead of recursion, because it is
   // difficult to call EQUALS with the correct setting of 'this' in
   // an efficient way.
-  
+
   while (true) {
-    
+
     if (IS_NUMBER(x)) {
       if (y == null) return 1;  // not equal
       return %NumberEquals(x, %ToNumber(y));
-      
+
     } else if (IS_STRING(x)) {
       if (IS_STRING(y)) return %StringEquals(x, y);
       if (IS_NUMBER(y)) return %NumberEquals(%ToNumber(x), y);
@@ -72,19 +72,25 @@ function EQUALS(y) {
       y = %ToPrimitive(y, NO_HINT);
 
     } else if (IS_BOOLEAN(x)) {
-      if (IS_BOOLEAN(y)) return %ObjectEquals(x, y);
+      if (IS_BOOLEAN(y)) {
+        return %_ObjectEquals(x, y) ? 0 : 1;
+      }
       if (y == null) return 1;  // not equal
       return %NumberEquals(%ToNumber(x), %ToNumber(y));
-      
+
     } else if (x == null) {
       // NOTE: This checks for both null and undefined.
       return (y == null) ? 0 : 1;
-      
+
     } else {
-      if (IS_OBJECT(y)) return %ObjectEquals(x, y);
-      if (IS_FUNCTION(y)) return %ObjectEquals(x, y);
+      if (IS_OBJECT(y)) {
+        return %_ObjectEquals(x, y) ? 0 : 1;
+      }
+      if (IS_FUNCTION(y)) {
+        return %_ObjectEquals(x, y) ? 0 : 1;
+      }
       x = %ToPrimitive(x, NO_HINT);
-      
+
     }
   }
 };
@@ -96,23 +102,23 @@ function STRICT_EQUALS(x) {
     if (!IS_NUMBER(x)) return 1;  // not equal
     return %NumberEquals(this, x);
   }
-  
+
   if (IS_STRING(this)) {
     if (!IS_STRING(x)) return 1;  // not equal
     return %StringEquals(this, x);
   }
-  
+
   if (IS_BOOLEAN(this)) {
     if (!IS_BOOLEAN(x)) return 1;  // not equal
     if (this) return x ? 0 : 1;
     else return x ? 1 : 0;
   }
-  
+
   if (IS_UNDEFINED(this)) {  // both undefined and undetectable
     return IS_UNDEFINED(x) ? 0 : 1;
   }
-  
-  return %ObjectEquals(this, x);
+
+  return %_ObjectEquals(this, x) ? 0 : 1;
 };
 
 
@@ -123,7 +129,7 @@ function COMPARE(x, ncr) {
   if (IS_NUMBER(this) && IS_NUMBER(x)) {
     return %NumberCompare(this, x, ncr);
   }
-  
+
   var a = %ToPrimitive(this, NUMBER_HINT);
   var b = %ToPrimitive(x, NUMBER_HINT);
   if (IS_STRING(a) && IS_STRING(b)) {
@@ -433,7 +439,7 @@ function ToObject(x) {
   if (IS_STRING(x)) return new $String(x);
   if (IS_NUMBER(x)) return new $Number(x);
   if (IS_BOOLEAN(x)) return new $Boolean(x);
-  if (x == null) throw %MakeTypeError('null_to_object');
+  if (x == null) throw %MakeTypeError('null_to_object', []);
   return x;
 };
 
diff --git a/src/scanner.cc b/src/scanner.cc
index b3e001575be9..a6cc74aaa088 100644
--- a/src/scanner.cc
+++ b/src/scanner.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/scanner.h b/src/scanner.h
index 5a89afda8c6f..79a4a4c243c9 100644
--- a/src/scanner.h
+++ b/src/scanner.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/scopeinfo.cc b/src/scopeinfo.cc
index a6a3f97b9631..b51cb986fa8a 100644
--- a/src/scopeinfo.cc
+++ b/src/scopeinfo.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/scopeinfo.h b/src/scopeinfo.h
index c172014c4568..285280cdde99 100644
--- a/src/scopeinfo.h
+++ b/src/scopeinfo.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/scopes.cc b/src/scopes.cc
index b2b8f65b904a..96f0c609d1e4 100644
--- a/src/scopes.cc
+++ b/src/scopes.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/scopes.h b/src/scopes.h
index 1cad76282ec7..05e462b6b51f 100644
--- a/src/scopes.h
+++ b/src/scopes.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/serialize.cc b/src/serialize.cc
index d1501e0e637c..ba18ce85d0d6 100644
--- a/src/serialize.cc
+++ b/src/serialize.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -53,13 +53,23 @@ DEFINE_bool(debug_serialization, false,
 // - MAP and OLD spaces: 16 bits of page number, 11 bits of word offset in page
 // - NEW space:          27 bits of word offset
 // - LO space:           27 bits of page number
-// 3 bits to encode the AllocationSpace
+// 3 bits to encode the AllocationSpace (special values for code in LO space)
 // 2 bits identifying this as a HeapObject
 
 const int kSpaceShift = kHeapObjectTagSize;
 const int kSpaceBits = kSpaceTagSize;
 const int kSpaceMask = kSpaceTagMask;
 
+// These value are used instead of space numbers when serializing/
+// deserializing.  They indicate an object that is in large object space, but
+// should be treated specially.
+// Make the pages executable on platforms that support it:
+const int kLOSpaceExecutable = LAST_SPACE + 1;
+// Reserve space for write barrier bits (for objects that can contain
+// references to new space):
+const int kLOSpacePointer = LAST_SPACE + 2;
+
+
 const int kOffsetShift = kSpaceShift + kSpaceBits;
 const int kOffsetBits = 11;
 const int kOffsetMask = (1 << kOffsetBits) - 1;
@@ -73,9 +83,28 @@ const int kPageAndOffsetBits = kPageBits + kOffsetBits;
 const int kPageAndOffsetMask = (1 << kPageAndOffsetBits) - 1;
 
 
-static inline AllocationSpace Space(Address addr) {
+static inline AllocationSpace GetSpace(Address addr) {
+  const int encoded = reinterpret_cast<int>(addr);
+  int space_number = ((encoded >> kSpaceShift) & kSpaceMask);
+  if (space_number == kLOSpaceExecutable) space_number = LO_SPACE;
+  else if (space_number == kLOSpacePointer) space_number = LO_SPACE;
+  return static_cast<AllocationSpace>(space_number);
+}
+
+
+static inline bool IsLargeExecutableObject(Address addr) {
   const int encoded = reinterpret_cast<int>(addr);
-  return static_cast<AllocationSpace>((encoded >> kSpaceShift) & kSpaceMask);
+  const int space_number = ((encoded >> kSpaceShift) & kSpaceMask);
+  if (space_number == kLOSpaceExecutable) return true;
+  return false;
+}
+
+
+static inline bool IsLargeFixedArray(Address addr) {
+  const int encoded = reinterpret_cast<int>(addr);
+  const int space_number = ((encoded >> kSpaceShift) & kSpaceMask);
+  if (space_number == kLOSpacePointer) return true;
+  return false;
 }
 
 
@@ -117,18 +146,29 @@ static inline int LargeObjectIndex(Address addr) {
 
 class RelativeAddress {
  public:
-  RelativeAddress(AllocationSpace space, int page_index, int page_offset)
-  : space_(space), page_index_(page_index), page_offset_(page_offset) {}
+  RelativeAddress(AllocationSpace space,
+                  int page_index,
+                  int page_offset)
+  : space_(space), page_index_(page_index), page_offset_(page_offset)  {
+    ASSERT(space <= LAST_SPACE && space >= 0);
+  }
 
   // Return the encoding of 'this' as an Address. Decode with constructor.
   Address Encode() const;
 
-  AllocationSpace space() const { return space_; }
+  AllocationSpace space() const {
+    if (space_ == kLOSpaceExecutable) return LO_SPACE;
+    if (space_ == kLOSpacePointer) return LO_SPACE;
+    return static_cast<AllocationSpace>(space_);
+  }
   int page_index() const { return page_index_; }
   int page_offset() const { return page_offset_; }
 
   bool in_paged_space() const {
-    return space_ == CODE_SPACE || space_ == OLD_SPACE || space_ == MAP_SPACE;
+    return space_ == CODE_SPACE ||
+           space_ == OLD_POINTER_SPACE ||
+           space_ == OLD_DATA_SPACE ||
+           space_ == MAP_SPACE;
   }
 
   void next_address(int offset) { page_offset_ += offset; }
@@ -141,8 +181,18 @@ class RelativeAddress {
   void Verify();
 #endif
 
+  void set_to_large_code_object() {
+    ASSERT(space_ == LO_SPACE);
+    space_ = kLOSpaceExecutable;
+  }
+  void set_to_large_fixed_array() {
+    ASSERT(space_ == LO_SPACE);
+    space_ = kLOSpacePointer;
+  }
+
+
  private:
-  AllocationSpace space_;
+  int space_;
   int page_index_;
   int page_offset_;
 };
@@ -154,7 +204,8 @@ Address RelativeAddress::Encode() const {
   int result = 0;
   switch (space_) {
     case MAP_SPACE:
-    case OLD_SPACE:
+    case OLD_POINTER_SPACE:
+    case OLD_DATA_SPACE:
     case CODE_SPACE:
       ASSERT_EQ(0, page_index_ & ~kPageMask);
       word_offset = page_offset_ >> kObjectAlignmentBits;
@@ -168,6 +219,8 @@ Address RelativeAddress::Encode() const {
       result = word_offset << kPageAndOffsetShift;
       break;
     case LO_SPACE:
+    case kLOSpaceExecutable:
+    case kLOSpacePointer:
       ASSERT_EQ(0, page_offset_);
       ASSERT_EQ(0, page_index_ & ~kPageAndOffsetMask);
       result = page_index_ << kPageAndOffsetShift;
@@ -185,7 +238,8 @@ void RelativeAddress::Verify() {
   ASSERT(page_offset_ >= 0 && page_index_ >= 0);
   switch (space_) {
     case MAP_SPACE:
-    case OLD_SPACE:
+    case OLD_POINTER_SPACE:
+    case OLD_DATA_SPACE:
     case CODE_SPACE:
       ASSERT(Page::kObjectStartOffset <= page_offset_ &&
              page_offset_ <= Page::kPageSize);
@@ -194,12 +248,20 @@ void RelativeAddress::Verify() {
       ASSERT(page_index_ == 0);
       break;
     case LO_SPACE:
+    case kLOSpaceExecutable:
+    case kLOSpacePointer:
       ASSERT(page_offset_ == 0);
       break;
   }
 }
 #endif
 
+enum GCTreatment {
+  DataObject,     // Object that cannot contain a reference to new space.
+  PointerObject,  // Object that can contain a reference to new space.
+  CodeObject      // Object that contains executable code.
+};
+
 // A SimulatedHeapSpace simulates the allocation of objects in a page in
 // the heap. It uses linear allocation - that is, it doesn't simulate the
 // use of a free list. This simulated
@@ -222,7 +284,7 @@ class SimulatedHeapSpace {
   // Returns the RelativeAddress where the next
   // object of 'size' bytes will be allocated, and updates 'this' to
   // point to the next free address beyond that object.
-  RelativeAddress Allocate(int size);
+  RelativeAddress Allocate(int size, GCTreatment special_gc_treatment);
 
  private:
   RelativeAddress current_;
@@ -232,7 +294,8 @@ class SimulatedHeapSpace {
 void SimulatedHeapSpace::InitEmptyHeap(AllocationSpace space) {
   switch (space) {
     case MAP_SPACE:
-    case OLD_SPACE:
+    case OLD_POINTER_SPACE:
+    case OLD_DATA_SPACE:
     case CODE_SPACE:
       current_ = RelativeAddress(space, 0, Page::kObjectStartOffset);
       break;
@@ -247,13 +310,16 @@ void SimulatedHeapSpace::InitEmptyHeap(AllocationSpace space) {
 void SimulatedHeapSpace::InitCurrentHeap(AllocationSpace space) {
   switch (space) {
     case MAP_SPACE:
-    case OLD_SPACE:
+    case OLD_POINTER_SPACE:
+    case OLD_DATA_SPACE:
     case CODE_SPACE: {
       PagedSpace* ps;
       if (space == MAP_SPACE) {
         ps = Heap::map_space();
-      } else if (space == OLD_SPACE) {
-        ps = Heap::old_space();
+      } else if (space == OLD_POINTER_SPACE) {
+        ps = Heap::old_pointer_space();
+      } else if (space == OLD_DATA_SPACE) {
+        ps = Heap::old_data_space();
       } else {
         ASSERT(space == CODE_SPACE);
         ps = Heap::code_space();
@@ -266,12 +332,15 @@ void SimulatedHeapSpace::InitCurrentHeap(AllocationSpace space) {
         if (it.next() == top_page) break;
         page_index++;
       }
-      current_ = RelativeAddress(space, page_index, top_page->Offset(top));
+      current_ = RelativeAddress(space,
+                                 page_index,
+                                 top_page->Offset(top));
       break;
     }
     case NEW_SPACE:
-      current_ =
-        RelativeAddress(space, 0, Heap::NewSpaceTop() - Heap::NewSpaceStart());
+      current_ = RelativeAddress(space,
+                                 0,
+                                 Heap::NewSpaceTop() - Heap::NewSpaceStart());
       break;
     case LO_SPACE:
       int page_index = 0;
@@ -284,7 +353,8 @@ void SimulatedHeapSpace::InitCurrentHeap(AllocationSpace space) {
 }
 
 
-RelativeAddress SimulatedHeapSpace::Allocate(int size) {
+RelativeAddress SimulatedHeapSpace::Allocate(int size,
+                                             GCTreatment special_gc_treatment) {
 #ifdef DEBUG
   current_.Verify();
 #endif
@@ -297,6 +367,11 @@ RelativeAddress SimulatedHeapSpace::Allocate(int size) {
   RelativeAddress result = current_;
   if (current_.space() == LO_SPACE) {
     current_.next_page();
+    if (special_gc_treatment == CodeObject) {
+      result.set_to_large_code_object();
+    } else if (special_gc_treatment == PointerObject) {
+      result.set_to_large_fixed_array();
+    }
   } else {
     current_.next_address(alloc_size);
   }
@@ -924,7 +999,10 @@ void Serializer::PutHeader() {
   // and code spaces, because objects in new space will be promoted to them.
   writer_->PutC('S');
   writer_->PutC('[');
-  writer_->PutInt(Heap::old_space()->Size() + Heap::new_space()->Size());
+  writer_->PutInt(Heap::old_pointer_space()->Size() +
+                  Heap::new_space()->Size());
+  writer_->PutC('|');
+  writer_->PutInt(Heap::old_data_space()->Size() + Heap::new_space()->Size());
   writer_->PutC('|');
   writer_->PutInt(Heap::code_space()->Size() + Heap::new_space()->Size());
   writer_->PutC('|');
@@ -1094,16 +1172,24 @@ RelativeAddress Serializer::Allocate(HeapObject* obj) {
   // Find out which AllocationSpace 'obj' is in.
   AllocationSpace s;
   bool found = false;
-  for (int i = 0; !found && i <= LAST_SPACE; i++) {
+  for (int i = FIRST_SPACE; !found && i <= LAST_SPACE; i++) {
     s = static_cast<AllocationSpace>(i);
     found = Heap::InSpace(obj, s);
   }
   CHECK(found);
   if (s == NEW_SPACE) {
-    s = Heap::TargetSpace(obj);
+    Space* space = Heap::TargetSpace(obj);
+    ASSERT(space == Heap::old_pointer_space() ||
+           space == Heap::old_data_space());
+    s = (space == Heap::old_pointer_space()) ?
+        OLD_POINTER_SPACE :
+        OLD_DATA_SPACE;
   }
   int size = obj->Size();
-  return allocator_[s]->Allocate(size);
+  GCTreatment gc_treatment = DataObject;
+  if (obj->IsFixedArray()) gc_treatment = PointerObject;
+  else if (obj->IsCode()) gc_treatment = CodeObject;
+  return allocator_[s]->Allocate(size, gc_treatment);
 }
 
 
@@ -1116,8 +1202,11 @@ static const int kInitArraySize = 32;
 
 Deserializer::Deserializer(const char* str, int len)
   : reader_(str, len),
-    map_pages_(kInitArraySize), old_pages_(kInitArraySize),
-    code_pages_(kInitArraySize), large_objects_(kInitArraySize),
+    map_pages_(kInitArraySize),
+    old_pointer_pages_(kInitArraySize),
+    old_data_pages_(kInitArraySize),
+    code_pages_(kInitArraySize),
+    large_objects_(kInitArraySize),
     global_handles_(4) {
   root_ = true;
   roots_ = 0;
@@ -1281,7 +1370,11 @@ void Deserializer::GetHeader() {
   // during deserialization.
   reader_.ExpectC('S');
   reader_.ExpectC('[');
-  InitPagedSpace(Heap::old_space(), reader_.GetInt(), &old_pages_);
+  InitPagedSpace(Heap::old_pointer_space(),
+                 reader_.GetInt(),
+                 &old_pointer_pages_);
+  reader_.ExpectC('|');
+  InitPagedSpace(Heap::old_data_space(), reader_.GetInt(), &old_data_pages_);
   reader_.ExpectC('|');
   InitPagedSpace(Heap::code_space(), reader_.GetInt(), &code_pages_);
   reader_.ExpectC('|');
@@ -1340,7 +1433,15 @@ Object* Deserializer::GetObject() {
   Address a = GetEncodedAddress();
 
   // Get a raw object of the right size in the right space.
-  Object* o = Heap::AllocateRaw(size, Space(a));
+  AllocationSpace space = GetSpace(a);
+  Object *o;
+  if (IsLargeExecutableObject(a)) {
+    o = Heap::lo_space()->AllocateRawCode(size);
+  } else if (IsLargeFixedArray(a)) {
+    o = Heap::lo_space()->AllocateRawFixedArray(size);
+  } else {
+    o = Heap::AllocateRaw(size, space);
+  }
   ASSERT(!o->IsFailure());
   // Check that the simulation of heap allocation was correct.
   ASSERT(o == Resolve(a));
@@ -1405,18 +1506,20 @@ Object* Deserializer::Resolve(Address encoded) {
   // Encoded addresses of HeapObjects always have 'HeapObject' tags.
   ASSERT(o->IsHeapObject());
 
-  switch (Space(encoded)) {
-    // For Map space and Old space, we cache the known Pages in
-    // map_pages and old_pages respectively. Even though MapSpace
-    // keeps a list of page addresses, we don't rely on it since
-    // GetObject uses AllocateRaw, and that appears not to update
-    // the page list.
+  switch (GetSpace(encoded)) {
+    // For Map space and Old space, we cache the known Pages in map_pages,
+    // old_pointer_pages and old_data_pages. Even though MapSpace keeps a list
+    // of page addresses, we don't rely on it since GetObject uses AllocateRaw,
+    // and that appears not to update the page list.
     case MAP_SPACE:
       return ResolvePaged(PageIndex(encoded), PageOffset(encoded),
                           Heap::map_space(), &map_pages_);
-    case OLD_SPACE:
+    case OLD_POINTER_SPACE:
+      return ResolvePaged(PageIndex(encoded), PageOffset(encoded),
+                          Heap::old_pointer_space(), &old_pointer_pages_);
+    case OLD_DATA_SPACE:
       return ResolvePaged(PageIndex(encoded), PageOffset(encoded),
-                          Heap::old_space(), &old_pages_);
+                          Heap::old_data_space(), &old_data_pages_);
     case CODE_SPACE:
       return ResolvePaged(PageIndex(encoded), PageOffset(encoded),
                           Heap::code_space(), &code_pages_);
diff --git a/src/serialize.h b/src/serialize.h
index be0be8386482..5c65daff3b5c 100644
--- a/src/serialize.h
+++ b/src/serialize.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -312,10 +312,11 @@ class Deserializer: public ObjectVisitor {
   bool has_log_;  // The file has log information.
 
   // Resolve caches the following:
-  List<Page*> map_pages_;       // All pages in the map space.
-  List<Page*> old_pages_;       // All pages in the old space.
+  List<Page*> map_pages_;          // All pages in the map space.
+  List<Page*> old_pointer_pages_;  // All pages in the old pointer space.
+  List<Page*> old_data_pages_;     // All pages in the old data space.
   List<Page*> code_pages_;
-  List<Object*> large_objects_;  // All known large objects.
+  List<Object*> large_objects_;    // All known large objects.
   // A list of global handles at deserialization time.
   List<Object**> global_handles_;
 
diff --git a/src/shell.h b/src/shell.h
index 85b5863fed76..4042c07ca211 100644
--- a/src/shell.h
+++ b/src/shell.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/simulator-arm.cc b/src/simulator-arm.cc
index 71e3a43e83e8..b11ffb1f8bab 100644
--- a/src/simulator-arm.cc
+++ b/src/simulator-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/simulator-arm.h b/src/simulator-arm.h
index c9495934f3fc..1ccd856ad697 100644
--- a/src/simulator-arm.h
+++ b/src/simulator-arm.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/simulator-ia32.cc b/src/simulator-ia32.cc
index bb3ce0d03644..ab8169375c09 100644
--- a/src/simulator-ia32.cc
+++ b/src/simulator-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/simulator-ia32.h b/src/simulator-ia32.h
index bf4072b29f66..2267721cf2c7 100644
--- a/src/simulator-ia32.h
+++ b/src/simulator-ia32.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/smart-pointer.h b/src/smart-pointer.h
index 7ff35c223dcb..accbe03736c6 100644
--- a/src/smart-pointer.h
+++ b/src/smart-pointer.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/snapshot-common.cc b/src/snapshot-common.cc
index 314a5f0b69ec..b0e9323f8307 100644
--- a/src/snapshot-common.cc
+++ b/src/snapshot-common.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/snapshot-empty.cc b/src/snapshot-empty.cc
index 909a223907e1..1c8ec5f020fa 100644
--- a/src/snapshot-empty.cc
+++ b/src/snapshot-empty.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/snapshot.h b/src/snapshot.h
index bb40c2efbff2..2d8b9ac30cdd 100644
--- a/src/snapshot.h
+++ b/src/snapshot.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -37,8 +37,8 @@ class Snapshot {
   // could be found.
   static bool Initialize(const char* snapshot_file = NULL);
 
-  // Disable the use of the internal snapshot.
-  static void DisableInternal() { size_ = 0; }
+  // Returns whether or not the snapshot is enabled.
+  static bool IsEnabled() { return size_ != 0; }
 
   // Write snapshot to the given file. Returns true if snapshot was written
   // successfully.
diff --git a/src/spaces-inl.h b/src/spaces-inl.h
index 38aa7e1df6a6..86369b9a5d8e 100644
--- a/src/spaces-inl.h
+++ b/src/spaces-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -86,14 +86,7 @@ Page* Page::next_page() {
 
 Address Page::AllocationTop() {
   PagedSpace* owner = MemoryAllocator::PageOwner(this);
-  if (Heap::old_space() == owner) {
-    return Heap::old_space()->PageAllocationTop(this);
-  } else if (Heap::code_space() == owner) {
-    return Heap::code_space()->PageAllocationTop(this);
-  } else {
-    ASSERT(Heap::map_space() == owner);
-    return Heap::map_space()->PageAllocationTop(this);
-  }
+  return owner->PageAllocationTop(this);
 }
 
 
@@ -282,24 +275,6 @@ Object* PagedSpace::MCAllocateRaw(int size_in_bytes) {
 }
 
 
-// Allocating during deserialization.  Always roll to the next page in the
-// space, which should be suitably expanded.
-Object* PagedSpace::AllocateForDeserialization(int size_in_bytes) {
-  ASSERT(HasBeenSetup());
-  ASSERT_OBJECT_SIZE(size_in_bytes);
-  HeapObject* object = AllocateLinearly(&allocation_info_, size_in_bytes);
-  if (object != NULL) return object;
-
-  // The space should be pre-expanded.
-  Page* current_page = Page::FromAllocationTop(allocation_info_.top);
-  ASSERT(current_page->next_page()->is_valid());
-  object = AllocateInNextPage(current_page, size_in_bytes);
-
-  ASSERT(object != NULL);
-  return object;
-}
-
-
 // -----------------------------------------------------------------------------
 // LargeObjectChunk
 
diff --git a/src/spaces.cc b/src/spaces.cc
index 279e10adc8c2..7920187cc3bc 100644
--- a/src/spaces.cc
+++ b/src/spaces.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -227,10 +227,10 @@ void MemoryAllocator::TearDown() {
 
 void* MemoryAllocator::AllocateRawMemory(const size_t requested,
                                          size_t* allocated,
-                                         bool executable) {
+                                         Executability executable) {
   if (size_ + static_cast<int>(requested) > capacity_) return NULL;
 
-  void* mem = OS::Allocate(requested, allocated, executable);
+  void* mem = OS::Allocate(requested, allocated, executable == EXECUTABLE);
   int alloced = *allocated;
   size_ += alloced;
   Counters::memory_allocated.Increment(alloced);
@@ -316,7 +316,7 @@ Page* MemoryAllocator::CommitPages(Address start, size_t size,
   ASSERT(initial_chunk_->address() <= start);
   ASSERT(start + size <= reinterpret_cast<Address>(initial_chunk_->address())
                              + initial_chunk_->size());
-  if (!initial_chunk_->Commit(start, size, owner->executable())) {
+  if (!initial_chunk_->Commit(start, size, owner->executable() == EXECUTABLE)) {
     return Page::FromAddress(NULL);
   }
   Counters::memory_allocated.Increment(size);
@@ -332,7 +332,7 @@ Page* MemoryAllocator::CommitPages(Address start, size_t size,
 
 bool MemoryAllocator::CommitBlock(Address start,
                                   size_t size,
-                                  bool executable) {
+                                  Executability executable) {
   ASSERT(start != NULL);
   ASSERT(size > 0);
   ASSERT(initial_chunk_ != NULL);
@@ -474,7 +474,9 @@ void MemoryAllocator::ReportStatistics() {
 // -----------------------------------------------------------------------------
 // PagedSpace implementation
 
-PagedSpace::PagedSpace(int max_capacity, AllocationSpace id, bool executable)
+PagedSpace::PagedSpace(int max_capacity,
+                       AllocationSpace id,
+                       Executability executable)
     : Space(id, executable) {
   max_capacity_ = (RoundDown(max_capacity, Page::kPageSize) / Page::kPageSize)
                   * Page::kObjectAreaSize;
@@ -494,8 +496,11 @@ bool PagedSpace::Setup(Address start, size_t size) {
   int num_pages = 0;
   // Try to use the virtual memory range passed to us.  If it is too small to
   // contain at least one page, ignore it and allocate instead.
-  if (PagesInChunk(start, size) > 0) {
-    first_page_ = MemoryAllocator::CommitPages(start, size, this, &num_pages);
+  int pages_in_chunk = PagesInChunk(start, size);
+  if (pages_in_chunk > 0) {
+    first_page_ = MemoryAllocator::CommitPages(RoundUp(start, Page::kPageSize),
+                                               Page::kPageSize * pages_in_chunk,
+                                               this, &num_pages);
   } else {
     int requested_pages = Min(MemoryAllocator::kPagesPerChunk,
                               max_capacity_ / Page::kObjectAreaSize);
@@ -768,15 +773,14 @@ void PagedSpace::Print() { }
 
 NewSpace::NewSpace(int initial_semispace_capacity,
                    int maximum_semispace_capacity,
-                   AllocationSpace id,
-                   bool executable)
-    : Space(id, executable) {
+                   AllocationSpace id)
+    : Space(id, NOT_EXECUTABLE) {
   ASSERT(initial_semispace_capacity <= maximum_semispace_capacity);
   ASSERT(IsPowerOf2(maximum_semispace_capacity));
   maximum_capacity_ = maximum_semispace_capacity;
   capacity_ = initial_semispace_capacity;
-  to_space_ = new SemiSpace(capacity_, maximum_capacity_, id, executable);
-  from_space_ = new SemiSpace(capacity_, maximum_capacity_, id, executable);
+  to_space_ = new SemiSpace(capacity_, maximum_capacity_, id);
+  from_space_ = new SemiSpace(capacity_, maximum_capacity_, id);
 
   // Allocate and setup the histogram arrays if necessary.
 #if defined(DEBUG) || defined(ENABLE_LOGGING_AND_PROFILING)
@@ -940,9 +944,8 @@ void NewSpace::Verify() {
 
 SemiSpace::SemiSpace(int initial_capacity,
                      int maximum_capacity,
-                     AllocationSpace id,
-                     bool executable)
-    : Space(id, executable), capacity_(initial_capacity),
+                     AllocationSpace id)
+    : Space(id, NOT_EXECUTABLE), capacity_(initial_capacity),
       maximum_capacity_(maximum_capacity), start_(NULL), age_mark_(NULL) {
 }
 
@@ -980,6 +983,9 @@ bool SemiSpace::Double() {
 
 #ifdef DEBUG
 void SemiSpace::Print() { }
+
+
+void SemiSpace::Verify() { }
 #endif
 
 
@@ -2190,7 +2196,7 @@ HeapObject* LargeObjectIterator::next() {
 
 LargeObjectChunk* LargeObjectChunk::New(int size_in_bytes,
                                         size_t* chunk_size,
-                                        bool executable) {
+                                        Executability executable) {
   size_t requested = ChunkSizeFor(size_in_bytes);
   void* mem = MemoryAllocator::AllocateRawMemory(requested,
                                                  chunk_size,
@@ -2216,8 +2222,8 @@ int LargeObjectChunk::ChunkSizeFor(int size_in_bytes) {
 // -----------------------------------------------------------------------------
 // LargeObjectSpace
 
-LargeObjectSpace::LargeObjectSpace(AllocationSpace id, bool executable)
-    : Space(id, executable),
+LargeObjectSpace::LargeObjectSpace(AllocationSpace id)
+    : Space(id, NOT_EXECUTABLE),  // Managed on a per-allocation basis
       first_chunk_(NULL),
       size_(0),
       page_count_(0) {}
@@ -2245,11 +2251,12 @@ void LargeObjectSpace::TearDown() {
 
 
 Object* LargeObjectSpace::AllocateRawInternal(int requested_size,
-                                              int object_size) {
+                                              int object_size,
+                                              Executability executable) {
   ASSERT(0 < object_size && object_size <= requested_size);
   size_t chunk_size;
   LargeObjectChunk* chunk =
-      LargeObjectChunk::New(requested_size, &chunk_size, executable());
+      LargeObjectChunk::New(requested_size, &chunk_size, executable);
   if (chunk == NULL) {
     return Failure::RetryAfterGC(requested_size, identity());
   }
@@ -2280,15 +2287,28 @@ Object* LargeObjectSpace::AllocateRawInternal(int requested_size,
 }
 
 
-Object* LargeObjectSpace::AllocateRaw(int size_in_bytes) {
+Object* LargeObjectSpace::AllocateRawCode(int size_in_bytes) {
   ASSERT(0 < size_in_bytes);
-  return AllocateRawInternal(size_in_bytes, size_in_bytes);
+  return AllocateRawInternal(size_in_bytes,
+                             size_in_bytes,
+                             EXECUTABLE);
 }
 
 
 Object* LargeObjectSpace::AllocateRawFixedArray(int size_in_bytes) {
+  ASSERT(0 < size_in_bytes);
   int extra_rset_bytes = ExtraRSetBytesFor(size_in_bytes);
-  return AllocateRawInternal(size_in_bytes + extra_rset_bytes, size_in_bytes);
+  return AllocateRawInternal(size_in_bytes + extra_rset_bytes,
+                             size_in_bytes,
+                             NOT_EXECUTABLE);
+}
+
+
+Object* LargeObjectSpace::AllocateRaw(int size_in_bytes) {
+  ASSERT(0 < size_in_bytes);
+  return AllocateRawInternal(size_in_bytes,
+                             size_in_bytes,
+                             NOT_EXECUTABLE);
 }
 
 
diff --git a/src/spaces.h b/src/spaces.h
index cfa43e96c006..04bf01e1902f 100644
--- a/src/spaces.h
+++ b/src/spaces.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -209,7 +209,7 @@ class Page {
   // 8K bytes per page.
   static const int kPageSizeBits = 13;
 
-  // Page size in bytes.
+  // Page size in bytes.  This must be a multiple of the OS page size.
   static const int kPageSize = 1 << kPageSizeBits;
 
   // Page size mask.
@@ -234,7 +234,7 @@ class Page {
   //---------------------------------------------------------------------------
   // Page header description.
   //
-  // If a page is not in a large object space, the first word,
+  // If a page is not in the large object space, the first word,
   // opaque_header, encodes the next page address (aligned to kPageSize 8K)
   // and the chunk number (0 ~ 8K-1).  Only MemoryAllocator should use
   // opaque_header. The value range of the opaque_header is [0..kPageSize[,
@@ -275,15 +275,21 @@ class Page {
 // Space is the abstract superclass for all allocation spaces.
 class Space : public Malloced {
  public:
-  Space(AllocationSpace id, bool executable)
+  Space(AllocationSpace id, Executability executable)
       : id_(id), executable_(executable) {}
+  virtual ~Space() {}
   // Does the space need executable memory?
-  bool executable() { return executable_; }
+  Executability executable() { return executable_; }
   // Identity used in error reporting.
   AllocationSpace identity() { return id_; }
+  virtual int Size() = 0;
+#ifdef DEBUG
+  virtual void Verify() = 0;
+  virtual void Print() = 0;
+#endif
  private:
   AllocationSpace id_;
-  bool executable_;
+  Executability executable_;
 };
 
 
@@ -338,7 +344,7 @@ class MemoryAllocator : public AllStatic {
   // the address is not NULL, the size is greater than zero, and that the
   // block is contained in the initial chunk.  Returns true if it succeeded
   // and false otherwise.
-  static bool CommitBlock(Address start, size_t size, bool executable);
+  static bool CommitBlock(Address start, size_t size, Executability executable);
 
   // Attempts to allocate the requested (non-zero) number of pages from the
   // OS.  Fewer pages might be allocated than requested. If it fails to
@@ -363,12 +369,17 @@ class MemoryAllocator : public AllStatic {
   // but keep track of allocated bytes as part of heap.
   static void* AllocateRawMemory(const size_t requested,
                                  size_t* allocated,
-                                 bool executable);
+                                 Executability executable);
   static void FreeRawMemory(void* buf, size_t length);
 
   // Returns the maximum available bytes of heaps.
   static int Available() { return capacity_ < size_ ? 0 : capacity_ - size_; }
 
+  // Returns maximum available bytes that the old space can have.
+  static int MaxAvailable() {
+    return (Available() / Page::kPageSize) * Page::kObjectAreaSize;
+  }
+
   // Links two pages.
   static inline void SetNextPage(Page* prev, Page* next);
 
@@ -661,7 +672,7 @@ class PagedSpace : public Space {
   friend class PageIterator;
  public:
   // Creates a space with a maximum capacity, and an id.
-  PagedSpace(int max_capacity, AllocationSpace id, bool executable);
+  PagedSpace(int max_capacity, AllocationSpace id, Executability executable);
 
   virtual ~PagedSpace() {}
 
@@ -695,6 +706,11 @@ class PagedSpace : public Space {
   // Clears remembered sets of pages in this space.
   void ClearRSet();
 
+  // Prepares for a mark-compact GC.
+  virtual void PrepareForMarkCompact(bool will_compact) = 0;
+
+  virtual Address PageAllocationTop(Page* page) = 0;
+
   // Current capacity without growing (Size() + Available() + Waste()).
   int Capacity() { return accounting_stats_.Capacity(); }
 
@@ -702,7 +718,7 @@ class PagedSpace : public Space {
   int Available() { return accounting_stats_.Available(); }
 
   // Allocated bytes in this space.
-  int Size() { return accounting_stats_.Size(); }
+  virtual int Size() { return accounting_stats_.Size(); }
 
   // Wasted bytes due to fragmentation and not recoverable until the
   // next GC of this space.
@@ -723,9 +739,6 @@ class PagedSpace : public Space {
   inline Object* MCAllocateRaw(int size_in_bytes);
 
 
-  // Allocate the requested number of bytes during deserialization.
-  inline Object* AllocateForDeserialization(int size_in_bytes);
-
   // ---------------------------------------------------------------------------
   // Mark-compact collection support functions
 
@@ -741,6 +754,10 @@ class PagedSpace : public Space {
   // of the space.
   int MCSpaceOffsetForAddress(Address addr);
 
+  // Updates the allocation pointer to the relocation top after a mark-compact
+  // collection.
+  virtual void MCCommitRelocationInfo() = 0;
+
   // Releases half of unused pages.
   void Shrink();
 
@@ -749,7 +766,7 @@ class PagedSpace : public Space {
 
 #ifdef DEBUG
   // Print meta info and objects in this space.
-  void Print();
+  virtual void Print();
 
   // Report code object related statistics
   void CollectCodeStatistics();
@@ -869,8 +886,8 @@ class SemiSpace : public Space {
   // addresses.
   SemiSpace(int initial_capacity,
             int maximum_capacity,
-            AllocationSpace id,
-            bool executable);
+            AllocationSpace id);
+  virtual ~SemiSpace() {}
 
   // Sets up the semispace using the given chunk.
   bool Setup(Address start, int size);
@@ -913,8 +930,16 @@ class SemiSpace : public Space {
   // The offset of an address from the begining of the space.
   int SpaceOffsetForAddress(Address addr) { return addr - low(); }
 
+  // If we don't have this here then SemiSpace will be abstract.  However
+  // it should never be called.
+  virtual int Size() {
+    UNREACHABLE();
+    return 0;
+  }
+
 #ifdef DEBUG
-  void Print();
+  virtual void Print();
+  virtual void Verify();
 #endif
 
  private:
@@ -999,8 +1024,8 @@ class NewSpace : public Space {
   // and it must be aligned to its size.
   NewSpace(int initial_semispace_capacity,
            int maximum_semispace_capacity,
-           AllocationSpace id,
-           bool executable);
+           AllocationSpace id);
+  virtual ~NewSpace() {}
 
   // Sets up the new space using the given chunk.
   bool Setup(Address start, int size);
@@ -1032,7 +1057,7 @@ class NewSpace : public Space {
   }
 
   // Return the allocated bytes in the active semispace.
-  int Size() { return top() - bottom(); }
+  virtual int Size() { return top() - bottom(); }
   // Return the current capacity of a semispace.
   int Capacity() { return capacity_; }
   // Return the available bytes without growing in the active semispace.
@@ -1107,9 +1132,9 @@ class NewSpace : public Space {
 
 #ifdef DEBUG
   // Verify the active semispace.
-  void Verify();
+  virtual void Verify();
   // Print the active semispace.
-  void Print() { to_space_->Print(); }
+  virtual void Print() { to_space_->Print(); }
 #endif
 
 #if defined(DEBUG) || defined(ENABLE_LOGGING_AND_PROFILING)
@@ -1341,22 +1366,18 @@ class OldSpace : public PagedSpace {
  public:
   // Creates an old space object with a given maximum capacity.
   // The constructor does not allocate pages from OS.
-  explicit OldSpace(int max_capacity, AllocationSpace id, bool executable)
+  explicit OldSpace(int max_capacity,
+                    AllocationSpace id,
+                    Executability executable)
       : PagedSpace(max_capacity, id, executable), free_list_(id) {
   }
 
-  // Returns maximum available bytes that the old space can have.
-  int MaxAvailable() {
-    return (MemoryAllocator::Available() / Page::kPageSize)
-           * Page::kObjectAreaSize;
-  }
-
   // The bytes available on the free list (ie, not above the linear allocation
   // pointer).
   int AvailableFree() { return free_list_.available(); }
 
   // The top of allocation in a page in this space. Undefined if page is unused.
-  Address PageAllocationTop(Page* page) {
+  virtual Address PageAllocationTop(Page* page) {
     return page == TopPageOf(allocation_info_) ? top() : page->ObjectAreaEnd();
   }
 
@@ -1370,7 +1391,7 @@ class OldSpace : public PagedSpace {
 
   // Prepare for full garbage collection.  Resets the relocation pointer and
   // clears the free list.
-  void PrepareForMarkCompact(bool will_compact);
+  virtual void PrepareForMarkCompact(bool will_compact);
 
   // Adjust the top of relocation pointer to point to the end of the object
   // given by 'address' and 'size_in_bytes'.  Move it to the next page if
@@ -1380,11 +1401,11 @@ class OldSpace : public PagedSpace {
 
   // Updates the allocation pointer to the relocation top after a mark-compact
   // collection.
-  void MCCommitRelocationInfo();
+  virtual void MCCommitRelocationInfo();
 
 #ifdef DEBUG
   // Verify integrity of this space.
-  void Verify();
+  virtual void Verify();
 
   // Reports statistics for the space
   void ReportStatistics();
@@ -1420,14 +1441,10 @@ class MapSpace : public PagedSpace {
  public:
   // Creates a map space object with a maximum capacity.
   explicit MapSpace(int max_capacity, AllocationSpace id)
-      : PagedSpace(max_capacity, id, false), free_list_(id) { }
-
-  // The bytes available on the free list (ie, not above the linear allocation
-  // pointer).
-  int AvailableFree() { return free_list_.available(); }
+      : PagedSpace(max_capacity, id, NOT_EXECUTABLE), free_list_(id) { }
 
   // The top of allocation in a page in this space. Undefined if page is unused.
-  Address PageAllocationTop(Page* page) {
+  virtual Address PageAllocationTop(Page* page) {
     return page == TopPageOf(allocation_info_) ? top()
         : page->ObjectAreaEnd() - kPageExtra;
   }
@@ -1442,15 +1459,15 @@ class MapSpace : public PagedSpace {
   Address PageAddress(int page_index) { return page_addresses_[page_index]; }
 
   // Prepares for a mark-compact GC.
-  void PrepareForMarkCompact(bool will_compact);
+  virtual void PrepareForMarkCompact(bool will_compact);
 
   // Updates the allocation pointer to the relocation top after a mark-compact
   // collection.
-  void MCCommitRelocationInfo();
+  virtual void MCCommitRelocationInfo();
 
 #ifdef DEBUG
   // Verify integrity of this space.
-  void Verify();
+  virtual void Verify();
 
   // Reports statistic info of the space
   void ReportStatistics();
@@ -1490,7 +1507,6 @@ class MapSpace : public PagedSpace {
 // extra padding bytes (Page::kPageSize + Page::kObjectStartOffset).
 // A large object always starts at Page::kObjectStartOffset to a page.
 // Large objects do not move during garbage collections.
-//
 
 // A LargeObjectChunk holds exactly one large object page with exactly one
 // large object.
@@ -1503,7 +1519,7 @@ class LargeObjectChunk {
   // parameter chunk_size.
   static LargeObjectChunk* New(int size_in_bytes,
                                size_t* chunk_size,
-                               bool executable);
+                               Executability executable);
 
   // Interpret a raw address as a large object chunk.
   static LargeObjectChunk* FromAddress(Address address) {
@@ -1553,7 +1569,8 @@ class LargeObjectChunk {
 class LargeObjectSpace : public Space {
   friend class LargeObjectIterator;
  public:
-  explicit LargeObjectSpace(AllocationSpace id, bool executable);
+  explicit LargeObjectSpace(AllocationSpace id);
+  virtual ~LargeObjectSpace() {}
 
   // Initializes internal data structures.
   bool Setup();
@@ -1561,8 +1578,10 @@ class LargeObjectSpace : public Space {
   // Releases internal resources, frees objects in this space.
   void TearDown();
 
-  // Allocates a (non-FixedArray) large object.
+  // Allocates a (non-FixedArray, non-Code) large object.
   Object* AllocateRaw(int size_in_bytes);
+  // Allocates a large Code object.
+  Object* AllocateRawCode(int size_in_bytes);
   // Allocates a large FixedArray.
   Object* AllocateRawFixedArray(int size_in_bytes);
 
@@ -1572,7 +1591,7 @@ class LargeObjectSpace : public Space {
     return LargeObjectChunk::ObjectSizeFor(MemoryAllocator::Available());
   }
 
-  int Size() {
+  virtual int Size() {
     return size_;
   }
 
@@ -1601,8 +1620,8 @@ class LargeObjectSpace : public Space {
   bool IsEmpty() { return first_chunk_ == NULL; }
 
 #ifdef DEBUG
-  void Verify();
-  void Print();
+  virtual void Verify();
+  virtual void Print();
   void ReportStatistics();
   void CollectCodeStatistics();
   // Dump the remembered sets in the space to stdout.
@@ -1619,8 +1638,11 @@ class LargeObjectSpace : public Space {
   int page_count_;  // number of chunks
 
 
-  // Shared implementation of AllocateRaw and AllocateRawFixedArray.
-  Object* AllocateRawInternal(int requested_size, int object_size);
+  // Shared implementation of AllocateRaw, AllocateRawCode and
+  // AllocateRawFixedArray.
+  Object* AllocateRawInternal(int requested_size,
+                              int object_size,
+                              Executability executable);
 
   // Returns the number of extra bytes (rounded up to the nearest full word)
   // required for extra_object_bytes of extra pointers (in bytes).
diff --git a/src/string-stream.cc b/src/string-stream.cc
index 84011db81c53..55dc402a4419 100644
--- a/src/string-stream.cc
+++ b/src/string-stream.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/string-stream.h b/src/string-stream.h
index b00c7ccf890c..9cff319c0203 100644
--- a/src/string-stream.h
+++ b/src/string-stream.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/string.js b/src/string.js
index 7e5cf6e3d38b..da9ba6acb898 100644
--- a/src/string.js
+++ b/src/string.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/stub-cache-arm.cc b/src/stub-cache-arm.cc
index 91d9140ec683..f911f4be2463 100644
--- a/src/stub-cache-arm.cc
+++ b/src/stub-cache-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/stub-cache-ia32.cc b/src/stub-cache-ia32.cc
index 4c8416001b64..89dccbec5210 100644
--- a/src/stub-cache-ia32.cc
+++ b/src/stub-cache-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/stub-cache.cc b/src/stub-cache.cc
index 6c5625bee83b..84272a289684 100644
--- a/src/stub-cache.cc
+++ b/src/stub-cache.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/stub-cache.h b/src/stub-cache.h
index 0f48310a7f52..1b47f85b7d40 100644
--- a/src/stub-cache.h
+++ b/src/stub-cache.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/token.cc b/src/token.cc
index a7378481ad82..3f92707d024e 100644
--- a/src/token.cc
+++ b/src/token.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/token.h b/src/token.h
index d053decfc321..0f194a3c94dc 100644
--- a/src/token.h
+++ b/src/token.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/top.cc b/src/top.cc
index 94e4cc889017..061b3001c890 100644
--- a/src/top.cc
+++ b/src/top.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -79,6 +79,7 @@ void Top::Iterate(ObjectVisitor* v, ThreadLocalTop* thread) {
        block != NULL;
        block = block->next_) {
     VISIT(reinterpret_cast<Object*&>(block->exception_));
+    VISIT(reinterpret_cast<Object*&>(block->message_));
   }
 
   // Iterate over pointers on native execution stack.
@@ -671,39 +672,35 @@ void Top::PrintCurrentStackTrace(FILE* out) {
 }
 
 
+void Top::ComputeLocation(MessageLocation* target) {
+  *target = MessageLocation(empty_script(), -1, -1);
+  StackTraceFrameIterator it;
+  if (!it.done()) {
+    JavaScriptFrame* frame = it.frame();
+    JSFunction* fun = JSFunction::cast(frame->function());
+    Object* script = fun->shared()->script();
+    if (script->IsScript() &&
+        !(Script::cast(script)->source()->IsUndefined())) {
+      int pos = frame->FindCode()->SourcePosition(frame->pc());
+      // Compute the location from the function and the reloc info.
+      Handle<Script> casted_script(Script::cast(script));
+      *target = MessageLocation(casted_script, pos, pos + 1);
+    }
+  }
+}
+
+
 void Top::ReportUncaughtException(Handle<Object> exception,
                                   MessageLocation* location,
                                   Handle<String> stack_trace) {
-  MessageLocation computed_location(empty_script(), -1, -1);
-  if (location == NULL) {
-    location = &computed_location;
-
-    StackTraceFrameIterator it;
-    if (!it.done()) {
-      JavaScriptFrame* frame = it.frame();
-      JSFunction* fun = JSFunction::cast(frame->function());
-      Object* script = fun->shared()->script();
-      if (script->IsScript() &&
-          !(Script::cast(script)->source()->IsUndefined())) {
-        int pos = frame->FindCode()->SourcePosition(frame->pc());
-        // Compute the location from the function and the reloc info.
-        Handle<Script> casted_script(Script::cast(script));
-        computed_location = MessageLocation(casted_script, pos, pos + 1);
-      }
-    }
-  }
+  Handle<Object> message =
+    MessageHandler::MakeMessageObject("uncaught_exception",
+                                      location,
+                                      HandleVector<Object>(&exception, 1),
+                                      stack_trace);
 
   // Report the uncaught exception.
-  MessageHandler::ReportMessage("uncaught_exception",
-                                location,
-                                HandleVector<Object>(&exception, 1));
-
-  // Optionally, report the stack trace separately.
-  if (!stack_trace.is_null()) {
-    MessageHandler::ReportMessage("stack_trace",
-                                  location,
-                                  HandleVector<String>(&stack_trace, 1));
-  }
+  MessageHandler::ReportMessage(location, message);
 }
 
 
@@ -771,12 +768,32 @@ void Top::DoThrow(Object* exception,
     ShouldReportException(&is_caught_externally);
   if (is_rethrow) report_exception = false;
 
+  Handle<Object> message_obj;
+  MessageLocation potential_computed_location;
+  bool try_catch_needs_message =
+    is_caught_externally && thread_local_.try_catch_handler_->capture_message_;
+  if (report_exception || try_catch_needs_message) {
+    if (location == NULL) {
+      // If no location was specified we use a computed one instead
+      ComputeLocation(&potential_computed_location);
+      location = &potential_computed_location;
+    }
+    Handle<String> stack_trace;
+    if (FLAG_trace_exception) stack_trace = StackTrace();
+    message_obj = MessageHandler::MakeMessageObject("uncaught_exception",
+        location, HandleVector<Object>(&exception_handle, 1), stack_trace);
+  }
+
   // If the exception is caught externally, we store it in the
   // try/catch handler. The C code can find it later and process it if
   // necessary.
   if (is_caught_externally) {
     thread_local_.try_catch_handler_->exception_ =
       reinterpret_cast<void*>(*exception_handle);
+    if (!message_obj.is_null()) {
+      thread_local_.try_catch_handler_->message_ =
+        reinterpret_cast<void*>(*message_obj);
+    }
   }
 
   // Notify debugger of exception.
@@ -786,9 +803,7 @@ void Top::DoThrow(Object* exception,
     if (message != NULL) {
       MessageHandler::ReportMessage(message);
     } else {
-      Handle<String> stack_trace;
-      if (FLAG_trace_exception) stack_trace = StackTrace();
-      ReportUncaughtException(exception_handle, location, stack_trace);
+      MessageHandler::ReportMessage(location, message_obj);
     }
   }
   thread_local_.external_caught_exception_ = is_caught_externally;
diff --git a/src/top.h b/src/top.h
index fffdb8a1ba02..19374936d2ba 100644
--- a/src/top.h
+++ b/src/top.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -226,6 +226,10 @@ class Top {
                                       MessageLocation* location,
                                       Handle<String> stack_trace);
 
+  // Attempts to compute the current source location, storing the
+  // result in the target out parameter.
+  static void ComputeLocation(MessageLocation* target);
+
   // Override command line flag.
   static void TraceException(bool flag);
 
diff --git a/src/unicode-inl.h b/src/unicode-inl.h
index 7f843d0b313e..9737c273628a 100644
--- a/src/unicode-inl.h
+++ b/src/unicode-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/unicode.cc b/src/unicode.cc
index ffe43add37c3..50dc92f1c08d 100644
--- a/src/unicode.cc
+++ b/src/unicode.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -25,7 +25,7 @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 //
-// This file was generated at 2008-06-12 16:11:05.556081
+// This file was generated at 2008-09-08 11:13:45.862026
 
 #include "unicode-inl.h"
 #include <cstdlib>
@@ -380,18 +380,18 @@ bool Lowercase::Is(uchar c) {
 
 // Letter:               point.category in ['Lu', 'Ll', 'Lt', 'Lm', 'Lo' ]
 
-static const uint16_t kLetterTable0Size = 475;
-static const uint16_t kLetterTable0[475] = { 32833, 90, 32865, 122, 170, 181, 186, 32960, 214, 32984, 246, 33016, 705, 33478, 721, 33504, 740, 750, 33658, 893, 902, 33672, 906, 908, 33678, 929, 33699, 974, 33744, 1013, 33783, 1153, 33930, 1299, 34097, 1366, 1369, 34145, 1415, 34256, 1514, 34288, 1522, 34337, 1594, 34368, 1610, 34414, 1647, 34417, 1747, 1749, 34533, 1766, 34542, 1775, 34554, 1788, 1791, 1808, 34578, 1839, 34637, 1901, 34688, 1957, 1969, 34762, 2026, 34804, 2037, 2042, 35076, 2361, 2365, 2384, 35160, 2401, 35195, 2431, 35205, 2444, 35215, 2448, 35219, 2472, 35242, 2480, 2482, 35254, 2489, 2493, 2510, 35292, 2525, 35295, 2529, 35312, 2545, 35333, 2570, 35343, 2576, 35347, 2600, 35370, 2608, 35378, 2611, 35381, 2614, 35384, 2617, 35417, 2652, 2654, 35442, 2676, 35461, 2701, 35471, 2705, 35475, 2728, 35498, 2736, 35506, 2739, 35509, 2745, 2749, 2768, 35552, 2785, 35589, 2828, 35599, 2832, 35603, 2856, 35626, 2864, 35634, 2867, 35637, 2873, 2877, 35676, 2909, 35679, 2913, 2929, 2947, 35717, 2954, 35726, 2960, 35730, 2965, 35737, 2970, 2972, 35742, 2975, 35747, 2980, 35752, 2986, 35758, 3001, 35845, 3084, 35854, 3088, 35858, 3112, 35882, 3123, 35893, 3129, 35936, 3169, 35973, 3212, 35982, 3216, 35986, 3240, 36010, 3251, 36021, 3257, 3261, 3294, 36064, 3297, 36101, 3340, 36110, 3344, 36114, 3368, 36138, 3385, 36192, 3425, 36229, 3478, 36250, 3505, 36275, 3515, 3517, 36288, 3526, 36353, 3632, 36402, 3635, 36416, 3654, 36481, 3714, 3716, 36487, 3720, 3722, 3725, 36500, 3735, 36505, 3743, 36513, 3747, 3749, 3751, 36522, 3755, 36525, 3760, 36530, 3763, 3773, 36544, 3780, 3782, 36572, 3805, 3840, 36672, 3911, 36681, 3946, 36744, 3979, 36864, 4129, 36899, 4135, 36905, 4138, 36944, 4181, 37024, 4293, 37072, 4346, 4348, 37120, 4441, 37215, 4514, 37288, 4601, 37376, 4680, 37450, 4685, 37456, 4694, 4696, 37466, 4701, 37472, 4744, 37514, 4749, 37520, 4784, 37554, 4789, 37560, 4798, 4800, 37570, 4805, 37576, 4822, 37592, 4880, 37650, 4885, 37656, 4954, 37760, 5007, 37792, 5108, 37889, 5740, 38511, 5750, 38529, 5786, 38560, 5866, 38656, 5900, 38670, 5905, 38688, 5937, 38720, 5969, 38752, 5996, 38766, 6000, 38784, 6067, 6103, 6108, 38944, 6263, 39040, 6312, 39168, 6428, 39248, 6509, 39280, 6516, 39296, 6569, 39361, 6599, 39424, 6678, 39685, 6963, 39749, 6987, 40192, 7615, 40448, 7835, 40608, 7929, 40704, 7957, 40728, 7965, 40736, 8005, 40776, 8013, 40784, 8023, 8025, 8027, 8029, 40799, 8061, 40832, 8116, 40886, 8124, 8126, 40898, 8132, 40902, 8140, 40912, 8147, 40918, 8155, 40928, 8172, 40946, 8180, 40950, 8188, 8305, 8319, 41104, 8340, 8450, 8455, 41226, 8467, 8469, 41241, 8477, 8484, 8486, 8488, 41258, 8493, 41263, 8505, 41276, 8511, 41285, 8521, 8526, 41347, 8580, 44032, 11310, 44080, 11358, 44128, 11372, 44148, 11383, 44160, 11492, 44288, 11557, 44336, 11621, 11631, 44416, 11670, 44448, 11686, 44456, 11694, 44464, 11702, 44472, 11710, 44480, 11718, 44488, 11726, 44496, 11734, 44504, 11742, 45061, 12294, 45105, 12341, 45115, 12348, 45121, 12438, 45213, 12447, 45217, 12538, 45308, 12543, 45317, 12588, 45361, 12686, 45472, 12727, 45552, 12799, 13312, 19893, 19968 }; // NOLINT
-static const uint16_t kLetterTable1Size = 67;
-static const uint16_t kLetterTable1[67] = { 8123, 40960, 9356, 42775, 10010, 43008, 10241, 43011, 10245, 43015, 10250, 43020, 10274, 43072, 10355, 11264, 22435, 63744, 31277, 64048, 31338, 64112, 31449, 64256, 31494, 64275, 31511, 31517, 64287, 31528, 64298, 31542, 64312, 31548, 31550, 64320, 31553, 64323, 31556, 64326, 31665, 64467, 32061, 64848, 32143, 64914, 32199, 65008, 32251, 65136, 32372, 65142, 32508, 65313, 32570, 65345, 32602, 65382, 32702, 65474, 32711, 65482, 32719, 65490, 32727, 65498, 32732 }; // NOLINT
+static const uint16_t kLetterTable0Size = 476;
+static const uint16_t kLetterTable0[476] = { 32833, 90, 32865, 122, 170, 181, 186, 32960, 214, 32984, 246, 33016, 705, 33478, 721, 33504, 740, 750, 33658, 893, 902, 33672, 906, 908, 33678, 929, 33699, 974, 33744, 1013, 33783, 1153, 33930, 1299, 34097, 1366, 1369, 34145, 1415, 34256, 1514, 34288, 1522, 34337, 1594, 34368, 1610, 34414, 1647, 34417, 1747, 1749, 34533, 1766, 34542, 1775, 34554, 1788, 1791, 1808, 34578, 1839, 34637, 1901, 34688, 1957, 1969, 34762, 2026, 34804, 2037, 2042, 35076, 2361, 2365, 2384, 35160, 2401, 35195, 2431, 35205, 2444, 35215, 2448, 35219, 2472, 35242, 2480, 2482, 35254, 2489, 2493, 2510, 35292, 2525, 35295, 2529, 35312, 2545, 35333, 2570, 35343, 2576, 35347, 2600, 35370, 2608, 35378, 2611, 35381, 2614, 35384, 2617, 35417, 2652, 2654, 35442, 2676, 35461, 2701, 35471, 2705, 35475, 2728, 35498, 2736, 35506, 2739, 35509, 2745, 2749, 2768, 35552, 2785, 35589, 2828, 35599, 2832, 35603, 2856, 35626, 2864, 35634, 2867, 35637, 2873, 2877, 35676, 2909, 35679, 2913, 2929, 2947, 35717, 2954, 35726, 2960, 35730, 2965, 35737, 2970, 2972, 35742, 2975, 35747, 2980, 35752, 2986, 35758, 3001, 35845, 3084, 35854, 3088, 35858, 3112, 35882, 3123, 35893, 3129, 35936, 3169, 35973, 3212, 35982, 3216, 35986, 3240, 36010, 3251, 36021, 3257, 3261, 3294, 36064, 3297, 36101, 3340, 36110, 3344, 36114, 3368, 36138, 3385, 36192, 3425, 36229, 3478, 36250, 3505, 36275, 3515, 3517, 36288, 3526, 36353, 3632, 36402, 3635, 36416, 3654, 36481, 3714, 3716, 36487, 3720, 3722, 3725, 36500, 3735, 36505, 3743, 36513, 3747, 3749, 3751, 36522, 3755, 36525, 3760, 36530, 3763, 3773, 36544, 3780, 3782, 36572, 3805, 3840, 36672, 3911, 36681, 3946, 36744, 3979, 36864, 4129, 36899, 4135, 36905, 4138, 36944, 4181, 37024, 4293, 37072, 4346, 4348, 37120, 4441, 37215, 4514, 37288, 4601, 37376, 4680, 37450, 4685, 37456, 4694, 4696, 37466, 4701, 37472, 4744, 37514, 4749, 37520, 4784, 37554, 4789, 37560, 4798, 4800, 37570, 4805, 37576, 4822, 37592, 4880, 37650, 4885, 37656, 4954, 37760, 5007, 37792, 5108, 37889, 5740, 38511, 5750, 38529, 5786, 38560, 5866, 38656, 5900, 38670, 5905, 38688, 5937, 38720, 5969, 38752, 5996, 38766, 6000, 38784, 6067, 6103, 6108, 38944, 6263, 39040, 6312, 39168, 6428, 39248, 6509, 39280, 6516, 39296, 6569, 39361, 6599, 39424, 6678, 39685, 6963, 39749, 6987, 40192, 7615, 40448, 7835, 40608, 7929, 40704, 7957, 40728, 7965, 40736, 8005, 40776, 8013, 40784, 8023, 8025, 8027, 8029, 40799, 8061, 40832, 8116, 40886, 8124, 8126, 40898, 8132, 40902, 8140, 40912, 8147, 40918, 8155, 40928, 8172, 40946, 8180, 40950, 8188, 8305, 8319, 41104, 8340, 8450, 8455, 41226, 8467, 8469, 41241, 8477, 8484, 8486, 8488, 41258, 8493, 41263, 8505, 41276, 8511, 41285, 8521, 8526, 41347, 8580, 44032, 11310, 44080, 11358, 44128, 11372, 44148, 11383, 44160, 11492, 44288, 11557, 44336, 11621, 11631, 44416, 11670, 44448, 11686, 44456, 11694, 44464, 11702, 44472, 11710, 44480, 11718, 44488, 11726, 44496, 11734, 44504, 11742, 45061, 12294, 45105, 12341, 45115, 12348, 45121, 12438, 45213, 12447, 45217, 12538, 45308, 12543, 45317, 12588, 45361, 12686, 45472, 12727, 45552, 12799, 46080, 19893, 52736, 32767 }; // NOLINT
+static const uint16_t kLetterTable1Size = 68;
+static const uint16_t kLetterTable1[68] = { 32768, 8123, 40960, 9356, 42775, 10010, 43008, 10241, 43011, 10245, 43015, 10250, 43020, 10274, 43072, 10355, 44032, 22435, 63744, 31277, 64048, 31338, 64112, 31449, 64256, 31494, 64275, 31511, 31517, 64287, 31528, 64298, 31542, 64312, 31548, 31550, 64320, 31553, 64323, 31556, 64326, 31665, 64467, 32061, 64848, 32143, 64914, 32199, 65008, 32251, 65136, 32372, 65142, 32508, 65313, 32570, 65345, 32602, 65382, 32702, 65474, 32711, 65482, 32719, 65490, 32727, 65498, 32732 }; // NOLINT
 static const uint16_t kLetterTable2Size = 48;
 static const uint16_t kLetterTable2[48] = { 32768, 11, 32781, 38, 32808, 58, 32828, 61, 32831, 77, 32848, 93, 32896, 250, 33536, 798, 33584, 832, 33602, 841, 33664, 925, 33696, 963, 33736, 975, 33792, 1181, 34816, 2053, 2056, 34826, 2101, 34871, 2104, 2108, 2111, 35072, 2325, 2560, 35344, 2579, 35349, 2583, 35353, 2611, 40960, 9070 }; // NOLINT
 static const uint16_t kLetterTable3Size = 57;
 static const uint16_t kLetterTable3[57] = { 54272, 21588, 54358, 21660, 54430, 21663, 21666, 54437, 21670, 54441, 21676, 54446, 21689, 21691, 54461, 21699, 54469, 21765, 54535, 21770, 54541, 21780, 54550, 21788, 54558, 21817, 54587, 21822, 54592, 21828, 21830, 54602, 21840, 54610, 22181, 54952, 22208, 54978, 22234, 55004, 22266, 55036, 22292, 55062, 22324, 55094, 22350, 55120, 22382, 55152, 22408, 55178, 22440, 55210, 22466, 55236, 22475 }; // NOLINT
-static const uint16_t kLetterTable4Size = 1;
-static const uint16_t kLetterTable4[1] = { 0 }; // NOLINT
-static const uint16_t kLetterTable5Size = 3;
-static const uint16_t kLetterTable5[3] = { 9942, 63488, 31261 }; // NOLINT
+static const uint16_t kLetterTable4Size = 2;
+static const uint16_t kLetterTable4[2] = { 32768, 32767 }; // NOLINT
+static const uint16_t kLetterTable5Size = 4;
+static const uint16_t kLetterTable5[4] = { 32768, 9942, 63488, 31261 }; // NOLINT
 bool Letter::Is(uchar c) {
   int chunk_index = c >> 15;
   switch (chunk_index) {
@@ -505,14 +505,14 @@ bool DecimalDigit::Is(uchar c) {
 
 // Ideographic:          'Id' in point.properties
 
-static const uint16_t kIdeographicTable0Size = 9;
-static const uint16_t kIdeographicTable0[9] = { 45062, 12295, 45089, 12329, 45112, 12346, 13312, 19893, 19968 }; // NOLINT
-static const uint16_t kIdeographicTable1Size = 5;
-static const uint16_t kIdeographicTable1[5] = { 8123, 63744, 31277, 64112, 31449 }; // NOLINT
-static const uint16_t kIdeographicTable4Size = 1;
-static const uint16_t kIdeographicTable4[1] = { 0 }; // NOLINT
-static const uint16_t kIdeographicTable5Size = 3;
-static const uint16_t kIdeographicTable5[3] = { 9942, 63488, 31261 }; // NOLINT
+static const uint16_t kIdeographicTable0Size = 10;
+static const uint16_t kIdeographicTable0[10] = { 45062, 12295, 45089, 12329, 45112, 12346, 46080, 19893, 52736, 32767 }; // NOLINT
+static const uint16_t kIdeographicTable1Size = 6;
+static const uint16_t kIdeographicTable1[6] = { 32768, 8123, 63744, 31277, 64112, 31449 }; // NOLINT
+static const uint16_t kIdeographicTable4Size = 2;
+static const uint16_t kIdeographicTable4[2] = { 32768, 32767 }; // NOLINT
+static const uint16_t kIdeographicTable5Size = 4;
+static const uint16_t kIdeographicTable5[4] = { 32768, 9942, 63488, 31261 }; // NOLINT
 bool Ideographic::Is(uchar c) {
   int chunk_index = c >> 15;
   switch (chunk_index) {
diff --git a/src/unicode.h b/src/unicode.h
index cc120b6fb92f..804671b6986f 100644
--- a/src/unicode.h
+++ b/src/unicode.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/uri.js b/src/uri.js
index 270a0f8690c1..147110e544f4 100644
--- a/src/uri.js
+++ b/src/uri.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/usage-analyzer.cc b/src/usage-analyzer.cc
index 231a8e429903..0f234d8d97cf 100644
--- a/src/usage-analyzer.cc
+++ b/src/usage-analyzer.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/usage-analyzer.h b/src/usage-analyzer.h
index de7e4f977a4c..2732dd5766e3 100644
--- a/src/usage-analyzer.h
+++ b/src/usage-analyzer.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/utils.cc b/src/utils.cc
index 48ccc311f5d7..8cfa2379de2a 100644
--- a/src/utils.cc
+++ b/src/utils.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -104,7 +104,7 @@ char* ReadLine(const char* prompt) {
   char line_buf[256];
   int offset = 0;
   bool keep_going = true;
-  fprintf(stdout, prompt);
+  fprintf(stdout, "%s", prompt);
   fflush(stdout);
   while (keep_going) {
     if (fgets(line_buf, sizeof(line_buf), stdin) == NULL) {
diff --git a/src/utils.h b/src/utils.h
index e7d5633e809b..1c07ba4c8f45 100644
--- a/src/utils.h
+++ b/src/utils.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/v8-counters.cc b/src/v8-counters.cc
index e350d9008354..f6b1c3d052c8 100644
--- a/src/v8-counters.cc
+++ b/src/v8-counters.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/src/v8-counters.h b/src/v8-counters.h
index 566ed54b8b61..76c2ec83073d 100644
--- a/src/v8-counters.h
+++ b/src/v8-counters.h
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -71,6 +71,8 @@ namespace v8 { namespace internal {
   SC(call_normal_stubs, V8.CallNormalStubs)                      \
   SC(call_megamorphic_stubs, V8.CallMegamorphicStubs)            \
   SC(arguments_adaptors, V8.ArgumentsAdaptors)                   \
+  SC(eval_cache_hits, V8.EvalCacheHits)                          \
+  SC(eval_cache_misses, V8.EvalCacheMisses)                      \
   /* Amount of evaled source code. */                            \
   SC(total_eval_size, V8.TotalEvalSize)                          \
   /* Amount of loaded source code. */                            \
diff --git a/src/v8.cc b/src/v8.cc
index 7a631fe54f1f..4a7dc6f27d5e 100644
--- a/src/v8.cc
+++ b/src/v8.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/v8.h b/src/v8.h
index c4390061bb4f..acdb119cbe8b 100644
--- a/src/v8.h
+++ b/src/v8.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/v8natives.js b/src/v8natives.js
index 5ead3adc4681..d59cc4b05d81 100644
--- a/src/v8natives.js
+++ b/src/v8natives.js
@@ -1,4 +1,4 @@
-// Copyright 2006-2007 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/v8threads.cc b/src/v8threads.cc
index 89c79187269f..2b4a02715e65 100644
--- a/src/v8threads.cc
+++ b/src/v8threads.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -54,11 +54,9 @@ Locker::Locker() : has_lock_(false), top_level_(true) {
 }
 
 
-#ifdef DEBUG
-void Locker::AssertIsLocked() {
-  ASSERT(internal::ThreadManager::IsLockedByCurrentThread());
+bool Locker::IsLocked() {
+  return internal::ThreadManager::IsLockedByCurrentThread();
 }
-#endif
 
 
 Locker::~Locker() {
@@ -282,7 +280,7 @@ static v8::internal::ContextSwitcher* switcher;
 
 
 void ContextSwitcher::StartPreemption(int every_n_ms) {
-  Locker::AssertIsLocked();
+  ASSERT(Locker::IsLocked());
   if (switcher == NULL) {
     switcher = new ContextSwitcher(every_n_ms);
     switcher->Start();
@@ -293,7 +291,7 @@ void ContextSwitcher::StartPreemption(int every_n_ms) {
 
 
 void ContextSwitcher::StopPreemption() {
-  Locker::AssertIsLocked();
+  ASSERT(Locker::IsLocked());
   if (switcher != NULL) {
     switcher->Stop();
     delete(switcher);
@@ -312,7 +310,7 @@ void ContextSwitcher::Run() {
 
 
 void ContextSwitcher::Stop() {
-  Locker::AssertIsLocked();
+  ASSERT(Locker::IsLocked());
   keep_going_ = false;
   preemption_semaphore_->Signal();
   Join();
@@ -325,7 +323,7 @@ void ContextSwitcher::WaitForPreemption() {
 
 
 void ContextSwitcher::PreemptionReceived() {
-  Locker::AssertIsLocked();
+  ASSERT(Locker::IsLocked());
   switcher->preemption_semaphore_->Signal();
 }
 
diff --git a/src/v8threads.h b/src/v8threads.h
index f481d9d2e588..f5c844d8ae87 100644
--- a/src/v8threads.h
+++ b/src/v8threads.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/src/variables.cc b/src/variables.cc
index 1784800d14e9..d57ec1b931e8 100644
--- a/src/variables.cc
+++ b/src/variables.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/variables.h b/src/variables.h
index bdc69348ea68..6a4b3c5b4a7c 100644
--- a/src/variables.h
+++ b/src/variables.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/zone-inl.h b/src/zone-inl.h
index fadbbc52b562..7ed4e6b3d4ce 100644
--- a/src/zone-inl.h
+++ b/src/zone-inl.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/zone.cc b/src/zone.cc
index ed443d871b94..d37f4f7fa742 100644
--- a/src/zone.cc
+++ b/src/zone.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/src/zone.h b/src/zone.h
index 336fd343a9d6..c7129ec4b06a 100644
--- a/src/zone.h
+++ b/src/zone.h
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/SConscript b/test/cctest/SConscript
index cc591991481a..bd0e3274b5d3 100644
--- a/test/cctest/SConscript
+++ b/test/cctest/SConscript
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -53,7 +53,7 @@ def Build():
   cctest_files = context.GetRelevantSources(SOURCES)
   env = Environment()
   env.Replace(**context.flags['cctest'])
-  env['ENV'].update(**context.env_overrides)
+  context.ApplyEnvOverrides(env)
   # There seems to be a glitch in the way scons decides where to put
   # PDB files when compiling using MSVC so we specify it manually.
   # This should not affect any other platforms.
diff --git a/test/cctest/cctest.cc b/test/cctest/cctest.cc
index eef295f883b9..6591f17b4898 100644
--- a/test/cctest/cctest.cc
+++ b/test/cctest/cctest.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -35,7 +35,8 @@
 CcTest* CcTest::last_ = NULL;
 
 
-CcTest::CcTest(TestFunction* callback, const char* file, const char* name)
+CcTest::CcTest(TestFunction* callback, const char* file,
+               const char* name, bool enabled)
     : callback_(callback), name_(name), prev_(last_) {
   // Find the base name of this test (const_cast required on Windows).
   char *basename = strrchr(const_cast<char *>(file), '/');
@@ -52,6 +53,7 @@ CcTest::CcTest(TestFunction* callback, const char* file, const char* name)
   if (extension) *extension = 0;
   // Install this test in the list of tests
   file_ = basename;
+  enabled_ = enabled;
   prev_ = last_;
   last_ = this;
 }
@@ -64,30 +66,6 @@ static void PrintTestList(CcTest* current) {
 }
 
 
-static int RunMatchingTests(CcTest* current, char* file_or_name) {
-  if (current == NULL) return 0;
-  int run_count = 0;
-  if (strcmp(current->file(), file_or_name) == 0
-      || strcmp(current->name(), file_or_name) == 0) {
-    current->Run();
-    run_count++;
-  }
-  return run_count + RunMatchingTests(current->prev(), file_or_name);
-}
-
-
-static int RunMatchingTests(CcTest* current, char* file, char* name) {
-  if (current == NULL) return 0;
-  int run_count = 0;
-  if (strcmp(current->file(), file) == 0
-      && strcmp(current->name(), name) == 0) {
-    current->Run();
-    run_count++;
-  }
-  return run_count + RunMatchingTests(current->prev(), file, name);
-}
-
-
 int main(int argc, char* argv[]) {
   v8::internal::FlagList::SetFlagsFromCommandLine(&argc, argv, true);
   int tests_run = 0;
@@ -97,6 +75,7 @@ int main(int argc, char* argv[]) {
     if (strcmp(arg, "--list") == 0) {
       PrintTestList(CcTest::last());
       print_run_count = false;
+
     } else {
       char* arg_copy = strdup(arg);
       char* testname = strchr(arg_copy, '/');
@@ -104,10 +83,32 @@ int main(int argc, char* argv[]) {
         // Split the string in two by nulling the slash and then run
         // exact matches.
         *testname = 0;
-        tests_run += RunMatchingTests(CcTest::last(), arg_copy, testname + 1);
+        char* file = arg_copy;
+        char* name = testname + 1;
+        CcTest* test = CcTest::last();
+        while (test != NULL) {
+          if (test->enabled()
+              && strcmp(test->file(), file) == 0
+              && strcmp(test->name(), name) == 0) {
+            test->Run();
+            tests_run++;
+          }
+          test = test->prev();
+        }
+
       } else {
         // Run all tests with the specified file or test name.
-        tests_run += RunMatchingTests(CcTest::last(), arg_copy);
+        char* file_or_name = arg_copy;
+        CcTest* test = CcTest::last();
+        while (test != NULL) {
+          if (test->enabled()
+              && (strcmp(test->file(), file_or_name) == 0
+                  || strcmp(test->name(), file_or_name) == 0)) {
+            test->Run();
+            tests_run++;
+          }
+          test = test->prev();
+        }
       }
       free(arg_copy);
     }
diff --git a/test/cctest/cctest.h b/test/cctest/cctest.h
index e3de88123d7c..8646479fcc59 100644
--- a/test/cctest/cctest.h
+++ b/test/cctest/cctest.h
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -31,7 +31,14 @@
 #ifndef TEST
 #define TEST(Name)                                                   \
   static void Test##Name();                                          \
-  CcTest register_test_##Name(Test##Name, __FILE__, #Name);          \
+  CcTest register_test_##Name(Test##Name, __FILE__, #Name, true);    \
+  static void Test##Name()
+#endif
+
+#ifndef DISABLED_TEST
+#define DISABLED_TEST(Name)                                          \
+  static void Test##Name();                                          \
+  CcTest register_test_##Name(Test##Name, __FILE__, #Name, false);   \
   static void Test##Name()
 #endif
 
@@ -39,17 +46,20 @@
 class CcTest {
  public:
   typedef void (TestFunction)();
-  CcTest(TestFunction* callback, const char* file, const char* name);
+  CcTest(TestFunction* callback, const char* file, const char* name,
+         bool enabled);
   void Run() { callback_(); }
   static int test_count();
   static CcTest* last() { return last_; }
   CcTest* prev() { return prev_; }
   const char* file() { return file_; }
   const char* name() { return name_; }
+  bool enabled() { return enabled_; }
  private:
   TestFunction* callback_;
   const char* file_;
   const char* name_;
+  bool enabled_;
   static CcTest* last_;
   CcTest* prev_;
 };
diff --git a/test/cctest/cctest.status b/test/cctest/cctest.status
index b222196f2d98..d7013a8378ec 100644
--- a/test/cctest/cctest.status
+++ b/test/cctest/cctest.status
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/test/cctest/test-api.cc b/test/cctest/test-api.cc
index 46126c497d37..f43a31909d0c 100644
--- a/test/cctest/test-api.cc
+++ b/test/cctest/test-api.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -461,10 +461,10 @@ THREADED_TEST(ScriptUsingStringResource) {
     CHECK(source->IsExternal());
     CHECK_EQ(resource,
              static_cast<TestResource*>(source->GetExternalStringResource()));
-    v8::internal::Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+    v8::internal::Heap::CollectAllGarbage();
     CHECK_EQ(0, TestResource::dispose_count);
   }
-  v8::internal::Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+  v8::internal::Heap::CollectAllGarbage();
   CHECK_EQ(1, TestResource::dispose_count);
 }
 
@@ -481,10 +481,10 @@ THREADED_TEST(ScriptUsingAsciiStringResource) {
     Local<Value> value = script->Run();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value());
-    v8::internal::Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+    v8::internal::Heap::CollectAllGarbage();
     CHECK_EQ(0, TestAsciiResource::dispose_count);
   }
-  v8::internal::Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+  v8::internal::Heap::CollectAllGarbage();
   CHECK_EQ(1, TestAsciiResource::dispose_count);
 }
 
@@ -1427,9 +1427,9 @@ static const char* js_code_causing_out_of_memory =
 
 // These tests run for a long time and prevent us from running tests
 // that come after them so they cannot run in parallel.
-TEST(OutOfMemory) {
+DISABLED_TEST(OutOfMemory) {
   // It's not possible to read a snapshot into a heap with different dimensions.
-  v8::internal::Snapshot::DisableInternal();
+  if (v8::internal::Snapshot::IsEnabled()) return;
   // Set heap limits.
   static const int K = 1024;
   v8::ResourceConstraints constraints;
@@ -1468,9 +1468,9 @@ v8::Handle<Value> ProvokeOutOfMemory(const v8::Arguments& args) {
 }
 
 
-TEST(OutOfMemoryNested) {
+DISABLED_TEST(OutOfMemoryNested) {
   // It's not possible to read a snapshot into a heap with different dimensions.
-  v8::internal::Snapshot::DisableInternal();
+  if (v8::internal::Snapshot::IsEnabled()) return;
   // Set heap limits.
   static const int K = 1024;
   v8::ResourceConstraints constraints;
@@ -1499,7 +1499,7 @@ TEST(OutOfMemoryNested) {
 
 TEST(HugeConsStringOutOfMemory) {
   // It's not possible to read a snapshot into a heap with different dimensions.
-  v8::internal::Snapshot::DisableInternal();
+  if (v8::internal::Snapshot::IsEnabled()) return;
   v8::HandleScope scope;
   LocalContext context;
   // Set heap limits.
@@ -2455,7 +2455,7 @@ static v8::Handle<Value> ArgumentsTestCallback(const v8::Arguments& args) {
   CHECK_EQ(v8::Integer::New(3), args[2]);
   CHECK_EQ(v8::Undefined(), args[3]);
   v8::HandleScope scope;
-  i::Heap::CollectGarbage(0, i::OLD_SPACE);
+  i::Heap::CollectAllGarbage();
   return v8::Undefined();
 }
 
@@ -3959,6 +3959,11 @@ THREADED_TEST(CallAsFunction) {
   CHECK(!try_catch.HasCaught());
   CHECK_EQ(49, value->Int32Value());
 
+  // test special case of call as function
+  value = Script::Compile(v8_str("[obj]['0'](45)"))->Run();
+  CHECK(!try_catch.HasCaught());
+  CHECK_EQ(45, value->Int32Value());
+
   value = Script::Compile(v8_str("obj.call = Function.prototype.call;"
                                  "obj.call(null, 87)"))->Run();
   CHECK(!try_catch.HasCaught());
@@ -4563,7 +4568,7 @@ void ApiTestFuzzer::CallTest() {
 
 
 static v8::Handle<Value> ThrowInJS(const v8::Arguments& args) {
-  v8::Locker::AssertIsLocked();
+  CHECK(v8::Locker::IsLocked());
   ApiTestFuzzer::Fuzz();
   v8::Unlocker unlocker;
   const char* code = "throw 7;";
@@ -4586,7 +4591,7 @@ static v8::Handle<Value> ThrowInJS(const v8::Arguments& args) {
 
 
 static v8::Handle<Value> ThrowInJSNoCatch(const v8::Arguments& args) {
-  v8::Locker::AssertIsLocked();
+  CHECK(v8::Locker::IsLocked());
   ApiTestFuzzer::Fuzz();
   v8::Unlocker unlocker;
   const char* code = "throw 7;";
@@ -4604,7 +4609,7 @@ static v8::Handle<Value> ThrowInJSNoCatch(const v8::Arguments& args) {
 // as part of the locking aggregation tests.
 TEST(NestedLockers) {
   v8::Locker locker;
-  v8::Locker::AssertIsLocked();
+  CHECK(v8::Locker::IsLocked());
   v8::HandleScope scope;
   LocalContext env;
   Local<v8::FunctionTemplate> fun_templ = v8::FunctionTemplate::New(ThrowInJS);
@@ -4648,7 +4653,7 @@ THREADED_TEST(RecursiveLocking) {
   v8::Locker locker;
   {
     v8::Locker locker2;
-    v8::Locker::AssertIsLocked();
+    CHECK(v8::Locker::IsLocked());
   }
 }
 
@@ -4694,7 +4699,7 @@ THREADED_TEST(LockUnlockLock) {
 
 static void EnsureNoSurvivingGlobalObjects() {
   int count = 0;
-  v8::internal::Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+  v8::internal::Heap::CollectAllGarbage();
   v8::internal::HeapIterator it;
   while (it.has_next()) {
     v8::internal::HeapObject* object = it.next();
@@ -4716,6 +4721,8 @@ TEST(DontLeakGlobalObjects) {
   // Regression test for issues 1139850 and 1174891.
 
   v8::internal::V8::Initialize(NULL);
+  if (v8::internal::Snapshot::IsEnabled()) return;
+
   EnsureNoSurvivingGlobalObjects();
 
   for (int i = 0; i < 5; i++) {
@@ -4757,6 +4764,7 @@ TEST(DontLeakGlobalObjects) {
 
 THREADED_TEST(CheckForCrossContextObjectLiterals) {
   v8::internal::V8::Initialize(NULL);
+  if (v8::internal::Snapshot::IsEnabled()) return;
 
   const int nof = 2;
   const char* sources[nof] = {
@@ -4817,3 +4825,75 @@ THREADED_TEST(DisposeEnteredContext) {
     inner->Exit();
   }
 }
+
+
+// Regression test for issue 54, object templates with internal fields
+// but no accessors or interceptors did not get their internal field
+// count set on instances.
+THREADED_TEST(Regress54) {
+  v8::HandleScope outer;
+  LocalContext context;
+  static v8::Persistent<v8::ObjectTemplate> templ;
+  if (templ.IsEmpty()) {
+    v8::HandleScope inner;
+    v8::Handle<v8::ObjectTemplate> local = v8::ObjectTemplate::New();
+    local->SetInternalFieldCount(1);
+    templ = v8::Persistent<v8::ObjectTemplate>::New(inner.Close(local));
+  }
+  v8::Handle<v8::Object> result = templ->NewInstance();
+  CHECK_EQ(1, result->InternalFieldCount());
+}
+
+
+// If part of the threaded tests, this test makes ThreadingTest fail
+// on mac.
+TEST(CatchStackOverflow) {
+  v8::HandleScope scope;
+  LocalContext context;
+  v8::TryCatch try_catch;
+  v8::Handle<v8::Script> script = v8::Script::Compile(v8::String::New(
+    "function f() {"
+    "  return f();"
+    "}"
+    ""
+    "f();"));
+  v8::Handle<v8::Value> result = script->Run();
+  CHECK(result.IsEmpty());
+}
+
+
+THREADED_TEST(TryCatchSourceInfo) {
+  v8::HandleScope scope;
+  LocalContext context;
+  v8::Handle<v8::String> source = v8::String::New(
+      "function Foo() {\n"
+      "  return Bar();\n"
+      "}\n"
+      "\n"
+      "function Bar() {\n"
+      "  return Baz();\n"
+      "}\n"
+      "\n"
+      "function Baz() {\n"
+      "  throw 'nirk';\n"
+      "}\n"
+      "\n"
+      "Foo();\n");
+  v8::Handle<v8::Script> script =
+    v8::Script::Compile(source, v8::String::New("test.js"));
+  v8::TryCatch try_catch;
+  v8::Handle<v8::Value> result = script->Run();
+  CHECK(result.IsEmpty());
+  CHECK(try_catch.HasCaught());
+  v8::Handle<v8::Message> message = try_catch.Message();
+  CHECK(!message.IsEmpty());
+  CHECK_EQ(10, message->GetLineNumber());
+  CHECK_EQ(91, message->GetStartPosition());
+  CHECK_EQ(92, message->GetEndPosition());
+  CHECK_EQ(2, message->GetStartColumn());
+  CHECK_EQ(3, message->GetEndColumn());
+  v8::String::AsciiValue line(message->GetSourceLine());
+  CHECK_EQ("  throw 'nirk';", *line);
+  v8::String::AsciiValue name(message->GetScriptResourceName());
+  CHECK_EQ("test.js", *name);
+}
diff --git a/test/cctest/test-assembler-arm.cc b/test/cctest/test-assembler-arm.cc
index b6db2e3c239c..a02441de7d81 100644
--- a/test/cctest/test-assembler-arm.cc
+++ b/test/cctest/test-assembler-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/test-assembler-ia32.cc b/test/cctest/test-assembler-ia32.cc
index 3fae62ee3ab6..7097c64d8718 100644
--- a/test/cctest/test-assembler-ia32.cc
+++ b/test/cctest/test-assembler-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/test-ast.cc b/test/cctest/test-ast.cc
index ac36eb12036a..7d10c82224b9 100644
--- a/test/cctest/test-ast.cc
+++ b/test/cctest/test-ast.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/test-compiler.cc b/test/cctest/test-compiler.cc
index 140f2b9f8f7d..dca36e252071 100644
--- a/test/cctest/test-compiler.cc
+++ b/test/cctest/test-compiler.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/test-conversions.cc b/test/cctest/test-conversions.cc
index 283f12c42f05..6c0b9a65a0d5 100644
--- a/test/cctest/test-conversions.cc
+++ b/test/cctest/test-conversions.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include <stdlib.h>
 
diff --git a/test/cctest/test-debug.cc b/test/cctest/test-debug.cc
index 3b1ffa7072ed..89fcb366e051 100644
--- a/test/cctest/test-debug.cc
+++ b/test/cctest/test-debug.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -618,7 +618,7 @@ static void DebugEventBreakPointCollectGarbage(
       Heap::CollectGarbage(0, v8::internal::NEW_SPACE);
     } else {
       // Mark sweep (and perhaps compact).
-      Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+      Heap::CollectAllGarbage();
     }
   }
 }
@@ -960,7 +960,7 @@ static void CallAndGC(v8::Local<v8::Object> recv, v8::Local<v8::Function> f) {
     CHECK_EQ(2 + i * 3, break_point_hit_count);
 
     // Mark sweep (and perhaps compact) and call function.
-    Heap::CollectGarbage(0, v8::internal::OLD_SPACE);
+    Heap::CollectAllGarbage();
     f->Call(recv, 0, NULL);
     CHECK_EQ(3 + i * 3, break_point_hit_count);
   }
@@ -2751,11 +2751,13 @@ void Barriers::Initialize() {
 }
 
 
-// We match this prefix to a message to decide if it is a break message.
+// We match parts of the message to decide if it is a break message.
 bool IsBreakEventMessage(char *message) {
-  const char* break_template = "{\"type\":\"event\",\"event\":\"break\",";
-  // Is break_template a prefix of the message?
-  return !strncmp(message, break_template, strlen(break_template));
+  const char* type_event = "\"type\":\"event\"";
+  const char* event_break = "\"event\":\"break\"";
+  // Does the message contain both type:event and event:break?
+  return strstr(message, type_event) != NULL &&
+         strstr(message, event_break) != NULL;
 }
 
 
@@ -2990,9 +2992,6 @@ class BreakpointsDebuggerThread : public v8::internal::Thread {
 };
 
 
-// We match this prefix to a message to decide if it is a break message.
-const char* break_template = "{\"type\":\"event\",\"event\":\"break\",";
-
 Barriers* breakpoints_barriers;
 
 static void BreakpointsMessageHandler(const uint16_t* message,
@@ -3004,7 +3003,7 @@ static void BreakpointsMessageHandler(const uint16_t* message,
   fflush(stdout);
 
   // Is break_template a prefix of the message?
-  if (!strncmp(print_buffer, break_template, strlen(break_template))) {
+  if (IsBreakEventMessage(print_buffer)) {
     breakpoints_barriers->semaphore_1->Signal();
   }
 }
diff --git a/test/cctest/test-decls.cc b/test/cctest/test-decls.cc
index 4f89b26cd877..e798fee9b7d4 100644
--- a/test/cctest/test-decls.cc
+++ b/test/cctest/test-decls.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/test/cctest/test-disasm-arm.cc b/test/cctest/test-disasm-arm.cc
index 3e89d3701250..f1b43cdfa251 100644
--- a/test/cctest/test-disasm-arm.cc
+++ b/test/cctest/test-disasm-arm.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/test/cctest/test-disasm-ia32.cc b/test/cctest/test-disasm-ia32.cc
index 7136a0c02d1b..dee4dae77a95 100644
--- a/test/cctest/test-disasm-ia32.cc
+++ b/test/cctest/test-disasm-ia32.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/test/cctest/test-flags.cc b/test/cctest/test-flags.cc
index 7b1b988161f0..b4827b667678 100644
--- a/test/cctest/test-flags.cc
+++ b/test/cctest/test-flags.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/test-hashmap.cc b/test/cctest/test-hashmap.cc
index 47c2e8fae094..4918d5d52d79 100644
--- a/test/cctest/test-hashmap.cc
+++ b/test/cctest/test-hashmap.cc
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/cctest/test-heap.cc b/test/cctest/test-heap.cc
index 269e3e9b30f2..4f4a12791232 100644
--- a/test/cctest/test-heap.cc
+++ b/test/cctest/test-heap.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 #include <stdlib.h>
 
@@ -176,7 +176,8 @@ TEST(Tagging) {
   CHECK(Failure::RetryAfterGC(12, NEW_SPACE)->IsFailure());
   CHECK_EQ(12, Failure::RetryAfterGC(12, NEW_SPACE)->requested());
   CHECK_EQ(NEW_SPACE, Failure::RetryAfterGC(12, NEW_SPACE)->allocation_space());
-  CHECK_EQ(OLD_SPACE, Failure::RetryAfterGC(12, OLD_SPACE)->allocation_space());
+  CHECK_EQ(OLD_POINTER_SPACE,
+           Failure::RetryAfterGC(12, OLD_POINTER_SPACE)->allocation_space());
   CHECK(Failure::Exception()->IsFailure());
   CHECK(Smi::FromInt(Smi::kMinValue)->IsSmi());
   CHECK(Smi::FromInt(Smi::kMaxValue)->IsSmi());
@@ -353,7 +354,7 @@ TEST(WeakGlobalHandlesMark) {
   Handle<Object> h1 = GlobalHandles::Create(i);
   Handle<Object> h2 = GlobalHandles::Create(u);
 
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
   CHECK(Heap::CollectGarbage(0, NEW_SPACE));
   // Make sure the object is promoted.
 
@@ -363,7 +364,7 @@ TEST(WeakGlobalHandlesMark) {
   CHECK(!GlobalHandles::IsNearDeath(h1.location()));
   CHECK(!GlobalHandles::IsNearDeath(h2.location()));
 
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   CHECK((*h1)->IsString());
 
@@ -400,7 +401,7 @@ TEST(DeleteWeakGlobalHandle) {
   CHECK(!WeakPointerCleared);
 
   // Mark-compact treats weak reference properly.
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   CHECK(WeakPointerCleared);
 }
@@ -751,11 +752,11 @@ TEST(Iteration) {
   Handle<Object> objs[objs_count];
   int next_objs_index = 0;
 
-  // Allocate a JS array to OLD_SPACE and NEW_SPACE
+  // Allocate a JS array to OLD_POINTER_SPACE and NEW_SPACE
   objs[next_objs_index++] = Factory::NewJSArray(10);
   objs[next_objs_index++] = Factory::NewJSArray(10, TENURED);
 
-  // Allocate a small string to CODE_SPACE and NEW_SPACE
+  // Allocate a small string to OLD_DATA_SPACE and NEW_SPACE
   objs[next_objs_index++] =
       Factory::NewStringFromAscii(CStrVector("abcdefghij"));
   objs[next_objs_index++] =
diff --git a/test/cctest/test-lock.cc b/test/cctest/test-lock.cc
index bd8f7594beb5..37e385352e3e 100644
--- a/test/cctest/test-lock.cc
+++ b/test/cctest/test-lock.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 //
 // Tests of the TokenLock class from lock.h
 
diff --git a/test/cctest/test-mark-compact.cc b/test/cctest/test-mark-compact.cc
index 70bcf4c4aa86..5d488df73e89 100644
--- a/test/cctest/test-mark-compact.cc
+++ b/test/cctest/test-mark-compact.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -78,12 +78,12 @@ TEST(MarkingStack) {
 TEST(Promotion) {
   // Test the situation that some objects in new space are promoted to the
   // old space
+  if (Snapshot::IsEnabled()) return;
 
   // Ensure that we get a compacting collection so that objects are promoted
   // from new space.
   FLAG_gc_global = true;
   FLAG_always_compact = true;
-  Snapshot::DisableInternal();
   Heap::ConfigureHeap(2*256*KB, 4*MB);
 
   InitializeVM();
@@ -102,15 +102,15 @@ TEST(Promotion) {
   CHECK(Heap::InSpace(*array, NEW_SPACE));
 
   // Call the m-c collector, so array becomes an old object.
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // Array now sits in the old space
-  CHECK(Heap::InSpace(*array, OLD_SPACE));
+  CHECK(Heap::InSpace(*array, OLD_POINTER_SPACE));
 }
 
 
 TEST(NoPromotion) {
-  Snapshot::DisableInternal();
+  if (Snapshot::IsEnabled()) return;
   Heap::ConfigureHeap(2*256*KB, 4*MB);
 
   // Test the situation that some objects in new space are promoted to
@@ -120,7 +120,7 @@ TEST(NoPromotion) {
   v8::HandleScope sc;
 
   // Do a mark compact GC to shrink the heap.
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // Allocate a big Fixed array in the new space.
   int size = (Heap::MaxHeapObjectSize() - Array::kHeaderSize) / kPointerSize;
@@ -142,7 +142,7 @@ TEST(NoPromotion) {
   }
 
   // Call mark compact GC, and it should pass.
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // array should not be promoted because the old space is full.
   CHECK(Heap::InSpace(*array, NEW_SPACE));
@@ -154,7 +154,7 @@ TEST(MarkCompactCollector) {
 
   v8::HandleScope sc;
   // call mark-compact when heap is empty
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // keep allocating garbage in new space until it fails
   const int ARRAY_SIZE = 100;
@@ -190,7 +190,7 @@ TEST(MarkCompactCollector) {
   Top::context()->global()->SetProperty(func_name, function, NONE);
 
   JSObject* obj = JSObject::cast(Heap::AllocateJSObject(function));
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   func_name = String::cast(Heap::LookupAsciiSymbol("theFunction"));
   CHECK(Top::context()->global()->HasLocalProperty(func_name));
@@ -204,7 +204,7 @@ TEST(MarkCompactCollector) {
   String* prop_name = String::cast(Heap::LookupAsciiSymbol("theSlot"));
   obj->SetProperty(prop_name, Smi::FromInt(23), NONE);
 
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   obj_name = String::cast(Heap::LookupAsciiSymbol("theObject"));
   CHECK(Top::context()->global()->HasLocalProperty(obj_name));
@@ -242,7 +242,7 @@ TEST(GCCallback) {
   CHECK_EQ(0, gc_starts);
   CHECK_EQ(gc_ends, gc_starts);
 
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
   CHECK_EQ(1, gc_starts);
   CHECK_EQ(gc_ends, gc_starts);
 }
@@ -292,7 +292,7 @@ TEST(ObjectGroups) {
   GlobalHandles::AddToGroup(reinterpret_cast<void*>(2), g2s1.location());
   GlobalHandles::AddToGroup(reinterpret_cast<void*>(2), g2s2.location());
   // Do a full GC
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // All object should be alive.
   CHECK_EQ(0, NumberOfWeakCalls);
@@ -308,7 +308,7 @@ TEST(ObjectGroups) {
   GlobalHandles::AddToGroup(reinterpret_cast<void*>(2), g2s1.location());
   GlobalHandles::AddToGroup(reinterpret_cast<void*>(2), g2s2.location());
 
-  CHECK(Heap::CollectGarbage(0, OLD_SPACE));
+  CHECK(Heap::CollectGarbage(0, OLD_POINTER_SPACE));
 
   // All objects should be gone. 5 global handles in total.
   CHECK_EQ(5, NumberOfWeakCalls);
diff --git a/test/cctest/test-platform-linux.cc b/test/cctest/test-platform-linux.cc
index 66973b35d8a5..e1a00e1060c7 100644
--- a/test/cctest/test-platform-linux.cc
+++ b/test/cctest/test-platform-linux.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 //
 // Tests of the TokenLock class from lock.h
 
diff --git a/test/cctest/test-platform-macos.cc b/test/cctest/test-platform-macos.cc
index 2ac3a4265fae..d80fa5452f15 100644
--- a/test/cctest/test-platform-macos.cc
+++ b/test/cctest/test-platform-macos.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 //
 // Tests of the TokenLock class from lock.h
 
diff --git a/test/cctest/test-platform-nullos.cc b/test/cctest/test-platform-nullos.cc
index 2e91ec0568ce..c0d6ae55eb30 100644
--- a/test/cctest/test-platform-nullos.cc
+++ b/test/cctest/test-platform-nullos.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 //
 // Tests of the TokenLock class from lock.h
 
diff --git a/test/cctest/test-platform-win32.cc b/test/cctest/test-platform-win32.cc
index 9f83ce2926a6..a5a6dd58ac50 100644
--- a/test/cctest/test-platform-win32.cc
+++ b/test/cctest/test-platform-win32.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 //
 // Tests of the TokenLock class from lock.h
 
diff --git a/test/cctest/test-serialize.cc b/test/cctest/test-serialize.cc
index 24fac37da4c1..3072664812e1 100644
--- a/test/cctest/test-serialize.cc
+++ b/test/cctest/test-serialize.cc
@@ -1,4 +1,4 @@
-// Copyright 2007-2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
@@ -191,14 +191,14 @@ TEST(SerializeInternal) {
 // bootstrapped heap.
 // (Smoke test.)
 TEST(Serialize) {
-  Snapshot::DisableInternal();
+  if (Snapshot::IsEnabled()) return;
   Serialize();
 }
 
 
 // Test that the heap isn't destroyed after a serialization.
 TEST(SerializeNondestructive) {
-  Snapshot::DisableInternal();
+  if (Snapshot::IsEnabled()) return;
   StatsTable::SetCounterFunction(counter_function);
   v8::HandleScope scope;
   v8::Persistent<v8::Context> env = v8::Context::New();
diff --git a/test/cctest/test-spaces.cc b/test/cctest/test-spaces.cc
index 4bd7c29fb4ae..98bae697603a 100644
--- a/test/cctest/test-spaces.cc
+++ b/test/cctest/test-spaces.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
@@ -101,7 +101,7 @@ TEST(MemoryAllocator) {
   CHECK(Heap::ConfigureHeapDefault());
   CHECK(MemoryAllocator::Setup(Heap::MaxCapacity()));
 
-  OldSpace faked_space(Heap::MaxCapacity(), OLD_SPACE, false);
+  OldSpace faked_space(Heap::MaxCapacity(), OLD_POINTER_SPACE, NOT_EXECUTABLE);
   int total_pages = 0;
   int requested = 2;
   int allocated;
@@ -159,8 +159,7 @@ TEST(NewSpace) {
 
   NewSpace* s = new NewSpace(Heap::InitialSemiSpaceSize(),
                              Heap::SemiSpaceSize(),
-                             NEW_SPACE,
-                             false);
+                             NEW_SPACE);
   CHECK(s != NULL);
 
   void* chunk =
@@ -187,7 +186,9 @@ TEST(OldSpace) {
   CHECK(Heap::ConfigureHeapDefault());
   CHECK(MemoryAllocator::Setup(Heap::MaxCapacity()));
 
-  OldSpace* s = new OldSpace(Heap::OldGenerationSize(), OLD_SPACE, false);
+  OldSpace* s = new OldSpace(Heap::OldGenerationSize(),
+                             OLD_POINTER_SPACE,
+                             NOT_EXECUTABLE);
   CHECK(s != NULL);
 
   void* chunk =
@@ -213,7 +214,7 @@ TEST(LargeObjectSpace) {
   CHECK(Heap::ConfigureHeapDefault());
   MemoryAllocator::Setup(Heap::MaxCapacity());
 
-  LargeObjectSpace* lo = new LargeObjectSpace(LO_SPACE, false);
+  LargeObjectSpace* lo = new LargeObjectSpace(LO_SPACE);
   CHECK(lo != NULL);
 
   CHECK(lo->Setup());
diff --git a/test/cctest/test-strings.cc b/test/cctest/test-strings.cc
index 46c0536d578c..4484dd5c1df1 100644
--- a/test/cctest/test-strings.cc
+++ b/test/cctest/test-strings.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google, Inc. All Rights Reserved.
+// Copyright 2006-2008 the V8 project authors. All rights reserved.
 
 // Check that we can traverse very deep stacks of ConsStrings using
 // StringInputBuffer.  Check that Get(int) works on very deep stacks
@@ -333,3 +333,44 @@ TEST(DeepAscii) {
     TraverseFirst(flat_string, string, DEEP_ASCII_DEPTH);
   }
 }
+
+
+TEST(Utf8Conversion) {
+  // Smoke test for converting strings to utf-8.
+  InitializeVM();
+  v8::HandleScope handle_scope;
+  // A simple ascii string
+  const char* ascii_string = "abcdef12345";
+  int len = v8::String::New(ascii_string, strlen(ascii_string))->Utf8Length();
+  CHECK_EQ(strlen(ascii_string), len);
+  // A mixed ascii and non-ascii string
+  // U+02E4 -> CB A4
+  // U+0064 -> 64
+  // U+12E4 -> E1 8B A4
+  // U+0030 -> 30
+  // U+3045 -> E3 81 85
+  const uint16_t mixed_string[] = {0x02E4, 0x0064, 0x12E4, 0x0030, 0x3045};
+  // The characters we expect to be output
+  const unsigned char as_utf8[11] = {0xCB, 0xA4, 0x64, 0xE1, 0x8B, 0xA4, 0x30,
+      0xE3, 0x81, 0x85, 0x00};
+  // The number of bytes expected to be written for each length
+  const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11};
+  v8::Handle<v8::String> mixed = v8::String::New(mixed_string, 5);
+  CHECK_EQ(10, mixed->Utf8Length());
+  // Try encoding the string with all capacities
+  char buffer[11];
+  const char kNoChar = static_cast<char>(-1);
+  for (int i = 0; i <= 11; i++) {
+    // Clear the buffer before reusing it
+    for (int j = 0; j < 11; j++)
+      buffer[j] = kNoChar;
+    int written = mixed->WriteUtf8(buffer, i);
+    CHECK_EQ(lengths[i], written);
+    // Check that the contents are correct
+    for (int j = 0; j < lengths[i]; j++)
+      CHECK_EQ(as_utf8[j], static_cast<unsigned char>(buffer[j]));
+    // Check that the rest of the buffer hasn't been touched
+    for (int j = lengths[i]; j < 11; j++)
+      CHECK_EQ(kNoChar, buffer[j]);
+  }
+}
diff --git a/test/cctest/test-utils.cc b/test/cctest/test-utils.cc
index bb3b33b78088..8f06f0f4a5f0 100644
--- a/test/cctest/test-utils.cc
+++ b/test/cctest/test-utils.cc
@@ -1,4 +1,4 @@
-// Copyright 2006-2008 Google Inc. All Rights Reserved.
+// Copyright 2006-2008 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:
diff --git a/test/cctest/testcfg.py b/test/cctest/testcfg.py
index 2002c62a8397..08226aaebc93 100644
--- a/test/cctest/testcfg.py
+++ b/test/cctest/testcfg.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/test/mjsunit/apply.js b/test/mjsunit/apply.js
index fcdaff5ccfd4..1d9dde9b11e1 100644
--- a/test/mjsunit/apply.js
+++ b/test/mjsunit/apply.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/arguments-call-apply.js b/test/mjsunit/arguments-call-apply.js
index a7b434a6e3fd..a5cadf557b3d 100644
--- a/test/mjsunit/arguments-call-apply.js
+++ b/test/mjsunit/arguments-call-apply.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/arguments-enum.js b/test/mjsunit/arguments-enum.js
index 8fb41cc6c584..f76240ff1b4b 100644
--- a/test/mjsunit/arguments-enum.js
+++ b/test/mjsunit/arguments-enum.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/arguments-indirect.js b/test/mjsunit/arguments-indirect.js
index 8e8580706cb2..2d37027f4165 100644
--- a/test/mjsunit/arguments-indirect.js
+++ b/test/mjsunit/arguments-indirect.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/arguments-opt.js b/test/mjsunit/arguments-opt.js
index 1b687b921717..c74fc75a2eb6 100644
--- a/test/mjsunit/arguments-opt.js
+++ b/test/mjsunit/arguments-opt.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/arguments.js b/test/mjsunit/arguments.js
index dd80d200c47d..030273904cc5 100644
--- a/test/mjsunit/arguments.js
+++ b/test/mjsunit/arguments.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-concat.js b/test/mjsunit/array-concat.js
index 05238077517d..bb8c5707752f 100644
--- a/test/mjsunit/array-concat.js
+++ b/test/mjsunit/array-concat.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-functions-prototype.js b/test/mjsunit/array-functions-prototype.js
index 5b2a9cbe30a7..ea0dc61ef7c7 100644
--- a/test/mjsunit/array-functions-prototype.js
+++ b/test/mjsunit/array-functions-prototype.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-indexing.js b/test/mjsunit/array-indexing.js
index 910cf1c84689..2322c5457bcf 100644
--- a/test/mjsunit/array-indexing.js
+++ b/test/mjsunit/array-indexing.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-iteration.js b/test/mjsunit/array-iteration.js
index 9fb72b807f66..f11b51cb8ff1 100644
--- a/test/mjsunit/array-iteration.js
+++ b/test/mjsunit/array-iteration.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-join.js b/test/mjsunit/array-join.js
index c979a63f9cb4..c66e4626e7ca 100644
--- a/test/mjsunit/array-join.js
+++ b/test/mjsunit/array-join.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-length.js b/test/mjsunit/array-length.js
index 1d9819328c26..9731e7a3ed3c 100644
--- a/test/mjsunit/array-length.js
+++ b/test/mjsunit/array-length.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-sort.js b/test/mjsunit/array-sort.js
index ca49b8c93c93..398b7217b6bb 100644
--- a/test/mjsunit/array-sort.js
+++ b/test/mjsunit/array-sort.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -30,13 +30,29 @@
 // Test counter-intuitive default number sorting.
 function TestNumberSort() {
   var a = [ 200, 45, 7 ];
-  // Default sort calls toString on each element and orders
+
+  // Default sort converts each element to string and orders
   // lexicographically.
   a.sort();
   assertArrayEquals([ 200, 45, 7 ], a);
   // Sort numbers by value using a compare functions.
   a.sort(function(x, y) { return x - y; });
   assertArrayEquals([ 7, 45, 200 ], a);
+
+  // Default sort on negative numbers.
+  a = [-12345,-123,-1234,-123456];
+  a.sort();
+  assertArrayEquals([-123,-1234,-12345,-123456], a);
+
+  // Default sort on negative and non-negative numbers.
+  a = [123456,0,-12345,-123,123,1234,-1234,0,12345,-123456];
+  a.sort();
+  assertArrayEquals([-123,-1234,-12345,-123456,0,0,123,1234,12345,123456], a);
+
+  // Default sort on Smis and non-Smis.
+  a = [1000000000, 10000000000, 1000000001, -1000000000, -10000000000, -1000000001];
+  a.sort();
+  assertArrayEquals([-1000000000, -10000000000, -1000000001, 1000000000, 10000000000, 1000000001], a);
 }
 
 TestNumberSort();
diff --git a/test/mjsunit/array-splice-webkit.js b/test/mjsunit/array-splice-webkit.js
index e92b3e66a341..113a56a6ed68 100644
--- a/test/mjsunit/array-splice-webkit.js
+++ b/test/mjsunit/array-splice-webkit.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array-splice.js b/test/mjsunit/array-splice.js
index 0e7b054da35a..b5e85c6e1380 100644
--- a/test/mjsunit/array-splice.js
+++ b/test/mjsunit/array-splice.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/array_length.js b/test/mjsunit/array_length.js
index c1f11a2a9e34..11808afaffdc 100644
--- a/test/mjsunit/array_length.js
+++ b/test/mjsunit/array_length.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/ascii-regexp-subject.js b/test/mjsunit/ascii-regexp-subject.js
index a2dcc23a3482..01d0697aeb3d 100644
--- a/test/mjsunit/ascii-regexp-subject.js
+++ b/test/mjsunit/ascii-regexp-subject.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/binary-operation-overwrite.js b/test/mjsunit/binary-operation-overwrite.js
index b7c8b59886e6..8d217c580605 100644
--- a/test/mjsunit/binary-operation-overwrite.js
+++ b/test/mjsunit/binary-operation-overwrite.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/body-not-visible.js b/test/mjsunit/body-not-visible.js
index 83a10dcb9a36..c681ab3dd985 100644
--- a/test/mjsunit/body-not-visible.js
+++ b/test/mjsunit/body-not-visible.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/bugs/bug-1231206.js b/test/mjsunit/bugs/bug-1231206.js
index 3b6cb60d6663..04b296b9bf36 100644
--- a/test/mjsunit/bugs/bug-1231206.js
+++ b/test/mjsunit/bugs/bug-1231206.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/bugs/bug-1344252.js b/test/mjsunit/bugs/bug-1344252.js
index 436ece9c470a..1723834c09ab 100644
--- a/test/mjsunit/bugs/bug-1344252.js
+++ b/test/mjsunit/bugs/bug-1344252.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/bugs/bug-900066.js b/test/mjsunit/bugs/bug-900066.js
index b0d0db8cfe08..3b7cc3f2c7db 100644
--- a/test/mjsunit/bugs/bug-900066.js
+++ b/test/mjsunit/bugs/bug-900066.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/bugs/bug-941049.js b/test/mjsunit/bugs/bug-941049.js
index 9a6fe6dbed22..f68c37a69fd3 100644
--- a/test/mjsunit/bugs/bug-941049.js
+++ b/test/mjsunit/bugs/bug-941049.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/call-non-function-call.js b/test/mjsunit/call-non-function-call.js
index 81f858d927bc..6088fc35969c 100644
--- a/test/mjsunit/call-non-function-call.js
+++ b/test/mjsunit/call-non-function-call.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/call-non-function.js b/test/mjsunit/call-non-function.js
index b001d5ebabc5..8ed5ccb2013f 100644
--- a/test/mjsunit/call-non-function.js
+++ b/test/mjsunit/call-non-function.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/call.js b/test/mjsunit/call.js
index 27bb6f05b2c6..b873d7d12dd4 100644
--- a/test/mjsunit/call.js
+++ b/test/mjsunit/call.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/char-escape.js b/test/mjsunit/char-escape.js
index f4f580f7dca6..a1b342977ede 100644
--- a/test/mjsunit/char-escape.js
+++ b/test/mjsunit/char-escape.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/class-of-builtins.js b/test/mjsunit/class-of-builtins.js
index c3f894dc78e0..40c958c62420 100644
--- a/test/mjsunit/class-of-builtins.js
+++ b/test/mjsunit/class-of-builtins.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/closure.js b/test/mjsunit/closure.js
index 9ef13a98707f..b1460d39e6b5 100644
--- a/test/mjsunit/closure.js
+++ b/test/mjsunit/closure.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/compare-nan.js b/test/mjsunit/compare-nan.js
index de6c7ad796f8..29818c83ceba 100644
--- a/test/mjsunit/compare-nan.js
+++ b/test/mjsunit/compare-nan.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/const-redecl.js b/test/mjsunit/const-redecl.js
index 6fce6ca08145..26d765b97a31 100644
--- a/test/mjsunit/const-redecl.js
+++ b/test/mjsunit/const-redecl.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/const.js b/test/mjsunit/const.js
index 0d470a257541..5ad0c9ced82b 100644
--- a/test/mjsunit/const.js
+++ b/test/mjsunit/const.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/context-variable-assignments.js b/test/mjsunit/context-variable-assignments.js
index 7b3b1ad9c858..930b969609b5 100644
--- a/test/mjsunit/context-variable-assignments.js
+++ b/test/mjsunit/context-variable-assignments.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/cyclic-array-to-string.js b/test/mjsunit/cyclic-array-to-string.js
index d2018f871476..0a2d6e379ec6 100644
--- a/test/mjsunit/cyclic-array-to-string.js
+++ b/test/mjsunit/cyclic-array-to-string.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/date-parse.js b/test/mjsunit/date-parse.js
index 0430a26bd1d9..1e09db5bc069 100644
--- a/test/mjsunit/date-parse.js
+++ b/test/mjsunit/date-parse.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/date.js b/test/mjsunit/date.js
index e04c6ec0ed13..342ace77826e 100644
--- a/test/mjsunit/date.js
+++ b/test/mjsunit/date.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-backtrace-text.js b/test/mjsunit/debug-backtrace-text.js
index 20607d813b3a..d1acdabac277 100644
--- a/test/mjsunit/debug-backtrace-text.js
+++ b/test/mjsunit/debug-backtrace-text.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-backtrace.js b/test/mjsunit/debug-backtrace.js
index 652193cb7f3d..91e147620997 100644
--- a/test/mjsunit/debug-backtrace.js
+++ b/test/mjsunit/debug-backtrace.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-breakpoints.js b/test/mjsunit/debug-breakpoints.js
index 634a3f11e4c9..c332f1e1d4db 100644
--- a/test/mjsunit/debug-breakpoints.js
+++ b/test/mjsunit/debug-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-changebreakpoint.js b/test/mjsunit/debug-changebreakpoint.js
index ec595714e0ed..e830082d5b91 100644
--- a/test/mjsunit/debug-changebreakpoint.js
+++ b/test/mjsunit/debug-changebreakpoint.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-clearbreakpoint.js b/test/mjsunit/debug-clearbreakpoint.js
index 5409cc96916a..fd8b2cfb6707 100644
--- a/test/mjsunit/debug-clearbreakpoint.js
+++ b/test/mjsunit/debug-clearbreakpoint.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-conditional-breakpoints.js b/test/mjsunit/debug-conditional-breakpoints.js
index 0b5aec2c983d..b2be625a6c05 100644
--- a/test/mjsunit/debug-conditional-breakpoints.js
+++ b/test/mjsunit/debug-conditional-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-constructed-by.js b/test/mjsunit/debug-constructed-by.js
index d02dc61f9703..c904e25955ca 100644
--- a/test/mjsunit/debug-constructed-by.js
+++ b/test/mjsunit/debug-constructed-by.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-constructor.js b/test/mjsunit/debug-constructor.js
index b3c8ebf7d647..12520f4c5ed3 100644
--- a/test/mjsunit/debug-constructor.js
+++ b/test/mjsunit/debug-constructor.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-continue.js b/test/mjsunit/debug-continue.js
index 8d764e826187..e01885c09f01 100644
--- a/test/mjsunit/debug-continue.js
+++ b/test/mjsunit/debug-continue.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-enable-disable-breakpoints.js b/test/mjsunit/debug-enable-disable-breakpoints.js
index 8cd59ef47aa5..02bfc9e94687 100644
--- a/test/mjsunit/debug-enable-disable-breakpoints.js
+++ b/test/mjsunit/debug-enable-disable-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-evaluate-arguments.js b/test/mjsunit/debug-evaluate-arguments.js
index 9ceb9187878f..730e9ca6fb03 100644
--- a/test/mjsunit/debug-evaluate-arguments.js
+++ b/test/mjsunit/debug-evaluate-arguments.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-evaluate-locals.js b/test/mjsunit/debug-evaluate-locals.js
index 2c5816ade6b5..97b9f3901c50 100644
--- a/test/mjsunit/debug-evaluate-locals.js
+++ b/test/mjsunit/debug-evaluate-locals.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-evaluate-recursive.js b/test/mjsunit/debug-evaluate-recursive.js
index 163b68c8e3ee..85631c157ab6 100644
--- a/test/mjsunit/debug-evaluate-recursive.js
+++ b/test/mjsunit/debug-evaluate-recursive.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-evaluate-with.js b/test/mjsunit/debug-evaluate-with.js
index a8482b7f151d..e746ab227f68 100644
--- a/test/mjsunit/debug-evaluate-with.js
+++ b/test/mjsunit/debug-evaluate-with.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-evaluate.js b/test/mjsunit/debug-evaluate.js
index eb8f42440177..9a1e427e8a75 100644
--- a/test/mjsunit/debug-evaluate.js
+++ b/test/mjsunit/debug-evaluate.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-event-listener.js b/test/mjsunit/debug-event-listener.js
index 079f9a3b15a1..2d9d428c6f7d 100644
--- a/test/mjsunit/debug-event-listener.js
+++ b/test/mjsunit/debug-event-listener.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-ignore-breakpoints.js b/test/mjsunit/debug-ignore-breakpoints.js
index 1b55e42ef2e5..e71e4fb16902 100644
--- a/test/mjsunit/debug-ignore-breakpoints.js
+++ b/test/mjsunit/debug-ignore-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-multiple-breakpoints.js b/test/mjsunit/debug-multiple-breakpoints.js
index ff3e53990324..2bdff57e8c4c 100644
--- a/test/mjsunit/debug-multiple-breakpoints.js
+++ b/test/mjsunit/debug-multiple-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-referenced-by.js b/test/mjsunit/debug-referenced-by.js
index 41f651749b78..2b35a9c6a637 100644
--- a/test/mjsunit/debug-referenced-by.js
+++ b/test/mjsunit/debug-referenced-by.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-script-breakpoints.js b/test/mjsunit/debug-script-breakpoints.js
index 958c78b18557..28c8018f4f70 100644
--- a/test/mjsunit/debug-script-breakpoints.js
+++ b/test/mjsunit/debug-script-breakpoints.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-script.js b/test/mjsunit/debug-script.js
index 5a5caf1f5752..55e83c19b65b 100644
--- a/test/mjsunit/debug-script.js
+++ b/test/mjsunit/debug-script.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -53,9 +53,8 @@ for (i = 0; i < scripts.length; i++) {
   }
 }
 
-// This has to be updated if the number of native and extension scripts change.
+// This has to be updated if the number of native scripts change.
 assertEquals(12, native_count);
-assertEquals(1, extension_count);
 assertEquals(2, normal_count);  // This script and mjsunit.js.
 
 // Test a builtins script.
@@ -75,8 +74,10 @@ assertEquals(Debug.ScriptType.Native, debug_delay_script.type);
 
 // Test an extension script.
 var extension_gc_script = Debug.findScript('v8/gc');
-assertEquals('v8/gc', extension_gc_script.name);
-assertEquals(Debug.ScriptType.Extension, extension_gc_script.type);
+if (extension_gc_script) {
+  assertEquals('v8/gc', extension_gc_script.name);
+  assertEquals(Debug.ScriptType.Extension, extension_gc_script.type);
+}
 
 // Test a normal script.
 var mjsunit_js_script = Debug.findScript(/mjsunit.js/);
diff --git a/test/mjsunit/debug-scripts-request.js b/test/mjsunit/debug-scripts-request.js
index b889129f1d4e..0fc857a300fc 100644
--- a/test/mjsunit/debug-scripts-request.js
+++ b/test/mjsunit/debug-scripts-request.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-setbreakpoint.js b/test/mjsunit/debug-setbreakpoint.js
index cdb88702eda4..faf8036973d3 100644
--- a/test/mjsunit/debug-setbreakpoint.js
+++ b/test/mjsunit/debug-setbreakpoint.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-sourceinfo.js b/test/mjsunit/debug-sourceinfo.js
index f360684d40b1..2bad07ac637b 100644
--- a/test/mjsunit/debug-sourceinfo.js
+++ b/test/mjsunit/debug-sourceinfo.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -47,7 +47,7 @@ var comment_lines = 29;
 
 // This magic number is the length or the first line comment (actually number
 // of characters before 'function a(...'.
-var comment_line_length = 1714;
+var comment_line_length = 1726;
 var start_a = 10 + comment_line_length;
 var start_b = 37 + comment_line_length;
 var start_c = 71 + comment_line_length;
diff --git a/test/mjsunit/debug-sourceslice.js b/test/mjsunit/debug-sourceslice.js
index f97b7f8ba718..db9a3e7da82c 100644
--- a/test/mjsunit/debug-sourceslice.js
+++ b/test/mjsunit/debug-sourceslice.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-step-stub-callfunction.js b/test/mjsunit/debug-step-stub-callfunction.js
index 1de2287d2cf3..991c62eb1424 100644
--- a/test/mjsunit/debug-step-stub-callfunction.js
+++ b/test/mjsunit/debug-step-stub-callfunction.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-step.js b/test/mjsunit/debug-step.js
index 0c5492ef9b61..1c0b383201aa 100644
--- a/test/mjsunit/debug-step.js
+++ b/test/mjsunit/debug-step.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/debug-stepin-constructor.js b/test/mjsunit/debug-stepin-constructor.js
index 6f6700c90424..ecd12836304d 100644
--- a/test/mjsunit/debug-stepin-constructor.js
+++ b/test/mjsunit/debug-stepin-constructor.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/declare-locally.js b/test/mjsunit/declare-locally.js
index 5170893aa483..93fcb85f3c51 100644
--- a/test/mjsunit/declare-locally.js
+++ b/test/mjsunit/declare-locally.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/deep-recursion.js b/test/mjsunit/deep-recursion.js
index 8edea79bd5d6..a8093eb6beaa 100644
--- a/test/mjsunit/deep-recursion.js
+++ b/test/mjsunit/deep-recursion.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delay-syntax-error.js b/test/mjsunit/delay-syntax-error.js
index 2cb35fd7d0ed..4fcb1435c574 100644
--- a/test/mjsunit/delay-syntax-error.js
+++ b/test/mjsunit/delay-syntax-error.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delete-global-properties.js b/test/mjsunit/delete-global-properties.js
index 9a70a9201ffe..b3813dc150c3 100644
--- a/test/mjsunit/delete-global-properties.js
+++ b/test/mjsunit/delete-global-properties.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delete-in-eval.js b/test/mjsunit/delete-in-eval.js
index 6d1eb4225803..9278013ead6a 100644
--- a/test/mjsunit/delete-in-eval.js
+++ b/test/mjsunit/delete-in-eval.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delete-in-with.js b/test/mjsunit/delete-in-with.js
index 88d4098dbad3..1efc18de11fd 100644
--- a/test/mjsunit/delete-in-with.js
+++ b/test/mjsunit/delete-in-with.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delete-vars-from-eval.js b/test/mjsunit/delete-vars-from-eval.js
index b5dbfaed2788..a457466d7417 100644
--- a/test/mjsunit/delete-vars-from-eval.js
+++ b/test/mjsunit/delete-vars-from-eval.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/delete.js b/test/mjsunit/delete.js
index 4b88366a6674..6fc15e926d9b 100644
--- a/test/mjsunit/delete.js
+++ b/test/mjsunit/delete.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/do-not-strip-fc.js b/test/mjsunit/do-not-strip-fc.js
index cb8e9aaee30e..1aef28cb62d2 100644
--- a/test/mjsunit/do-not-strip-fc.js
+++ b/test/mjsunit/do-not-strip-fc.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/dont-enum-array-holes.js b/test/mjsunit/dont-enum-array-holes.js
index c39b13e7a1d2..4761dc4ea01b 100644
--- a/test/mjsunit/dont-enum-array-holes.js
+++ b/test/mjsunit/dont-enum-array-holes.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/dont-reinit-global-var.js b/test/mjsunit/dont-reinit-global-var.js
index 8747f4fb332d..1e3c1a01a79a 100644
--- a/test/mjsunit/dont-reinit-global-var.js
+++ b/test/mjsunit/dont-reinit-global-var.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/double-equals.js b/test/mjsunit/double-equals.js
index d6dd5a8dd0b6..a68d7eaf9835 100644
--- a/test/mjsunit/double-equals.js
+++ b/test/mjsunit/double-equals.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/dtoa.js b/test/mjsunit/dtoa.js
index b73d670d37c2..80167b78b199 100644
--- a/test/mjsunit/dtoa.js
+++ b/test/mjsunit/dtoa.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/enumeration_order.js b/test/mjsunit/enumeration_order.js
index db7c88e2b7de..699a636cc997 100644
--- a/test/mjsunit/enumeration_order.js
+++ b/test/mjsunit/enumeration_order.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/escape.js b/test/mjsunit/escape.js
index 3796f7cccde2..5732ce3ae06e 100644
--- a/test/mjsunit/escape.js
+++ b/test/mjsunit/escape.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/eval-typeof-non-existing.js b/test/mjsunit/eval-typeof-non-existing.js
index 5dfafd6b4b45..3513767db797 100644
--- a/test/mjsunit/eval-typeof-non-existing.js
+++ b/test/mjsunit/eval-typeof-non-existing.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/execScript-case-insensitive.js b/test/mjsunit/execScript-case-insensitive.js
index 88fd83fd5951..468d65747eaf 100644
--- a/test/mjsunit/execScript-case-insensitive.js
+++ b/test/mjsunit/execScript-case-insensitive.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/extra-arguments.js b/test/mjsunit/extra-arguments.js
index e24f63c471e7..186277a006f6 100644
--- a/test/mjsunit/extra-arguments.js
+++ b/test/mjsunit/extra-arguments.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/extra-commas.js b/test/mjsunit/extra-commas.js
index b540e966c841..6fed04c0de08 100644
--- a/test/mjsunit/extra-commas.js
+++ b/test/mjsunit/extra-commas.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/for-in-null-or-undefined.js b/test/mjsunit/for-in-null-or-undefined.js
index 7ffbd57ce21d..b12d1b06bd94 100644
--- a/test/mjsunit/for-in-null-or-undefined.js
+++ b/test/mjsunit/for-in-null-or-undefined.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/for-in-special-cases.js b/test/mjsunit/for-in-special-cases.js
index d4e27b32ea34..3c54256e0d4b 100644
--- a/test/mjsunit/for-in-special-cases.js
+++ b/test/mjsunit/for-in-special-cases.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/for-in.js b/test/mjsunit/for-in.js
index b8faeef0bd7e..dfe721dbee1c 100644
--- a/test/mjsunit/for-in.js
+++ b/test/mjsunit/for-in.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -67,3 +67,20 @@ assertEquals(3, props(a).length);
 
 for (var hest = 'hest' in {}) { }
 assertEquals('hest', hest);
+
+var result = '';
+for (var p in {a : [0], b : 1}) { result += p; }
+assertEquals('ab', result);
+
+var result = '';
+for (var p in {a : {v:1}, b : 1}) { result += p; }
+assertEquals('ab', result);
+
+var result = '';
+for (var p in { get a() {}, b : 1}) { result += p; }
+assertEquals('ab', result);
+
+var result = '';
+for (var p in { get a() {}, set a(x) {}, b : 1}) { result += p; }
+assertEquals('ab', result);
+
diff --git a/test/mjsunit/fun-as-prototype.js b/test/mjsunit/fun-as-prototype.js
index da23bf5d49cf..fbe995a766fc 100644
--- a/test/mjsunit/fun-as-prototype.js
+++ b/test/mjsunit/fun-as-prototype.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/fun_name.js b/test/mjsunit/fun_name.js
index 79ab0c87893f..676daaa1337d 100644
--- a/test/mjsunit/fun_name.js
+++ b/test/mjsunit/fun_name.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function-arguments-null.js b/test/mjsunit/function-arguments-null.js
index f092fdcebad7..21e542fc81e7 100644
--- a/test/mjsunit/function-arguments-null.js
+++ b/test/mjsunit/function-arguments-null.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function-caller.js b/test/mjsunit/function-caller.js
index a2fba03970e2..f7493467a5a0 100644
--- a/test/mjsunit/function-caller.js
+++ b/test/mjsunit/function-caller.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function-property.js b/test/mjsunit/function-property.js
index e34fd56c2949..a657f649c833 100644
--- a/test/mjsunit/function-property.js
+++ b/test/mjsunit/function-property.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function-prototype.js b/test/mjsunit/function-prototype.js
index 313167261839..371311e49ae1 100644
--- a/test/mjsunit/function-prototype.js
+++ b/test/mjsunit/function-prototype.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function-source.js b/test/mjsunit/function-source.js
index ddb53b443bf0..75257756d686 100644
--- a/test/mjsunit/function-source.js
+++ b/test/mjsunit/function-source.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/function.js b/test/mjsunit/function.js
index 265c323f3396..6c80fa841752 100644
--- a/test/mjsunit/function.js
+++ b/test/mjsunit/function.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/fuzz-accessors.js b/test/mjsunit/fuzz-accessors.js
index 091d63f77aa2..f3602cca0923 100644
--- a/test/mjsunit/fuzz-accessors.js
+++ b/test/mjsunit/fuzz-accessors.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/fuzz-natives.js b/test/mjsunit/fuzz-natives.js
index f5cdcc19870d..fbebfb9ed4fa 100644
--- a/test/mjsunit/fuzz-natives.js
+++ b/test/mjsunit/fuzz-natives.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/getter-in-value-prototype.js b/test/mjsunit/getter-in-value-prototype.js
index 63e296c04578..b55320ac5b9e 100644
--- a/test/mjsunit/getter-in-value-prototype.js
+++ b/test/mjsunit/getter-in-value-prototype.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/global-const-var-conflicts.js b/test/mjsunit/global-const-var-conflicts.js
index 99a7951d1680..d38d0ee8134f 100644
--- a/test/mjsunit/global-const-var-conflicts.js
+++ b/test/mjsunit/global-const-var-conflicts.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/global-vars-eval.js b/test/mjsunit/global-vars-eval.js
index e90ea4f651fa..900f7be727a5 100644
--- a/test/mjsunit/global-vars-eval.js
+++ b/test/mjsunit/global-vars-eval.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/global-vars-with.js b/test/mjsunit/global-vars-with.js
index 4a46dccbdee9..05ca6b6bb3ed 100644
--- a/test/mjsunit/global-vars-with.js
+++ b/test/mjsunit/global-vars-with.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/greedy.js b/test/mjsunit/greedy.js
index 2ebfc66819cf..d357f0cad373 100644
--- a/test/mjsunit/greedy.js
+++ b/test/mjsunit/greedy.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/has-own-property.js b/test/mjsunit/has-own-property.js
index 6b4af92815d9..5ff8db5f7b02 100644
--- a/test/mjsunit/has-own-property.js
+++ b/test/mjsunit/has-own-property.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/html-comments.js b/test/mjsunit/html-comments.js
index d4107bdd7936..f39271aca782 100644
--- a/test/mjsunit/html-comments.js
+++ b/test/mjsunit/html-comments.js
@@ -1,6 +1,6 @@
 --> must work at beginning of file!
 
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/html-string-funcs.js b/test/mjsunit/html-string-funcs.js
index 278d184d1130..213b7f341210 100644
--- a/test/mjsunit/html-string-funcs.js
+++ b/test/mjsunit/html-string-funcs.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/if-in-undefined.js b/test/mjsunit/if-in-undefined.js
index f88c1c2af4ee..5bfa42e70895 100644
--- a/test/mjsunit/if-in-undefined.js
+++ b/test/mjsunit/if-in-undefined.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/in.js b/test/mjsunit/in.js
index 06adb718c5bb..23ef65efdba5 100644
--- a/test/mjsunit/in.js
+++ b/test/mjsunit/in.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/instanceof.js b/test/mjsunit/instanceof.js
index aa7b5cf1d692..3fef2e2ddc91 100644
--- a/test/mjsunit/instanceof.js
+++ b/test/mjsunit/instanceof.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/integer-to-string.js b/test/mjsunit/integer-to-string.js
index 4e33ad70fbbe..3076bc41762e 100644
--- a/test/mjsunit/integer-to-string.js
+++ b/test/mjsunit/integer-to-string.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/invalid-lhs.js b/test/mjsunit/invalid-lhs.js
index 97708061b2ff..bbd19f20b2aa 100644
--- a/test/mjsunit/invalid-lhs.js
+++ b/test/mjsunit/invalid-lhs.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/keyed-ic.js b/test/mjsunit/keyed-ic.js
index 59818c77f9db..d37bd034cc20 100644
--- a/test/mjsunit/keyed-ic.js
+++ b/test/mjsunit/keyed-ic.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/large-object-literal.js b/test/mjsunit/large-object-literal.js
index 5f8dbc9495a0..8118afe4c90a 100644
--- a/test/mjsunit/large-object-literal.js
+++ b/test/mjsunit/large-object-literal.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/lazy-load.js b/test/mjsunit/lazy-load.js
index 86490d0ae3f6..c384331c7b8b 100644
--- a/test/mjsunit/lazy-load.js
+++ b/test/mjsunit/lazy-load.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/leakcheck.js b/test/mjsunit/leakcheck.js
index 18b26809361d..7cbb2e5500e4 100644
--- a/test/mjsunit/leakcheck.js
+++ b/test/mjsunit/leakcheck.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/length.js b/test/mjsunit/length.js
index 84996110ff39..3331564b81ac 100644
--- a/test/mjsunit/length.js
+++ b/test/mjsunit/length.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/math-min-max.js b/test/mjsunit/math-min-max.js
index 4333e1226a9f..0ed991203cee 100644
--- a/test/mjsunit/math-min-max.js
+++ b/test/mjsunit/math-min-max.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/megamorphic-callbacks.js b/test/mjsunit/megamorphic-callbacks.js
index 13ffad1de4c7..8829df0f6c94 100644
--- a/test/mjsunit/megamorphic-callbacks.js
+++ b/test/mjsunit/megamorphic-callbacks.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-array.js b/test/mjsunit/mirror-array.js
index 462271157684..25e64a6457eb 100644
--- a/test/mjsunit/mirror-array.js
+++ b/test/mjsunit/mirror-array.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-boolean.js b/test/mjsunit/mirror-boolean.js
index dbe4e10168cc..214704812bbe 100644
--- a/test/mjsunit/mirror-boolean.js
+++ b/test/mjsunit/mirror-boolean.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-date.js b/test/mjsunit/mirror-date.js
index 4d0d39c22c63..e96badcfc355 100644
--- a/test/mjsunit/mirror-date.js
+++ b/test/mjsunit/mirror-date.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-error.js b/test/mjsunit/mirror-error.js
index aeb5cdd3931a..49eaaff7f6ec 100644
--- a/test/mjsunit/mirror-error.js
+++ b/test/mjsunit/mirror-error.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-function.js b/test/mjsunit/mirror-function.js
index 61a15a9bc951..c6e7a4e2e861 100644
--- a/test/mjsunit/mirror-function.js
+++ b/test/mjsunit/mirror-function.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-null.js b/test/mjsunit/mirror-null.js
index 280ed6a8201d..4233efae2c96 100644
--- a/test/mjsunit/mirror-null.js
+++ b/test/mjsunit/mirror-null.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-number.js b/test/mjsunit/mirror-number.js
index abeb6df6b03b..20280c3b36a2 100644
--- a/test/mjsunit/mirror-number.js
+++ b/test/mjsunit/mirror-number.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-object.js b/test/mjsunit/mirror-object.js
index 75962d9e621f..bbaf0443ac6c 100644
--- a/test/mjsunit/mirror-object.js
+++ b/test/mjsunit/mirror-object.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-regexp.js b/test/mjsunit/mirror-regexp.js
index 083394048e2b..443caeb60fa7 100644
--- a/test/mjsunit/mirror-regexp.js
+++ b/test/mjsunit/mirror-regexp.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-string.js b/test/mjsunit/mirror-string.js
index aae2efc7b43a..451f8f13248f 100644
--- a/test/mjsunit/mirror-string.js
+++ b/test/mjsunit/mirror-string.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-undefined.js b/test/mjsunit/mirror-undefined.js
index ddbdb52ff1f5..fc35c8d03046 100644
--- a/test/mjsunit/mirror-undefined.js
+++ b/test/mjsunit/mirror-undefined.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mirror-unresolved-function.js b/test/mjsunit/mirror-unresolved-function.js
index 562ad789a3f6..ab4950894721 100644
--- a/test/mjsunit/mirror-unresolved-function.js
+++ b/test/mjsunit/mirror-unresolved-function.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mjsunit.js b/test/mjsunit/mjsunit.js
index 224889c25b9f..e7b47cd84d7b 100644
--- a/test/mjsunit/mjsunit.js
+++ b/test/mjsunit/mjsunit.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/mjsunit.status b/test/mjsunit/mjsunit.status
index df1a34fee6bc..4289bc4637ad 100644
--- a/test/mjsunit/mjsunit.status
+++ b/test/mjsunit/mjsunit.status
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -38,11 +38,13 @@ fuzz-natives: PASS, SKIP IF $MODE==RELEASE
 
 [ $arch == arm ]
 
-#1020483: Debug tests fail on arm
+# 1020483: Debug tests fail on arm
 debug-constructor: FAIL
 debug-continue: FAIL
 debug-backtrace-text: FAIL
 debug-backtrace: FAIL
+# Passes on ARM simulator, fails on ARM hardware.
+debug-breakpoints: PASS || FAIL
 debug-evaluate-recursive: FAIL
 debug-changebreakpoint: FAIL
 debug-clearbreakpoint: FAIL
@@ -52,7 +54,8 @@ debug-evaluate: FAIL
 debug-event-listener: FAIL
 debug-ignore-breakpoints: FAIL
 debug-multiple-breakpoints: FAIL
-# Bug number 1308895. This passes on the ARM simulator, fails on the ARM Linux machine.
+# Bug number 1308895. This passes on the ARM simulator,
+# fails on the ARM Linux machine.
 debug-script-breakpoints: PASS || FAIL
 debug-setbreakpoint: FAIL
 debug-step-stub-callfunction: FAIL
@@ -60,3 +63,5 @@ debug-stepin-constructor: FAIL
 debug-step: FAIL
 regress/regress-998565: FAIL
 regress/regress-1081309: FAIL
+# Call as function does not always work on ARM port yet.
+number-string-index-call: FAIL
diff --git a/test/mjsunit/mul-exhaustive.js b/test/mjsunit/mul-exhaustive.js
index 1b9a46ed5b73..452f9332c7f3 100644
--- a/test/mjsunit/mul-exhaustive.js
+++ b/test/mjsunit/mul-exhaustive.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/negate-zero.js b/test/mjsunit/negate-zero.js
index b5c81c2d06a9..31d460a2dea8 100644
--- a/test/mjsunit/negate-zero.js
+++ b/test/mjsunit/negate-zero.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/negate.js b/test/mjsunit/negate.js
index b56304e6c342..3bf411156b59 100644
--- a/test/mjsunit/negate.js
+++ b/test/mjsunit/negate.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/nested-repetition-count-overflow.js b/test/mjsunit/nested-repetition-count-overflow.js
index c92fbd84d4f1..8f040c3fb8c3 100644
--- a/test/mjsunit/nested-repetition-count-overflow.js
+++ b/test/mjsunit/nested-repetition-count-overflow.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/new.js b/test/mjsunit/new.js
index 07b1560d59a9..1062628b204f 100644
--- a/test/mjsunit/new.js
+++ b/test/mjsunit/new.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/newline-in-string.js b/test/mjsunit/newline-in-string.js
index 323f26bd1257..8c3ff86402b5 100644
--- a/test/mjsunit/newline-in-string.js
+++ b/test/mjsunit/newline-in-string.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/no-branch-elimination.js b/test/mjsunit/no-branch-elimination.js
index cbf69e086e97..538039b2324c 100644
--- a/test/mjsunit/no-branch-elimination.js
+++ b/test/mjsunit/no-branch-elimination.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/no-octal-constants-above-256.js b/test/mjsunit/no-octal-constants-above-256.js
index cf2b7a0070f1..1525d6ae9984 100644
--- a/test/mjsunit/no-octal-constants-above-256.js
+++ b/test/mjsunit/no-octal-constants-above-256.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/no-semicolon.js b/test/mjsunit/no-semicolon.js
index 1bffe50007b7..fa6ccba89dc9 100644
--- a/test/mjsunit/no-semicolon.js
+++ b/test/mjsunit/no-semicolon.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/non-ascii-replace.js b/test/mjsunit/non-ascii-replace.js
index a478e190cf2d..980741286acc 100644
--- a/test/mjsunit/non-ascii-replace.js
+++ b/test/mjsunit/non-ascii-replace.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/nul-characters.js b/test/mjsunit/nul-characters.js
index 35c7d21b73c0..22da82d2e09b 100644
--- a/test/mjsunit/nul-characters.js
+++ b/test/mjsunit/nul-characters.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/number-limits.js b/test/mjsunit/number-limits.js
index 7b9d0c86009e..1d9a1e558581 100644
--- a/test/mjsunit/number-limits.js
+++ b/test/mjsunit/number-limits.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/number-string-index-call.js b/test/mjsunit/number-string-index-call.js
new file mode 100644
index 000000000000..6f540c008baa
--- /dev/null
+++ b/test/mjsunit/number-string-index-call.js
@@ -0,0 +1,32 @@
+// Copyright 2008 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.
+
+// Flags: --call_regexp
+var callbacks = [ function() {return 'foo'}, "nonobject", /abc/ ];
+assertEquals('foo', callbacks['0']());
+assertThrows("callbacks['1']()");
+assertEquals('abc', callbacks['2']("abcdefg"));
diff --git a/test/mjsunit/number-tostring-small.js b/test/mjsunit/number-tostring-small.js
index b168ac079623..dbd2b59235e7 100644
--- a/test/mjsunit/number-tostring-small.js
+++ b/test/mjsunit/number-tostring-small.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/number-tostring.js b/test/mjsunit/number-tostring.js
index 578198733294..04d027ff57cb 100644
--- a/test/mjsunit/number-tostring.js
+++ b/test/mjsunit/number-tostring.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/obj-construct.js b/test/mjsunit/obj-construct.js
index cf2b47f2519c..98e09b2f9555 100644
--- a/test/mjsunit/obj-construct.js
+++ b/test/mjsunit/obj-construct.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/parse-int-float.js b/test/mjsunit/parse-int-float.js
index f0acbfade711..ad2275e66189 100644
--- a/test/mjsunit/parse-int-float.js
+++ b/test/mjsunit/parse-int-float.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/property-object-key.js b/test/mjsunit/property-object-key.js
index 1bc943457a64..5eb1e1b9ecef 100644
--- a/test/mjsunit/property-object-key.js
+++ b/test/mjsunit/property-object-key.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/proto.js b/test/mjsunit/proto.js
index 904793ededb2..faf98b2251ef 100644
--- a/test/mjsunit/proto.js
+++ b/test/mjsunit/proto.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/prototype.js b/test/mjsunit/prototype.js
index 36aab69f76c7..bfc1a799d4b0 100644
--- a/test/mjsunit/prototype.js
+++ b/test/mjsunit/prototype.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regexp-multiline-stack-trace.js b/test/mjsunit/regexp-multiline-stack-trace.js
index cc960cb17c35..aa2de8875bae 100644
--- a/test/mjsunit/regexp-multiline-stack-trace.js
+++ b/test/mjsunit/regexp-multiline-stack-trace.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regexp-multiline.js b/test/mjsunit/regexp-multiline.js
index b503a0dd7e5c..32edf25e5ee9 100644
--- a/test/mjsunit/regexp-multiline.js
+++ b/test/mjsunit/regexp-multiline.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regexp-standalones.js b/test/mjsunit/regexp-standalones.js
index eb1df1f395d9..4699754b8fa7 100644
--- a/test/mjsunit/regexp-standalones.js
+++ b/test/mjsunit/regexp-standalones.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regexp-static.js b/test/mjsunit/regexp-static.js
index 1976170bbdaf..73940d714d11 100644
--- a/test/mjsunit/regexp-static.js
+++ b/test/mjsunit/regexp-static.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regexp.js b/test/mjsunit/regexp.js
index de37d859555d..00f02e092287 100644
--- a/test/mjsunit/regexp.js
+++ b/test/mjsunit/regexp.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1030466.js b/test/mjsunit/regress/regress-1030466.js
index dabb5f07637f..8427ba028a99 100644
--- a/test/mjsunit/regress/regress-1030466.js
+++ b/test/mjsunit/regress/regress-1030466.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1036894.js b/test/mjsunit/regress/regress-1036894.js
index 6bbdcc2dff42..d89ceda11c0a 100644
--- a/test/mjsunit/regress/regress-1036894.js
+++ b/test/mjsunit/regress/regress-1036894.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1039610.js b/test/mjsunit/regress/regress-1039610.js
index 6ebe08b8e94b..fd5c549c1ca9 100644
--- a/test/mjsunit/regress/regress-1039610.js
+++ b/test/mjsunit/regress/regress-1039610.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1050043.js b/test/mjsunit/regress/regress-1050043.js
index 30e8c4f357b2..e42728fc50f1 100644
--- a/test/mjsunit/regress/regress-1050043.js
+++ b/test/mjsunit/regress/regress-1050043.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1062422.js b/test/mjsunit/regress/regress-1062422.js
index 2d8cdc5734a0..1e2c7988c15e 100644
--- a/test/mjsunit/regress/regress-1062422.js
+++ b/test/mjsunit/regress/regress-1062422.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1066899.js b/test/mjsunit/regress/regress-1066899.js
index 8c8fa0d2f406..37fd554b5481 100644
--- a/test/mjsunit/regress/regress-1066899.js
+++ b/test/mjsunit/regress/regress-1066899.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1081309.js b/test/mjsunit/regress/regress-1081309.js
index daf003b306c2..68710391fe02 100644
--- a/test/mjsunit/regress/regress-1081309.js
+++ b/test/mjsunit/regress/regress-1081309.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1102760.js b/test/mjsunit/regress/regress-1102760.js
index 937beaa045bf..890ecabcaa0b 100644
--- a/test/mjsunit/regress/regress-1102760.js
+++ b/test/mjsunit/regress/regress-1102760.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1110164.js b/test/mjsunit/regress/regress-1110164.js
index c55f3f778845..33f96af3ec24 100644
--- a/test/mjsunit/regress/regress-1110164.js
+++ b/test/mjsunit/regress/regress-1110164.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1112051.js b/test/mjsunit/regress/regress-1112051.js
index e6fc2cb71c89..0af6bb435875 100644
--- a/test/mjsunit/regress/regress-1112051.js
+++ b/test/mjsunit/regress/regress-1112051.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1114040.js b/test/mjsunit/regress/regress-1114040.js
index 52ff938305f0..9d1b320a9a29 100644
--- a/test/mjsunit/regress/regress-1114040.js
+++ b/test/mjsunit/regress/regress-1114040.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1134697.js b/test/mjsunit/regress/regress-1134697.js
index c6a1f93c8e88..3d851ae77511 100644
--- a/test/mjsunit/regress/regress-1134697.js
+++ b/test/mjsunit/regress/regress-1134697.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1170187.js b/test/mjsunit/regress/regress-1170187.js
index 795ad03b2d31..f0471ffd3375 100644
--- a/test/mjsunit/regress/regress-1170187.js
+++ b/test/mjsunit/regress/regress-1170187.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1173979.js b/test/mjsunit/regress/regress-1173979.js
index 2b3147fd96b2..42649d0abf99 100644
--- a/test/mjsunit/regress/regress-1173979.js
+++ b/test/mjsunit/regress/regress-1173979.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1175390.js b/test/mjsunit/regress/regress-1175390.js
index 651ac1efc60b..7b1a7e077ad7 100644
--- a/test/mjsunit/regress/regress-1175390.js
+++ b/test/mjsunit/regress/regress-1175390.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1177518.js b/test/mjsunit/regress/regress-1177518.js
index a393b1118fd4..2ba3c1195283 100644
--- a/test/mjsunit/regress/regress-1177518.js
+++ b/test/mjsunit/regress/regress-1177518.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1177809.js b/test/mjsunit/regress/regress-1177809.js
index 5c217d9dd254..703e60739f55 100644
--- a/test/mjsunit/regress/regress-1177809.js
+++ b/test/mjsunit/regress/regress-1177809.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1178598.js b/test/mjsunit/regress/regress-1178598.js
index f7daf2422ade..9caaec2f013b 100644
--- a/test/mjsunit/regress/regress-1178598.js
+++ b/test/mjsunit/regress/regress-1178598.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1182832.js b/test/mjsunit/regress/regress-1182832.js
index 649651560b84..6c4fcb413e26 100644
--- a/test/mjsunit/regress/regress-1182832.js
+++ b/test/mjsunit/regress/regress-1182832.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1187524.js b/test/mjsunit/regress/regress-1187524.js
index b053111d1c76..2aeb1c51703e 100644
--- a/test/mjsunit/regress/regress-1187524.js
+++ b/test/mjsunit/regress/regress-1187524.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1199401.js b/test/mjsunit/regress/regress-1199401.js
index ff8e206bc265..792faea98232 100644
--- a/test/mjsunit/regress/regress-1199401.js
+++ b/test/mjsunit/regress/regress-1199401.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1199637.js b/test/mjsunit/regress/regress-1199637.js
index 028e108730fe..2c97f9a0c74f 100644
--- a/test/mjsunit/regress/regress-1199637.js
+++ b/test/mjsunit/regress/regress-1199637.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1200351.js b/test/mjsunit/regress/regress-1200351.js
index ac79f68aef50..f752a1e1a401 100644
--- a/test/mjsunit/regress/regress-1200351.js
+++ b/test/mjsunit/regress/regress-1200351.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
@@ -37,1517 +37,1517 @@ new this.constructor(1,2,3,4,5,6);
 
 var x = 0;
 try {
-	eval("SetValueOf(typeof(break.prototype.name), Math.max(typeof(break)))")
+  eval("SetValueOf(typeof(break.prototype.name), Math.max(typeof(break)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Join((void), false.className(), null instanceof continue, return 'a', 0.__defineGetter__(x,function(){native}))")
+  eval("export Join((void), false.className(), null instanceof continue, return 'a', 0.__defineGetter__(x,function(){native}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ void&&null.push(goto NaN) : Math.max(undef).toText }) { {-1/null,1.isNull} }")
+  eval("with ({ void&&null.push(goto NaN) : Math.max(undef).toText }) { {-1/null,1.isNull} }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new break>>>=native.charCodeAt(-1.valueOf())")
+  eval("new break>>>=native.charCodeAt(-1.valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Number(this > native)")
+  eval("new Number(this > native)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {native,0.2}?continue+undef:IsSmi(0.2)")
+  eval("new {native,0.2}?continue+undef:IsSmi(0.2)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = break.toString()&&return continue")
+  eval("const x = break.toString()&&return continue")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (-1==continue.toJSONProtocol, GetFunctionFor(break.call(NaN)), (!new RegExp).prototype.new Object()<<void) { debugger.__defineSetter__(null,function(){continue})>>>=GetFunctionFor(-1) }")
+  eval("for (-1==continue.toJSONProtocol, GetFunctionFor(break.call(NaN)), (!new RegExp).prototype.new Object()<<void) { debugger.__defineSetter__(null,function(){continue})>>>=GetFunctionFor(-1) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (parseFloat(NaN).splice() in null.add(1).className()) { true[0.2]<<x.splice() }")
+  eval("for (parseFloat(NaN).splice() in null.add(1).className()) { true[0.2]<<x.splice() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (debugger.constructor.valueOf()) { this.sort().true.splice() }")
+  eval("let (debugger.constructor.valueOf()) { this.sort().true.splice() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("unescape(break.toObject()).prototype.new RegExp.continue.__lookupGetter__(x.slice(1, NaN)) = typeof(null.push(0.2))")
+  eval("unescape(break.toObject()).prototype.new RegExp.continue.__lookupGetter__(x.slice(1, NaN)) = typeof(null.push(0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Iterator(continue.pop()))")
+  eval("new Date(Iterator(continue.pop()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return new RegExp.shift().concat({debugger,continue}) }; X(return goto 0)")
+  eval("function X(x) { return new RegExp.shift().concat({debugger,continue}) }; X(return goto 0)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(0.add(break)&&x > null)")
+  eval("Instantiate(0.add(break)&&x > null)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ eval(Array(x)) : 1.call('a').superConstructor }) { debugger.lastIndex.toLocaleString() }")
+  eval("with ({ eval(Array(x)) : 1.call('a').superConstructor }) { debugger.lastIndex.toLocaleString() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = return true.__defineGetter__(this,function(){0.2})")
+  eval("x = return true.__defineGetter__(this,function(){0.2})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new typeof(0)&this.lastIndex")
+  eval("x = new typeof(0)&this.lastIndex")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("String(new RegExp.call(1)).prototype.unescape(parseFloat(-1)) = false<<true.x.lastIndexOf(1)")
+  eval("String(new RegExp.call(1)).prototype.unescape(parseFloat(-1)) = false<<true.x.lastIndexOf(1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 1+debugger.valueOf() : continue.join().name() }) { parseInt(true)==undef.sort() }")
+  eval("with ({ 1+debugger.valueOf() : continue.join().name() }) { parseInt(true)==undef.sort() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new RegExp>>0.2.superConstructor.prototype.eval(void).className() = false.join().prototype.name")
+  eval("new RegExp>>0.2.superConstructor.prototype.eval(void).className() = false.join().prototype.name")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export (new Object()?undef:native)")
+  eval("export (new Object()?undef:native)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new null.isNull.slice(x.prototype.value, Iterator(undef))")
+  eval("x = new null.isNull.slice(x.prototype.value, Iterator(undef))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export function () { 0.2 }.unshift()")
+  eval("export function () { 0.2 }.unshift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Math.max(continue.valueOf())")
+  eval("new Math.max(continue.valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = return debugger.toObject()")
+  eval("x = return debugger.toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (-1.length+new Object().prototype.name) { case (debugger.constructor.sort()): IsPrimitive(undef.__defineSetter__(undef,function(){native})); break; }")
+  eval("switch (-1.length+new Object().prototype.name) { case (debugger.constructor.sort()): IsPrimitive(undef.__defineSetter__(undef,function(){native})); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete (!new Object().toLocaleString())")
+  eval("delete (!new Object().toLocaleString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(0<<'a'>>>=new RegExp['a'])")
+  eval("new Date(0<<'a'>>>=new RegExp['a'])")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native {unescape(true),new RegExp.isNull}")
+  eval("native {unescape(true),new RegExp.isNull}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = -1.lastIndexOf(false)?parseFloat(void):Join(null, continue, new Object(), x, break)")
+  eval("const x = -1.lastIndexOf(false)?parseFloat(void):Join(null, continue, new Object(), x, break)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label null/void-break.__lookupGetter__(native)")
+  eval("label null/void-break.__lookupGetter__(native)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(0.2.join().constructor)")
+  eval("new Function(0.2.join().constructor)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label function () { false }.__lookupGetter__(this==1)")
+  eval("label function () { false }.__lookupGetter__(this==1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(-1.prototype.0.2.unshift())")
+  eval("Instantiate(-1.prototype.0.2.unshift())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new return goto -1")
+  eval("const x = new return goto -1")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {Number(debugger)}")
+  eval("new {Number(debugger)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (parseInt(break) instanceof 0.length) { this.(!0.2) }")
+  eval("if (parseInt(break) instanceof 0.length) { this.(!0.2) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(break.superConstructor[throw new false(true)], this.~x)")
+  eval("SetValueOf(break.superConstructor[throw new false(true)], this.~x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(function () { IsSmi(-1) }, unescape(IsPrimitive(void)))")
+  eval("SetValueOf(function () { IsSmi(-1) }, unescape(IsPrimitive(void)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (new RegExp.join().className() in new Object().length()>>true.toObject()) { parseFloat(escape(debugger)) }")
+  eval("for (new RegExp.join().className() in new Object().length()>>true.toObject()) { parseFloat(escape(debugger)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new String(debugger).toJSONProtocol")
+  eval("const x = new String(debugger).toJSONProtocol")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(1.indexOf('a')<<break.__lookupGetter__('a'), new Object().null.prototype.new RegExp.charCodeAt(-1))")
+  eval("SetValueOf(1.indexOf('a')<<break.__lookupGetter__('a'), new Object().null.prototype.new RegExp.charCodeAt(-1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new {parseInt(0)}")
+  eval("const x = new {parseInt(0)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(void.join().add(escape(undef)))")
+  eval("new Date(void.join().add(escape(undef)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native parseFloat(false.charAt(new RegExp))")
+  eval("native parseFloat(false.charAt(new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(~Iterator(void))")
+  eval("new Date(~Iterator(void))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(NaN.shift().toJSONProtocol)")
+  eval("new Function(NaN.shift().toJSONProtocol)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(native-debugger<<continue.slice(x, new RegExp))")
+  eval("new Date(native-debugger<<continue.slice(x, new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = parseFloat(~new Object())")
+  eval("x = parseFloat(~new Object())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (null.size/true.add(void) in 0+continue&true.null) { continue.toObject()/throw new true(debugger) }")
+  eval("for (null.size/true.add(void) in 0+continue&true.null) { continue.toObject()/throw new true(debugger) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (Iterator(native+break) in debugger.superConstructor.constructor) { Math.max(0.add(undef)) }")
+  eval("for (Iterator(native+break) in debugger.superConstructor.constructor) { Math.max(0.add(undef)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {-1.add(native),true.sort()}")
+  eval("new {-1.add(native),true.sort()}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {IsSmi(break),throw new 'a'(null)}")
+  eval("new {IsSmi(break),throw new 'a'(null)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (parseInt(0).length()) { case ('a'.toObject().__defineSetter__(GetFunctionFor(null),function(){(!x)})): IsSmi(void).constructor; break; }")
+  eval("switch (parseInt(0).length()) { case ('a'.toObject().__defineSetter__(GetFunctionFor(null),function(){(!x)})): IsSmi(void).constructor; break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new 0.lastIndexOf(NaN).shift()")
+  eval("x = new 0.lastIndexOf(NaN).shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 0>>>=this.lastIndex : new Object().lastIndexOf(true).toObject() }) { x.lastIndex > 1.__defineSetter__(false,function(){this}) }")
+  eval("with ({ 0>>>=this.lastIndex : new Object().lastIndexOf(true).toObject() }) { x.lastIndex > 1.__defineSetter__(false,function(){this}) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ throw new false(0.2).prototype.name : parseFloat(false)+(!debugger) }) { escape(undef.lastIndex) }")
+  eval("with ({ throw new false(0.2).prototype.name : parseFloat(false)+(!debugger) }) { escape(undef.lastIndex) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Math.pow(0.2).toJSONProtocol.prototype.break.superConstructor.slice(NaN.exec(undef), -1.lastIndexOf(NaN)) = true.splice().length")
+  eval("Math.pow(0.2).toJSONProtocol.prototype.break.superConstructor.slice(NaN.exec(undef), -1.lastIndexOf(NaN)) = true.splice().length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native continue.className().constructor")
+  eval("native continue.className().constructor")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (0.2.isNull&undef.toString()) { continue/void+parseInt(null) }")
+  eval("let (0.2.isNull&undef.toString()) { continue/void+parseInt(null) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new Math.pow(break==this)")
+  eval("const x = new Math.pow(break==this)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(continue.__lookupGetter__(null).constructor, debugger.filter(0.2)>>>=this.'a')")
+  eval("SetValueOf(continue.__lookupGetter__(null).constructor, debugger.filter(0.2)>>>=this.'a')")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 0.2.unshift() > true.size : return Math.max(new RegExp) }) { void.splice().toString() }")
+  eval("with ({ 0.2.unshift() > true.size : return Math.max(new RegExp) }) { void.splice().toString() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new unescape(false).unshift()")
+  eval("new unescape(false).unshift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return this.true?'a'==this:0.2.__lookupGetter__(void) }; X(Iterator(false).length)")
+  eval("function X(x) { return this.true?'a'==this:0.2.__lookupGetter__(void) }; X(Iterator(false).length)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = function () { null }.__defineSetter__(0.charCodeAt(new Object()),function(){null>>>=new Object()})")
+  eval("const x = function () { null }.__defineSetter__(0.charCodeAt(new Object()),function(){null>>>=new Object()})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import goto 'a'.charAt(native.className())")
+  eval("import goto 'a'.charAt(native.className())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import 0.2.isNull.__lookupGetter__(debugger.size)")
+  eval("import 0.2.isNull.__lookupGetter__(debugger.size)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (~new Object().push(Array(null)) in new RegExp>>>=void.prototype.name) { goto break.lastIndex }")
+  eval("for (~new Object().push(Array(null)) in new RegExp>>>=void.prototype.name) { goto break.lastIndex }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete String(x).slice(String('a'), parseFloat(false))")
+  eval("delete String(x).slice(String('a'), parseFloat(false))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new parseInt(continue.__defineGetter__(0.2,function(){1}))")
+  eval("new parseInt(continue.__defineGetter__(0.2,function(){1}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(true.concat(undef)==0.2.new RegExp)")
+  eval("Instantiate(true.concat(undef)==0.2.new RegExp)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return NaN['a']?-1.exec(0):NaN.prototype.this }; X(native.prototype.name.toLocaleString())")
+  eval("function X(x) { return NaN['a']?-1.exec(0):NaN.prototype.this }; X(native.prototype.name.toLocaleString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (debugger==continue.toObject(), Array(NaN.className()), Math.max(new RegExp).prototype.value) { GetFunctionFor('a').prototype.value }")
+  eval("for (debugger==continue.toObject(), Array(NaN.className()), Math.max(new RegExp).prototype.value) { GetFunctionFor('a').prototype.value }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new parseInt(break)==Array(x)")
+  eval("const x = new parseInt(break)==Array(x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (parseInt(0.2.charCodeAt(this)), this.continue.prototype.name, native.superConstructor.superConstructor) { Join(0.__defineGetter__(continue,function(){undef}), {1}, parseFloat(0), undef.__defineSetter__(break,function(){null}), x?-1:-1) }")
+  eval("for (parseInt(0.2.charCodeAt(this)), this.continue.prototype.name, native.superConstructor.superConstructor) { Join(0.__defineGetter__(continue,function(){undef}), {1}, parseFloat(0), undef.__defineSetter__(break,function(){null}), x?-1:-1) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Join(debugger.splice(), parseInt(NaN), new RegExp.pop(), this.false, x.-1)")
+  eval("export Join(debugger.splice(), parseInt(NaN), new RegExp.pop(), this.false, x.-1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = Math.max(native).charCodeAt(continue==break)")
+  eval("x = Math.max(native).charCodeAt(continue==break)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (void==NaN.sort(), new Object()==new RegExp.toObject(), -1/NaN.unshift()) { GetFunctionFor(true).name() }")
+  eval("for (void==NaN.sort(), new Object()==new RegExp.toObject(), -1/NaN.unshift()) { GetFunctionFor(true).name() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for ((!'a'.join()), ~NaN.__defineGetter__(undef,function(){this}), Math.pow(NaN).__lookupGetter__(typeof(false))) { throw new debugger.toObject()(Math.max(-1)) }")
+  eval("for ((!'a'.join()), ~NaN.__defineGetter__(undef,function(){this}), Math.pow(NaN).__lookupGetter__(typeof(false))) { throw new debugger.toObject()(Math.max(-1)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (NaN.shift()&&undef&&continue in throw new x(NaN).prototype.-1&x) { return native.toJSONProtocol }")
+  eval("for (NaN.shift()&&undef&&continue in throw new x(NaN).prototype.-1&x) { return native.toJSONProtocol }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new (0).charAt(this.charCodeAt(new Object()))")
+  eval("x = new (0).charAt(this.charCodeAt(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return x.valueOf().size }; X(0.2.unshift().unshift())")
+  eval("function X(x) { return x.valueOf().size }; X(0.2.unshift().unshift())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (eval(new Object().valueOf())) { break.prototype.name.__defineGetter__(eval(NaN),function(){Math.max(native)}) }")
+  eval("if (eval(new Object().valueOf())) { break.prototype.name.__defineGetter__(eval(NaN),function(){Math.max(native)}) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (Math.pow(1).isNull in Iterator(continue.length())) { Join(true, 0.2, null, x, new Object()).length }")
+  eval("for (Math.pow(1).isNull in Iterator(continue.length())) { Join(true, 0.2, null, x, new Object()).length }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(0>>>=void.unshift(), void.exec('a').undef.length())")
+  eval("SetValueOf(0>>>=void.unshift(), void.exec('a').undef.length())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete throw new this(0.2).pop()")
+  eval("delete throw new this(0.2).pop()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Iterator(unescape(continue))")
+  eval("new Iterator(unescape(continue))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return unescape(goto debugger) }; X(new RegExp.push(break).name())")
+  eval("function X(x) { return unescape(goto debugger) }; X(new RegExp.push(break).name())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = undef/'a'.indexOf(-1.exec(false))")
+  eval("x = undef/'a'.indexOf(-1.exec(false))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (continue.isNull.filter(this.toText), function () { throw new 'a'(0.2) }, native?break:undef.prototype.return continue) { Array(void.toText) }")
+  eval("for (continue.isNull.filter(this.toText), function () { throw new 'a'(0.2) }, native?break:undef.prototype.return continue) { Array(void.toText) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new this.slice(new Object(), 1).isNull")
+  eval("const x = new this.slice(new Object(), 1).isNull")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (0.2.className().call((!debugger)), native.__defineGetter__(0,function(){x}).name(), null.splice().splice()) { NaN.charCodeAt(new Object()) > true.toString() }")
+  eval("for (0.2.className().call((!debugger)), native.__defineGetter__(0,function(){x}).name(), null.splice().splice()) { NaN.charCodeAt(new Object()) > true.toString() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native false.length?new RegExp instanceof this:Array(undef)")
+  eval("native false.length?new RegExp instanceof this:Array(undef)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new ~0.2.call(typeof(false))")
+  eval("new ~0.2.call(typeof(false))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Number(0.2.sort())")
+  eval("new Number(0.2.sort())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new x.join().shift()")
+  eval("new x.join().shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (~new Object().toText) { case (new RegExp.unshift().exec(new RegExp<<debugger)): -1.length.exec(this.isNull); break; }")
+  eval("switch (~new Object().toText) { case (new RegExp.unshift().exec(new RegExp<<debugger)): -1.length.exec(this.isNull); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new parseInt(~true)")
+  eval("new parseInt(~true)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new unescape(debugger.call(null))")
+  eval("new unescape(debugger.call(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new GetFunctionFor(0.2).toObject()")
+  eval("const x = new GetFunctionFor(0.2).toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete IsPrimitive(null.join())")
+  eval("delete IsPrimitive(null.join())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (eval(0.2) instanceof debugger.splice() in null.superConstructor==new Object()&void) { Number(0+x) }")
+  eval("for (eval(0.2) instanceof debugger.splice() in null.superConstructor==new Object()&void) { Number(0+x) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let ('a'-continue?null.length():escape(continue)) { return undef.push(false.shift()) }")
+  eval("let ('a'-continue?null.length():escape(continue)) { return undef.push(false.shift()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (Array(x.length) in 'a'.length().sort()) { goto (new Object()) }")
+  eval("for (Array(x.length) in 'a'.length().sort()) { goto (new Object()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (NaN==true.length) { IsPrimitive(0.2).prototype.value }")
+  eval("let (NaN==true.length) { IsPrimitive(0.2).prototype.value }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(return true&&void, new RegExp.toObject().length())")
+  eval("SetValueOf(return true&&void, new RegExp.toObject().length())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Math.pow(void).length")
+  eval("new Math.pow(void).length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(void.add(continue).charCodeAt(this.toObject()))")
+  eval("new Function(void.add(continue).charCodeAt(this.toObject()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Join(break.toObject(), 0.2.isNull, false.call(0), break.filter(break), 1.length())")
+  eval("export Join(break.toObject(), 0.2.isNull, false.call(0), break.filter(break), 1.length())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (1/NaN.__lookupGetter__(undef.prototype.value)) { escape(eval(this)) }")
+  eval("if (1/NaN.__lookupGetter__(undef.prototype.value)) { escape(eval(this)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(Join(unescape(x), new RegExp.__defineGetter__(debugger,function(){NaN}), 'a'.indexOf(0.2), false.prototype.name, (this)))")
+  eval("new Function(Join(unescape(x), new RegExp.__defineGetter__(debugger,function(){NaN}), 'a'.indexOf(0.2), false.prototype.name, (this)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new Math.pow(native).indexOf(1>>>=-1)")
+  eval("const x = new Math.pow(native).indexOf(1>>>=-1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new RegExp?native:continue.join().prototype.Math.max(x.__defineSetter__(1,function(){continue})) = parseFloat(parseInt(null))")
+  eval("new RegExp?native:continue.join().prototype.Math.max(x.__defineSetter__(1,function(){continue})) = parseFloat(parseInt(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native function () { new RegExp }.new RegExp.pop()")
+  eval("native function () { new RegExp }.new RegExp.pop()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import typeof(new RegExp.valueOf())")
+  eval("import typeof(new RegExp.valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (0.2.size>>NaN-continue) { case ('a'.push(true).indexOf(NaN.lastIndexOf(-1))): {0.2,x}.toObject(); break; }")
+  eval("switch (0.2.size>>NaN-continue) { case ('a'.push(true).indexOf(NaN.lastIndexOf(-1))): {0.2,x}.toObject(); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (IsSmi(new Object())/false.filter('a')) { function () { Iterator(debugger) } }")
+  eval("if (IsSmi(new Object())/false.filter('a')) { function () { Iterator(debugger) } }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = break.lastIndex.size")
+  eval("x = break.lastIndex.size")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(new Object() > 0.length())")
+  eval("new Function(new Object() > 0.length())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native IsPrimitive(continue)==break.charCodeAt(new Object())")
+  eval("native IsPrimitive(continue)==break.charCodeAt(new Object())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new break.true<<'a'-NaN")
+  eval("new break.true<<'a'-NaN")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Number(-1?'a':-1)")
+  eval("new Number(-1?'a':-1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (parseFloat('a'.exec(continue)) in (!new RegExp)&&0.2.toObject()) { {true,x}.add(void.prototype.NaN) }")
+  eval("for (parseFloat('a'.exec(continue)) in (!new RegExp)&&0.2.toObject()) { {true,x}.add(void.prototype.NaN) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (-1.prototype.value.join()) { (!1.prototype.name) }")
+  eval("let (-1.prototype.value.join()) { (!1.prototype.name) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new GetFunctionFor(continue).toJSONProtocol")
+  eval("new GetFunctionFor(continue).toJSONProtocol")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (Math.pow(continue.slice(null, native)), goto (!0), native?1:this.charAt(String(debugger))) { parseFloat(~this) }")
+  eval("for (Math.pow(continue.slice(null, native)), goto (!0), native?1:this.charAt(String(debugger))) { parseFloat(~this) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(debugger.pop().length, new RegExp.isNull.toText)")
+  eval("SetValueOf(debugger.pop().length, new RegExp.isNull.toText)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (typeof(new RegExp.slice(new RegExp, 0)) in native.toLocaleString().lastIndexOf(0.2.length())) { native>>>=new RegExp.length() }")
+  eval("for (typeof(new RegExp.slice(new RegExp, 0)) in native.toLocaleString().lastIndexOf(0.2.length())) { native>>>=new RegExp.length() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native x.join().className()")
+  eval("native x.join().className()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new 0?0:true.toLocaleString()")
+  eval("new 0?0:true.toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = IsPrimitive(0).concat(new Object().name())")
+  eval("x = IsPrimitive(0).concat(new Object().name())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new parseFloat(x)?this.valueOf():IsSmi(x)")
+  eval("x = new parseFloat(x)?this.valueOf():IsSmi(x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new 'a'.slice(null, -1).shift()")
+  eval("x = new 'a'.slice(null, -1).shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label 'a'+void.concat('a'>>>=-1)")
+  eval("label 'a'+void.concat('a'>>>=-1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(escape(0.length))")
+  eval("new Function(escape(0.length))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = parseInt(0.lastIndexOf(NaN))")
+  eval("const x = parseInt(0.lastIndexOf(NaN))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(null&debugger.valueOf(), 0[false].push(false.add(debugger)))")
+  eval("SetValueOf(null&debugger.valueOf(), 0[false].push(false.add(debugger)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = parseInt(new RegExp.__lookupGetter__(break))")
+  eval("x = parseInt(new RegExp.__lookupGetter__(break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(~false&&break>>0, new RegExp.lastIndex.add({this}))")
+  eval("SetValueOf(~false&&break>>0, new RegExp.lastIndex.add({this}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = Join(break, continue, 0, debugger, NaN).toLocaleString()")
+  eval("x = Join(break, continue, 0, debugger, NaN).toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import new Object().sort().superConstructor")
+  eval("import new Object().sort().superConstructor")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new IsSmi(goto -1)")
+  eval("const x = new IsSmi(goto -1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return Iterator(null).toObject() }; X(-1==new Object()==0.__lookupGetter__(native))")
+  eval("function X(x) { return Iterator(null).toObject() }; X(-1==new Object()==0.__lookupGetter__(native))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native void.join().add(parseFloat(continue))")
+  eval("native void.join().add(parseFloat(continue))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (function () { -1 }.shift()) { escape(1.unshift()) }")
+  eval("let (function () { -1 }.shift()) { escape(1.unshift()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(new RegExp.indexOf(1).filter(continue instanceof break))")
+  eval("new Function(new RegExp.indexOf(1).filter(continue instanceof break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (NaN?continue:NaN.shift()) { native.push(null).add(new Object().superConstructor) }")
+  eval("if (NaN?continue:NaN.shift()) { native.push(null).add(new Object().superConstructor) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return new Object().length().toText }; X(debugger.indexOf(this).toText)")
+  eval("function X(x) { return new Object().length().toText }; X(debugger.indexOf(this).toText)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new Object().call('a').charCodeAt(native.size)")
+  eval("const x = new Object().call('a').charCodeAt(native.size)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new function () { continue }.add(true.slice(continue, new RegExp))")
+  eval("new function () { continue }.add(true.slice(continue, new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x[native] instanceof -1.join().prototype.this.null.size = 0.2.prototype.x+0.2.indexOf(false)")
+  eval("x[native] instanceof -1.join().prototype.this.null.size = 0.2.prototype.x+0.2.indexOf(false)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (this instanceof new RegExp.splice() in null>>>=new RegExp.valueOf()) { function () { unescape(1) } }")
+  eval("for (this instanceof new RegExp.splice() in null>>>=new RegExp.valueOf()) { function () { unescape(1) } }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (true.shift()/native.null in undef.call(NaN).isNull) { native+this-x.size }")
+  eval("for (true.shift()/native.null in undef.call(NaN).isNull) { native+this-x.size }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return false.pop()<<Join(continue, false, break, NaN, -1) }; X(IsSmi(debugger>>x))")
+  eval("function X(x) { return false.pop()<<Join(continue, false, break, NaN, -1) }; X(IsSmi(debugger>>x))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if ({parseFloat(null),Math.max(native)}) { 0.2-new Object().__lookupGetter__(eval(new Object())) }")
+  eval("if ({parseFloat(null),Math.max(native)}) { 0.2-new Object().__lookupGetter__(eval(new Object())) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(Array(1).toLocaleString(), null.name().exec(undef.filter(false)))")
+  eval("SetValueOf(Array(1).toLocaleString(), null.name().exec(undef.filter(false)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(true.filter(this).pop())")
+  eval("new Function(true.filter(this).pop())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (break.lastIndex.superConstructor) { new Object().toString().length() }")
+  eval("let (break.lastIndex.superConstructor) { new Object().toString().length() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label (!0.2/debugger)")
+  eval("label (!0.2/debugger)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ NaN.concat(new RegExp)+Join(1, false, new Object(), new Object(), x) : unescape(x).concat(Iterator(-1)) }) { 'a'.isNull.__lookupGetter__(this+native) }")
+  eval("with ({ NaN.concat(new RegExp)+Join(1, false, new Object(), new Object(), x) : unescape(x).concat(Iterator(-1)) }) { 'a'.isNull.__lookupGetter__(this+native) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export break.name()/IsPrimitive(this)")
+  eval("export break.name()/IsPrimitive(this)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {null}.prototype.value")
+  eval("new {null}.prototype.value")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new true+false.__lookupGetter__(null&continue)")
+  eval("new true+false.__lookupGetter__(null&continue)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (-1.push(new RegExp)[void.valueOf()]) { new RegExp.className().__lookupGetter__(Array(0)) }")
+  eval("if (-1.push(new RegExp)[void.valueOf()]) { new RegExp.className().__lookupGetter__(Array(0)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export NaN.__lookupGetter__(undef).__lookupGetter__(void.isNull)")
+  eval("export NaN.__lookupGetter__(undef).__lookupGetter__(void.isNull)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ ~new RegExp.filter(undef&&this) : String(continue)<<NaN.toText }) { this.exec(this).length }")
+  eval("with ({ ~new RegExp.filter(undef&&this) : String(continue)<<NaN.toText }) { this.exec(this).length }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (true&void.exec(void.exec(continue)) in Join('a', undef, new Object(), continue, x) instanceof {undef}) { unescape(-1.prototype.name) }")
+  eval("for (true&void.exec(void.exec(continue)) in Join('a', undef, new Object(), continue, x) instanceof {undef}) { unescape(-1.prototype.name) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import void.push(true).join()")
+  eval("import void.push(true).join()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf({break}&x.name(), 1.charAt(false).slice(continue.superConstructor, this&&break))")
+  eval("SetValueOf({break}&x.name(), 1.charAt(false).slice(continue.superConstructor, this&&break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (this.call(this) > Iterator(continue)) { new Object().prototype.value.slice(1.slice(native, -1), (!false)) }")
+  eval("let (this.call(this) > Iterator(continue)) { new Object().prototype.value.slice(1.slice(native, -1), (!false)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export parseInt(new RegExp>>>=x)")
+  eval("export parseInt(new RegExp>>>=x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (escape(x==debugger), NaN.shift()&debugger?false:0.2, (!new RegExp)&goto break) { unescape(x.toText) }")
+  eval("for (escape(x==debugger), NaN.shift()&debugger?false:0.2, (!new RegExp)&goto break) { unescape(x.toText) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(throw new NaN.toObject()(this?break:true))")
+  eval("new Date(throw new NaN.toObject()(this?break:true))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new (typeof(this))")
+  eval("new (typeof(this))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (unescape('a'/0) in ~new Object().lastIndex) { IsSmi(0).push(0.concat(0.2)) }")
+  eval("for (unescape('a'/0) in ~new Object().lastIndex) { IsSmi(0).push(0.concat(0.2)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("(!new RegExp)[0.2 > new Object()].prototype.Number(debugger.join()) = native&-1.size")
+  eval("(!new RegExp)[0.2 > new Object()].prototype.Number(debugger.join()) = native&-1.size")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new false.toJSONProtocol&&0.2.constructor")
+  eval("new false.toJSONProtocol&&0.2.constructor")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (~0?0.2:undef in new RegExp.charCodeAt(0).prototype.name) { NaN.toLocaleString().splice() }")
+  eval("for (~0?0.2:undef in new RegExp.charCodeAt(0).prototype.name) { NaN.toLocaleString().splice() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (~IsPrimitive(new RegExp), true.toString().size, null.charCodeAt('a') > null.concat(0)) { break.toJSONProtocol/IsPrimitive(break) }")
+  eval("for (~IsPrimitive(new RegExp), true.toString().size, null.charCodeAt('a') > null.concat(0)) { break.toJSONProtocol/IsPrimitive(break) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new parseInt(new Object()).lastIndexOf(NaN > void)")
+  eval("new parseInt(new Object()).lastIndexOf(NaN > void)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export break.splice()&&-1.prototype.new Object()")
+  eval("export break.splice()&&-1.prototype.new Object()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("{{true,0}}.prototype.break.length.splice() = 'a'.toText.superConstructor")
+  eval("{{true,0}}.prototype.break.length.splice() = 'a'.toText.superConstructor")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (debugger>>>=continue > break.exec(1)) { Math.pow(new RegExp)==NaN>>>=0.2 }")
+  eval("let (debugger>>>=continue > break.exec(1)) { Math.pow(new RegExp)==NaN>>>=0.2 }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 0.2==0.2/goto true : IsSmi(native).isNull }) { throw new {x,null}(false.className()) }")
+  eval("with ({ 0.2==0.2/goto true : IsSmi(native).isNull }) { throw new {x,null}(false.className()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = {false.concat(null),Math.pow(NaN)}")
+  eval("x = {false.concat(null),Math.pow(NaN)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Array(null).add(NaN.valueOf())")
+  eval("export Array(null).add(NaN.valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (parseFloat(new Object()==true) in GetFunctionFor('a'&false)) { native&undef.toJSONProtocol }")
+  eval("for (parseFloat(new Object()==true) in GetFunctionFor('a'&false)) { native&undef.toJSONProtocol }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new {eval(null),(debugger)}")
+  eval("x = new {eval(null),(debugger)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import {this.0,debugger.filter(NaN)}")
+  eval("import {this.0,debugger.filter(NaN)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import break.charAt(-1)<<false.__defineSetter__(0,function(){x})")
+  eval("import break.charAt(-1)<<false.__defineSetter__(0,function(){x})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = goto false > new Object()")
+  eval("x = goto false > new Object()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("null.superConstructor[debugger.isNull].prototype.Math.max('a').shift() = parseInt(0).size")
+  eval("null.superConstructor[debugger.isNull].prototype.Math.max('a').shift() = parseInt(0).size")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native eval(void.add(break))")
+  eval("native eval(void.add(break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(x > void.join())")
+  eval("new Date(x > void.join())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ {this.toObject()} : Number(NaN).toJSONProtocol }) { 0.2.className().prototype.name }")
+  eval("with ({ {this.toObject()} : Number(NaN).toJSONProtocol }) { 0.2.className().prototype.name }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (false.__defineGetter__(undef,function(){undef}).exec(NaN.splice())) { typeof(Join(void, new RegExp, break, -1, -1)) }")
+  eval("if (false.__defineGetter__(undef,function(){undef}).exec(NaN.splice())) { typeof(Join(void, new RegExp, break, -1, -1)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (false.splice().toObject(), continue.name().size, Join(void?debugger:this, new RegExp.__defineSetter__(NaN,function(){NaN}), x.unshift(), this.true, parseInt(break))) { undef<<continue.toText }")
+  eval("for (false.splice().toObject(), continue.name().size, Join(void?debugger:this, new RegExp.__defineSetter__(NaN,function(){NaN}), x.unshift(), this.true, parseInt(break))) { undef<<continue.toText }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (this.0.indexOf(break)) { break.charAt(this).unshift() }")
+  eval("let (this.0.indexOf(break)) { break.charAt(this).unshift() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import Join(new Object().splice(), this instanceof 1, parseFloat(NaN), undef.concat(x), void.className())")
+  eval("import Join(new Object().splice(), this instanceof 1, parseFloat(NaN), undef.concat(x), void.className())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(goto NaN.toString())")
+  eval("new Function(goto NaN.toString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label 'a'<<break.shift()")
+  eval("label 'a'<<break.shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = Iterator(continue)[new Object()>>NaN]")
+  eval("const x = Iterator(continue)[new Object()>>NaN]")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = Join(new RegExp, 'a', this, void, true)>>>=continue>>native")
+  eval("x = Join(new RegExp, 'a', this, void, true)>>>=continue>>native")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import new Object().toJSONProtocol.splice()")
+  eval("import new Object().toJSONProtocol.splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return undef.__defineSetter__(native,function(){void}).toJSONProtocol }; X(eval(x).charCodeAt('a'.concat(true)))")
+  eval("function X(x) { return undef.__defineSetter__(native,function(){void}).toJSONProtocol }; X(eval(x).charCodeAt('a'.concat(true)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(throw new 0.2.__defineGetter__(NaN,function(){-1})(void&&new RegExp))")
+  eval("Instantiate(throw new 0.2.__defineGetter__(NaN,function(){-1})(void&&new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = 0.unshift() > IsSmi(NaN)")
+  eval("const x = 0.unshift() > IsSmi(NaN)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label x.call(null).lastIndex")
+  eval("label x.call(null).lastIndex")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(IsSmi(0.2.add(0)), x.add(break).this.__defineGetter__(undef,function(){new RegExp}))")
+  eval("SetValueOf(IsSmi(0.2.add(0)), x.add(break).this.__defineGetter__(undef,function(){new RegExp}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native Number(this).toObject()")
+  eval("native Number(this).toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new NaN.shift().add(String(new Object()))")
+  eval("new NaN.shift().add(String(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new null.name().splice()")
+  eval("new null.name().splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = 1.undef.push(new Object().call(null))")
+  eval("const x = 1.undef.push(new Object().call(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(parseInt(1).size)")
+  eval("new Function(parseInt(1).size)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = this.x.sort()")
+  eval("const x = this.x.sort()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(continue.valueOf().prototype.new RegExp.splice())")
+  eval("Instantiate(continue.valueOf().prototype.new RegExp.splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(this.charAt(continue)?undef+'a':unescape(1))")
+  eval("Instantiate(this.charAt(continue)?undef+'a':unescape(1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf({throw new 'a'(0.2),void.lastIndexOf(NaN)}, Math.pow(new Object().className()))")
+  eval("SetValueOf({throw new 'a'(0.2),void.lastIndexOf(NaN)}, Math.pow(new Object().className()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (1.slice(new Object(), this).valueOf()) { parseInt(true).pop() }")
+  eval("if (1.slice(new Object(), this).valueOf()) { parseInt(true).pop() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 0.2.superConstructor.lastIndex : goto debugger<<Join(undef, 1, true, undef, debugger) }) { function () { NaN }.prototype.name }")
+  eval("with ({ 0.2.superConstructor.lastIndex : goto debugger<<Join(undef, 1, true, undef, debugger) }) { function () { NaN }.prototype.name }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("-1.exec(debugger).length.prototype.debugger > null.slice(Iterator(void), continue.concat(0)) = parseInt(throw new 1(1))")
+  eval("-1.exec(debugger).length.prototype.debugger > null.slice(Iterator(void), continue.concat(0)) = parseInt(throw new 1(1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(new Object().constructor.call(Number(1)))")
+  eval("new Date(new Object().constructor.call(Number(1)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new null.unshift().call(escape(x))")
+  eval("const x = new null.unshift().call(escape(x))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (Math.pow(native).toLocaleString()) { case (false instanceof native.join()): Math.pow(NaN).size; break; }")
+  eval("switch (Math.pow(native).toLocaleString()) { case (false instanceof native.join()): Math.pow(NaN).size; break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label function () { new Object() }.prototype.true.size")
+  eval("label function () { new Object() }.prototype.true.size")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = Join('a', 0.2, false, new Object(), void).continue.className()")
+  eval("const x = Join('a', 0.2, false, new Object(), void).continue.className()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = IsPrimitive(break.__lookupGetter__(-1))")
+  eval("const x = IsPrimitive(break.__lookupGetter__(-1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new Object()>>0.2.prototype.name")
+  eval("x = new Object()>>0.2.prototype.name")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new IsPrimitive(new Object()).shift()")
+  eval("const x = new IsPrimitive(new Object()).shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (Array(parseInt(break))) { 'a'.toString().unshift() }")
+  eval("if (Array(parseInt(break))) { 'a'.toString().unshift() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = return 0.2>>>=-1?undef:undef")
+  eval("const x = return 0.2>>>=-1?undef:undef")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Object().splice().unshift().prototype.null&&native.__lookupGetter__(undef>>>=NaN) = (1<<break)")
+  eval("new Object().splice().unshift().prototype.null&&native.__lookupGetter__(undef>>>=NaN) = (1<<break)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete NaN.charAt(1).concat(NaN.0.2)")
+  eval("delete NaN.charAt(1).concat(NaN.0.2)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(new RegExp.sort().toJSONProtocol)")
+  eval("Instantiate(new RegExp.sort().toJSONProtocol)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return GetFunctionFor(false).lastIndexOf(1.shift()) }; X(this.0.2.charCodeAt(0.2))")
+  eval("function X(x) { return GetFunctionFor(false).lastIndexOf(1.shift()) }; X(this.0.2.charCodeAt(0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (goto NaN.toObject(), ~true.'a', parseInt(debugger)+eval(false)) { eval(0.2.constructor) }")
+  eval("for (goto NaN.toObject(), ~true.'a', parseInt(debugger)+eval(false)) { eval(0.2.constructor) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (parseInt(debugger).pop()) { case (this.push(true).valueOf()): Join(continue, debugger, native, native, debugger).filter(Array(continue)); break; }")
+  eval("switch (parseInt(debugger).pop()) { case (this.push(true).valueOf()): Join(continue, debugger, native, native, debugger).filter(Array(continue)); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new debugger.sort() instanceof this>>1")
+  eval("x = new debugger.sort() instanceof this>>1")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ parseFloat(false).prototype.(!new Object()) : {unescape(-1)} }) { Math.max(new RegExp.superConstructor) }")
+  eval("with ({ parseFloat(false).prototype.(!new Object()) : {unescape(-1)} }) { Math.max(new RegExp.superConstructor) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate({Math.pow(break)})")
+  eval("Instantiate({Math.pow(break)})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import typeof(break.valueOf())")
+  eval("import typeof(break.valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(Math.pow(-1[new RegExp]))")
+  eval("Instantiate(Math.pow(-1[new RegExp]))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native IsPrimitive(1).concat({x,null})")
+  eval("native IsPrimitive(1).concat({x,null})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("NaN.length.prototype.value.prototype.function () { null==new Object() } = break.name()&IsPrimitive(0)")
+  eval("NaN.length.prototype.value.prototype.function () { null==new Object() } = break.name()&IsPrimitive(0)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete NaN.prototype.-1.toString()")
+  eval("delete NaN.prototype.-1.toString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new continue.unshift()+parseFloat(undef)")
+  eval("new continue.unshift()+parseFloat(undef)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new NaN-break.call(false.pop())")
+  eval("const x = new NaN-break.call(false.pop())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native new RegExp.exec(break).pop()")
+  eval("native new RegExp.exec(break).pop()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf({'a',null}.prototype.value, 1.shift() instanceof {'a',0})")
+  eval("SetValueOf({'a',null}.prototype.value, 1.shift() instanceof {'a',0})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (debugger.valueOf().size, function () { x.unshift() }, IsSmi(1)&&true==native) { new Object().__defineGetter__(this,function(){'a'})&&eval(native) }")
+  eval("for (debugger.valueOf().size, function () { x.unshift() }, IsSmi(1)&&true==native) { new Object().__defineGetter__(this,function(){'a'})&&eval(native) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export 'a'.pop().charCodeAt(x.className())")
+  eval("export 'a'.pop().charCodeAt(x.className())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export String(IsSmi(debugger))")
+  eval("export String(IsSmi(debugger))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("typeof(debugger).valueOf().prototype.(1).lastIndexOf(this.break) = x.prototype.name.toLocaleString()")
+  eval("typeof(debugger).valueOf().prototype.(1).lastIndexOf(this.break) = x.prototype.name.toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native Array(typeof(false))")
+  eval("native Array(typeof(false))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(1.__defineGetter__(1,function(){1}).null.constructor)")
+  eval("new Function(1.__defineGetter__(1,function(){1}).null.constructor)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = 1.charAt(0).toObject()")
+  eval("x = 1.charAt(0).toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Math.max('a'.filter(new Object())))")
+  eval("new Date(Math.max('a'.filter(new Object())))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(void.prototype.name.unshift())")
+  eval("new Date(void.prototype.name.unshift())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (-1.toJSONProtocol.call(-1.size) in ~x.sort()) { eval(0&debugger) }")
+  eval("for (-1.toJSONProtocol.call(-1.size) in ~x.sort()) { eval(0&debugger) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for ('a'==undef.join() in Math.pow(IsSmi(false))) { undef > this>>goto x }")
+  eval("for ('a'==undef.join() in Math.pow(IsSmi(false))) { undef > this>>goto x }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate('a'.constructor.isNull)")
+  eval("Instantiate('a'.constructor.isNull)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (GetFunctionFor(this.slice(0.2, this)), this.prototype.void?null.unshift():native.className(), Number(new Object().call(-1))) { 0.splice() > debugger&&this }")
+  eval("for (GetFunctionFor(this.slice(0.2, this)), this.prototype.void?null.unshift():native.className(), Number(new Object().call(-1))) { 0.splice() > debugger&&this }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ {goto new RegExp,Join(new Object(), native, continue, -1, x)} : NaN&x/{0,break} }) { this.lastIndexOf(new RegExp).join() }")
+  eval("with ({ {goto new RegExp,Join(new Object(), native, continue, -1, x)} : NaN&x/{0,break} }) { this.lastIndexOf(new RegExp).join() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (typeof(break.length())) { native&&false.sort() }")
+  eval("let (typeof(break.length())) { native&&false.sort() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new parseFloat(-1 instanceof break)")
+  eval("x = new parseFloat(-1 instanceof break)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label throw new continue.unshift()(null.shift())")
+  eval("label throw new continue.unshift()(null.shift())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import Math.max(0.2.toLocaleString())")
+  eval("import Math.max(0.2.toLocaleString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return false.unshift().className() }; X(escape(NaN&NaN))")
+  eval("function X(x) { return false.unshift().className() }; X(escape(NaN&NaN))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Join(native.toText, goto x, 0.2.splice(), Join('a', 0, void, NaN, 1), eval(native)))")
+  eval("new Date(Join(native.toText, goto x, 0.2.splice(), Join('a', 0, void, NaN, 1), eval(native)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (GetFunctionFor(true.prototype.name)) { parseInt(NaN).toLocaleString() }")
+  eval("if (GetFunctionFor(true.prototype.name)) { parseInt(NaN).toLocaleString() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new escape(native).__defineSetter__(return native,function(){undef > native})")
+  eval("new escape(native).__defineSetter__(return native,function(){undef > native})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new typeof(true > 'a')")
+  eval("const x = new typeof(true > 'a')")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (debugger.prototype.0.2<<new RegExp+false) { case (native.splice().filter({x})): false&true.indexOf(1.__defineGetter__(native,function(){continue})); break; }")
+  eval("switch (debugger.prototype.0.2<<new RegExp+false) { case (native.splice().filter({x})): false&true.indexOf(1.__defineGetter__(native,function(){continue})); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label true-NaN.prototype.native.shift()")
+  eval("label true-NaN.prototype.native.shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new typeof(new RegExp.splice())")
+  eval("new typeof(new RegExp.splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (function () { this.NaN }) { case (this.continue.prototype.parseFloat(false)): IsPrimitive(new Object()-'a'); break; }")
+  eval("switch (function () { this.NaN }) { case (this.continue.prototype.parseFloat(false)): IsPrimitive(new Object()-'a'); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export break.__lookupGetter__(debugger).indexOf(native.pop())")
+  eval("export break.__lookupGetter__(debugger).indexOf(native.pop())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (GetFunctionFor(NaN.lastIndex)) { case (new RegExp.lastIndex.toLocaleString()): NaN.join().indexOf(eval(-1)); break; }")
+  eval("switch (GetFunctionFor(NaN.lastIndex)) { case (new RegExp.lastIndex.toLocaleString()): NaN.join().indexOf(eval(-1)); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native {void.charAt(true)}")
+  eval("native {void.charAt(true)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new new Object()==NaN.join()")
+  eval("new new Object()==NaN.join()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(typeof(Array(new Object())))")
+  eval("new Date(typeof(Array(new Object())))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label throw new (false)(eval(x))")
+  eval("label throw new (false)(eval(x))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new new RegExp.size.charAt(true > -1)")
+  eval("new new RegExp.size.charAt(true > -1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = debugger.toObject().charAt(this<<undef)")
+  eval("x = debugger.toObject().charAt(this<<undef)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 'a'.valueOf()+parseInt(undef) : IsPrimitive(null).lastIndex }) { NaN.toObject().isNull }")
+  eval("with ({ 'a'.valueOf()+parseInt(undef) : IsPrimitive(null).lastIndex }) { NaN.toObject().isNull }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new new Object()&&void.lastIndexOf(0.2.splice())")
+  eval("x = new new Object()&&void.lastIndexOf(0.2.splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ 1+1.name() : Join(Math.pow(debugger), new RegExp-1, x > 1, x<<-1, new RegExp.size) }) { undef[undef].size }")
+  eval("with ({ 1+1.name() : Join(Math.pow(debugger), new RegExp-1, x > 1, x<<-1, new RegExp.size) }) { undef[undef].size }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete native.call(-1).isNull")
+  eval("delete native.call(-1).isNull")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (new Object()>>>=break==Math.pow(debugger)) { IsPrimitive(this).lastIndex }")
+  eval("if (new Object()>>>=break==Math.pow(debugger)) { IsPrimitive(this).lastIndex }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for ((!x&&new RegExp) in undef.toLocaleString().slice(new RegExp.indexOf(NaN), IsPrimitive(-1))) { false.size+debugger[x] }")
+  eval("for ((!x&&new RegExp) in undef.toLocaleString().slice(new RegExp.indexOf(NaN), IsPrimitive(-1))) { false.size+debugger[x] }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import 0.length.__defineGetter__(0.2.shift(),function(){'a'.className()})")
+  eval("import 0.length.__defineGetter__(0.2.shift(),function(){'a'.className()})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(goto new Object().push(void))")
+  eval("Instantiate(goto new Object().push(void))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ Array(this.0) : parseFloat(void).pop() }) { escape(true).slice(continue.lastIndex, false.toObject()) }")
+  eval("with ({ Array(this.0) : parseFloat(void).pop() }) { escape(true).slice(continue.lastIndex, false.toObject()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new native==true.filter({NaN,-1})")
+  eval("new native==true.filter({NaN,-1})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for ('a'.__defineSetter__(continue,function(){-1}).unshift(), Array(undef).toLocaleString(), undef.__lookupGetter__(void).toLocaleString()) { parseInt(false/native) }")
+  eval("for ('a'.__defineSetter__(continue,function(){-1}).unshift(), Array(undef).toLocaleString(), undef.__lookupGetter__(void).toLocaleString()) { parseInt(false/native) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("this.x<<false.prototype.true.toLocaleString()==NaN.pop() = this.superConstructor>>Math.max(true)")
+  eval("this.x<<false.prototype.true.toLocaleString()==NaN.pop() = this.superConstructor>>Math.max(true)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return this.prototype.name.splice() }; X(unescape(x).__lookupGetter__(Number(debugger)))")
+  eval("function X(x) { return this.prototype.name.splice() }; X(unescape(x).__lookupGetter__(Number(debugger)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new (!NaN).unshift()")
+  eval("x = new (!NaN).unshift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(escape(Iterator(this)))")
+  eval("new Function(escape(Iterator(this)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return Number(new RegExp)<<this?true:-1 }; X(Number(null).lastIndex)")
+  eval("function X(x) { return Number(new RegExp)<<this?true:-1 }; X(Number(null).lastIndex)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export this.void.splice()")
+  eval("export this.void.splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (this.prototype.null.sort() in -1.className()&void.filter(new Object())) { GetFunctionFor(new Object()).pop() }")
+  eval("for (this.prototype.null.sort() in -1.className()&void.filter(new Object())) { GetFunctionFor(new Object()).pop() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label 0[break].sort()")
+  eval("label 0[break].sort()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (null.length().toString(), eval(-1).toObject(), (!continue.concat(continue))) { true.name()/native<<new RegExp }")
+  eval("for (null.length().toString(), eval(-1).toObject(), (!continue.concat(continue))) { true.name()/native<<new RegExp }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (unescape(null).sort(), Number(undef).charCodeAt(IsPrimitive(NaN)), null>>true/null.join()) { 0.2.toObject() > IsPrimitive(new RegExp) }")
+  eval("for (unescape(null).sort(), Number(undef).charCodeAt(IsPrimitive(NaN)), null>>true/null.join()) { 0.2.toObject() > IsPrimitive(new RegExp) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date({NaN,native}&&1+undef)")
+  eval("new Date({NaN,native}&&1+undef)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(IsPrimitive(undef>>>=1))")
+  eval("Instantiate(IsPrimitive(undef>>>=1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (Join(true, 'a', true, 1, NaN).add({1}), GetFunctionFor(new Object().push(new Object())), goto 1.length) { Math.pow(GetFunctionFor(native)) }")
+  eval("for (Join(true, 'a', true, 1, NaN).add({1}), GetFunctionFor(new Object().push(new Object())), goto 1.length) { Math.pow(GetFunctionFor(native)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return break.isNull > parseInt(continue) }; X((new RegExp instanceof 1))")
+  eval("function X(x) { return break.isNull > parseInt(continue) }; X((new RegExp instanceof 1))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ Number(false).indexOf(x instanceof new Object()) : function () { x.toString() } }) { false.name().indexOf(GetFunctionFor(null)) }")
+  eval("with ({ Number(false).indexOf(x instanceof new Object()) : function () { x.toString() } }) { false.name().indexOf(GetFunctionFor(null)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date('a'.constructor.prototype.name)")
+  eval("new Date('a'.constructor.prototype.name)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("GetFunctionFor(void&new Object()).prototype.debugger.add(null)[void.unshift()] = new RegExp.isNull.Iterator(this)")
+  eval("GetFunctionFor(void&new Object()).prototype.debugger.add(null)[void.unshift()] = new RegExp.isNull.Iterator(this)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete false?break:undef.constructor")
+  eval("delete false?break:undef.constructor")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ (native.filter(1)) : eval(this&&0.2) }) { undef.length instanceof new Object().toText }")
+  eval("with ({ (native.filter(1)) : eval(this&&0.2) }) { undef.length instanceof new Object().toText }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export String(break.lastIndexOf(null))")
+  eval("export String(break.lastIndexOf(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label (!Iterator(new RegExp))")
+  eval("label (!Iterator(new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(String(null==-1), {1&0})")
+  eval("SetValueOf(String(null==-1), {1&0})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(parseInt('a' > 0))")
+  eval("new Date(parseInt('a' > 0))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(debugger.toJSONProtocol.indexOf(escape(0)), this.filter(null).__defineSetter__(continue.break,function(){debugger>>null}))")
+  eval("SetValueOf(debugger.toJSONProtocol.indexOf(escape(0)), this.filter(null).__defineSetter__(continue.break,function(){debugger>>null}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("this.name().length().prototype.goto false.exec(true.charCodeAt(continue)) = Join(-1-false, undef.superConstructor, 'a'.shift(), (!x), NaN.this)")
+  eval("this.name().length().prototype.goto false.exec(true.charCodeAt(continue)) = Join(-1-false, undef.superConstructor, 'a'.shift(), (!x), NaN.this)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(typeof(new RegExp).sort())")
+  eval("new Function(typeof(new RegExp).sort())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new 0.2.concat(x).splice()")
+  eval("new 0.2.concat(x).splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (goto void.indexOf(throw new x(1)), typeof(return new RegExp), IsPrimitive(-1).add(void.lastIndexOf(debugger))) { null.indexOf(void).toText }")
+  eval("for (goto void.indexOf(throw new x(1)), typeof(return new RegExp), IsPrimitive(-1).add(void.lastIndexOf(debugger))) { null.indexOf(void).toText }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("return new RegExp.pop().prototype.String(x.toObject()) = 1.superConstructor.charCodeAt(new RegExp.charCodeAt(null))")
+  eval("return new RegExp.pop().prototype.String(x.toObject()) = 1.superConstructor.charCodeAt(new RegExp.charCodeAt(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new null&true.prototype.name")
+  eval("new null&true.prototype.name")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = -1>>>=NaN.indexOf((debugger))")
+  eval("const x = -1>>>=NaN.indexOf((debugger))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new parseFloat(null).splice()")
+  eval("const x = new parseFloat(null).splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import -1.lastIndexOf(new RegExp) instanceof throw new void(0.2)")
+  eval("import -1.lastIndexOf(new RegExp) instanceof throw new void(0.2)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if ((0.shift())) { Join(IsPrimitive(-1), break.__defineSetter__(true,function(){break}), parseInt(null), parseFloat(break), true/null) }")
+  eval("if ((0.shift())) { Join(IsPrimitive(-1), break.__defineSetter__(true,function(){break}), parseInt(null), parseFloat(break), true/null) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new escape(1 > continue)")
+  eval("x = new escape(1 > continue)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (parseInt(undef)>>false.filter(continue)) { case (this.undef/new Object()): 'a'.toJSONProtocol.__defineGetter__(new RegExp-undef,function(){parseFloat(new RegExp)}); break; }")
+  eval("switch (parseInt(undef)>>false.filter(continue)) { case (this.undef/new Object()): 'a'.toJSONProtocol.__defineGetter__(new RegExp-undef,function(){parseFloat(new RegExp)}); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("{void}.shift().prototype.this.Array(new Object()) = {0.2,new RegExp}.lastIndexOf(break.splice())")
+  eval("{void}.shift().prototype.this.Array(new Object()) = {0.2,new RegExp}.lastIndexOf(break.splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new continue&&new Object().lastIndexOf(new Object() instanceof 1)")
+  eval("new continue&&new Object().lastIndexOf(new Object() instanceof 1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (throw new 'a'.exec(x)(return false), native/void.constructor, {native}==true.toLocaleString()) { goto 1 instanceof 1.isNull }")
+  eval("for (throw new 'a'.exec(x)(return false), native/void.constructor, {native}==true.toLocaleString()) { goto 1 instanceof 1.isNull }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (break.concat(break) > native>>>=-1, (debugger.x), Join(x, void, void, new RegExp, null).name()) { void.charCodeAt(true).valueOf() }")
+  eval("for (break.concat(break) > native>>>=-1, (debugger.x), Join(x, void, void, new RegExp, null).name()) { void.charCodeAt(true).valueOf() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new 'a'>>0 instanceof new Object().push(new RegExp)")
+  eval("const x = new 'a'>>0 instanceof new Object().push(new RegExp)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (return ~break) { break.__defineGetter__(break,function(){-1}).shift() }")
+  eval("if (return ~break) { break.__defineGetter__(break,function(){-1}).shift() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(Join(null, -1, undef, null, 0).toString())")
+  eval("Instantiate(Join(null, -1, undef, null, 0).toString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let ({new RegExp,void}.slice(break.isNull, false.shift())) { eval(debugger.slice(this, 1)) }")
+  eval("let ({new RegExp,void}.slice(break.isNull, false.shift())) { eval(debugger.slice(this, 1)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return {GetFunctionFor(0)} }; X('a'.prototype.debugger.concat(void.constructor))")
+  eval("function X(x) { return {GetFunctionFor(0)} }; X('a'.prototype.debugger.concat(void.constructor))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (~true instanceof continue) { escape(new RegExp.toObject()) }")
+  eval("let (~true instanceof continue) { escape(new RegExp.toObject()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("escape(0[native]).prototype.debugger.add(1).unshift() = (true.join())")
+  eval("escape(0[native]).prototype.debugger.add(1).unshift() = (true.join())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (unescape(void).length, undef.toObject() instanceof x.toObject(), 0.2+true.concat(true.__lookupGetter__(this))) { (x).toJSONProtocol }")
+  eval("for (unescape(void).length, undef.toObject() instanceof x.toObject(), 0.2+true.concat(true.__lookupGetter__(this))) { (x).toJSONProtocol }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(escape(null).__lookupGetter__(undef.size))")
+  eval("Instantiate(escape(null).__lookupGetter__(undef.size))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label Array(continue[false])")
+  eval("label Array(continue[false])")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return Number(this&&false) }; X(NaN.toJSONProtocol.toJSONProtocol)")
+  eval("function X(x) { return Number(this&&false) }; X(NaN.toJSONProtocol.toJSONProtocol)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("null.toString().shift().prototype.Array(x).__lookupGetter__('a'.prototype.x) = {1.length,break.join()}")
+  eval("null.toString().shift().prototype.Array(x).__lookupGetter__('a'.prototype.x) = {1.length,break.join()}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new 1.charCodeAt(break)+IsSmi(false)")
+  eval("x = new 1.charCodeAt(break)+IsSmi(false)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(String(this) > 0.2.toText, new RegExp.length.lastIndexOf(1<<0.2))")
+  eval("SetValueOf(String(this) > 0.2.toText, new RegExp.length.lastIndexOf(1<<0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (new RegExp.pop().charAt(IsSmi(new RegExp))) { case (native.indexOf(this)/native.lastIndex): this.debugger.indexOf(debugger); break; }")
+  eval("switch (new RegExp.pop().charAt(IsSmi(new RegExp))) { case (native.indexOf(this)/native.lastIndex): this.debugger.indexOf(debugger); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Number(x)[debugger.prototype.break])")
+  eval("new Date(Number(x)[debugger.prototype.break])")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return new RegExp>>>=x.unshift() }; X(Math.max(continue.name()))")
+  eval("function X(x) { return new RegExp>>>=x.unshift() }; X(Math.max(continue.name()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(IsSmi(null.size))")
+  eval("Instantiate(IsSmi(null.size))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = native?0.2:1+GetFunctionFor(void)")
+  eval("x = native?0.2:1+GetFunctionFor(void)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (IsPrimitive(-1)>>>=break.valueOf() in String(0 > 0.2)) { Math.max(true.length()) }")
+  eval("for (IsPrimitive(-1)>>>=break.valueOf() in String(0 > 0.2)) { Math.max(true.length()) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (escape(unescape(NaN))) { case (Math.pow(eval(undef))): true.charAt(null)&new RegExp.pop(); break; }")
+  eval("switch (escape(unescape(NaN))) { case (Math.pow(eval(undef))): true.charAt(null)&new RegExp.pop(); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete Join(new RegExp, 1, false, new Object(), this).toLocaleString()")
+  eval("delete Join(new RegExp, 1, false, new Object(), this).toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label return x.filter(x.join())")
+  eval("label return x.filter(x.join())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new new RegExp.pop().shift()")
+  eval("new new RegExp.pop().shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new (!debugger.size)")
+  eval("x = new (!debugger.size)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label Math.max(debugger.__lookupGetter__(NaN))")
+  eval("label Math.max(debugger.__lookupGetter__(NaN))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(eval(debugger[debugger]))")
+  eval("Instantiate(eval(debugger[debugger]))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new 0.2.filter(true)&throw new true(debugger)")
+  eval("new 0.2.filter(true)&throw new true(debugger)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(continue.exec(debugger) > Math.pow(0.2))")
+  eval("new Date(continue.exec(debugger) > Math.pow(0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("void.prototype.value.name().prototype.Number(undef&NaN) = false.__lookupGetter__(-1).name()")
+  eval("void.prototype.value.name().prototype.Number(undef&NaN) = false.__lookupGetter__(-1).name()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(null.__defineGetter__(native,function(){continue}).valueOf())")
+  eval("Instantiate(null.__defineGetter__(native,function(){continue}).valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ {new Object()[continue],native.length()} : undef.name().superConstructor }) { Math.pow(break).indexOf(0.toJSONProtocol) }")
+  eval("with ({ {new Object()[continue],native.length()} : undef.name().superConstructor }) { Math.pow(break).indexOf(0.toJSONProtocol) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (Iterator(native.call(new RegExp))) { case (String(new RegExp).isNull): goto new RegExp.pop(); break; }")
+  eval("switch (Iterator(native.call(new RegExp))) { case (String(new RegExp).isNull): goto new RegExp.pop(); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new x.constructor instanceof undef.indexOf(-1)")
+  eval("const x = new x.constructor instanceof undef.indexOf(-1)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(this.~null, continue.pop()&0&'a')")
+  eval("SetValueOf(this.~null, continue.pop()&0&'a')")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (GetFunctionFor(~0)) { case ('a'.'a'<<undef.__defineGetter__(false,function(){true})): (!1).lastIndex; break; }")
+  eval("switch (GetFunctionFor(~0)) { case ('a'.'a'<<undef.__defineGetter__(false,function(){true})): (!1).lastIndex; break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return debugger.unshift().0.toString() }; X(Number(break).0.2>>>=false)")
+  eval("function X(x) { return debugger.unshift().0.toString() }; X(Number(break).0.2>>>=false)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Iterator(x)/undef.pop())")
+  eval("new Date(Iterator(x)/undef.pop())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(undef.join().toLocaleString(), null.add(false).valueOf())")
+  eval("SetValueOf(undef.join().toLocaleString(), null.add(false).valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("IsSmi(x).toString().prototype.0>>continue.indexOf(NaN.__lookupGetter__(new Object())) = ~-1&typeof(0)")
+  eval("IsSmi(x).toString().prototype.0>>continue.indexOf(NaN.__lookupGetter__(new Object())) = ~-1&typeof(0)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (continue.__lookupGetter__(new RegExp).toObject(), false-0.toString(), return native.sort()) { new RegExp.name().className() }")
+  eval("for (continue.__lookupGetter__(new RegExp).toObject(), false-0.toString(), return native.sort()) { new RegExp.name().className() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
@@ -1557,477 +1557,476 @@ try {
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (escape(new RegExp).toString()) { case (goto eval(1)): this.filter(new Object()).call(new RegExp.slice(null, this)); break; }")
+  eval("switch (escape(new RegExp).toString()) { case (goto eval(1)): this.filter(new Object()).call(new RegExp.slice(null, this)); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = debugger-false.toText")
+  eval("x = debugger-false.toText")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = Number(null>>new RegExp)")
+  eval("const x = Number(null>>new RegExp)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete this&native.indexOf('a'.splice())")
+  eval("delete this&native.indexOf('a'.splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(~Math.max(break), 0.2.valueOf().length)")
+  eval("SetValueOf(~Math.max(break), 0.2.valueOf().length)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(Number(native.charCodeAt(x)))")
+  eval("Instantiate(Number(native.charCodeAt(x)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new goto continue.add(0)")
+  eval("const x = new goto continue.add(0)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete typeof(debugger).name()")
+  eval("delete typeof(debugger).name()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("'a'<<false.toText.prototype.throw new true(1).lastIndex = 'a'.name().length")
+  eval("'a'<<false.toText.prototype.throw new true(1).lastIndex = 'a'.name().length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native 'a'.indexOf(debugger).charAt(NaN.add(new Object()))")
+  eval("native 'a'.indexOf(debugger).charAt(NaN.add(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(break>>false.toString(), (false.indexOf(this)))")
+  eval("SetValueOf(break>>false.toString(), (false.indexOf(this)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete goto NaN==(!debugger)")
+  eval("delete goto NaN==(!debugger)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(0.2.join().superConstructor)")
+  eval("new Date(0.2.join().superConstructor)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new this.void.toLocaleString()")
+  eval("const x = new this.void.toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("SetValueOf(x.exec(debugger)[GetFunctionFor(0)], native.toObject().exec(new RegExp.sort()))")
+  eval("SetValueOf(x.exec(debugger)[GetFunctionFor(0)], native.toObject().exec(new RegExp.sort()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(0.2.valueOf().toLocaleString())")
+  eval("Instantiate(0.2.valueOf().toLocaleString())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(-1.toJSONProtocol.prototype.name)")
+  eval("new Function(-1.toJSONProtocol.prototype.name)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(Array(-1.shift()))")
+  eval("new Date(Array(-1.shift()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export break.concat(undef).unshift()")
+  eval("export break.concat(undef).unshift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native parseFloat(-1)?NaN.toText:debugger.toString()")
+  eval("native parseFloat(-1)?NaN.toText:debugger.toString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (void-continue/continue.prototype.undef in String(break.toText)) { parseInt(false).isNull }")
+  eval("for (void-continue/continue.prototype.undef in String(break.toText)) { parseInt(false).isNull }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(true.isNull.toObject())")
+  eval("Instantiate(true.isNull.toObject())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ typeof(debugger).toObject() : x.constructor>>>=null.__defineGetter__(native,function(){debugger}) }) { unescape(undef.lastIndexOf(false)) }")
+  eval("with ({ typeof(debugger).toObject() : x.constructor>>>=null.__defineGetter__(native,function(){debugger}) }) { unescape(undef.lastIndexOf(false)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export unescape(continue)<<native[0]")
+  eval("export unescape(continue)<<native[0]")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (String(0).unescape(debugger)) { {break.pop(),0.2.constructor} }")
+  eval("if (String(0).unescape(debugger)) { {break.pop(),0.2.constructor} }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("String({true}).prototype.break.length.call(false > 0.2) = GetFunctionFor(0.prototype.new RegExp)")
+  eval("String({true}).prototype.break.length.call(false > 0.2) = GetFunctionFor(0.prototype.new RegExp)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ false.push(0.2).indexOf(Math.max(debugger)) : x&x.prototype.name }) { goto 1.lastIndex }")
+  eval("with ({ false.push(0.2).indexOf(Math.max(debugger)) : x&x.prototype.name }) { goto 1.lastIndex }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(0.2.lastIndex&0.2?break:NaN)")
+  eval("new Function(0.2.lastIndex&0.2?break:NaN)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = -1.prototype.value.toText")
+  eval("const x = -1.prototype.value.toText")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import native.toLocaleString()-1.prototype.0")
+  eval("import native.toLocaleString()-1.prototype.0")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export debugger[-1].indexOf(Join(new Object(), 0, x, new Object(), 0.2))")
+  eval("export debugger[-1].indexOf(Join(new Object(), 0, x, new Object(), 0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return (!true).lastIndexOf(true.splice()) }; X(NaN.toString().prototype.value)")
+  eval("function X(x) { return (!true).lastIndexOf(true.splice()) }; X(NaN.toString().prototype.value)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return continue.slice(-1, 1).prototype.true.name() }; X('a'.push(void).prototype.value)")
+  eval("function X(x) { return continue.slice(-1, 1).prototype.true.name() }; X('a'.push(void).prototype.value)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (goto new RegExp.length(), x.sort().className(), Math.max(new RegExp.toJSONProtocol)) { (IsSmi(-1)) }")
+  eval("for (goto new RegExp.length(), x.sort().className(), Math.max(new RegExp.toJSONProtocol)) { (IsSmi(-1)) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = 0.splice()&&-1.sort()")
+  eval("const x = 0.splice()&&-1.sort()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (Math.max(-1>>1)) { break.toLocaleString().toJSONProtocol }")
+  eval("let (Math.max(-1>>1)) { break.toLocaleString().toJSONProtocol }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {void.prototype.break,new RegExp.toString()}")
+  eval("new {void.prototype.break,new RegExp.toString()}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new IsSmi(debugger).name()")
+  eval("new IsSmi(debugger).name()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new 'a'.concat(undef).sort()")
+  eval("new 'a'.concat(undef).sort()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new {debugger.toObject(),'a' > false}")
+  eval("x = new {debugger.toObject(),'a' > false}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (goto 1.concat(Join(x, undef, native, x, new Object()))) { new RegExp.prototype.name==new RegExp.superConstructor }")
+  eval("if (goto 1.concat(Join(x, undef, native, x, new Object()))) { new RegExp.prototype.name==new RegExp.superConstructor }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return new Object().__defineGetter__(0.2,function(){0.2}).length() }; X(void.isNull<<parseFloat(NaN))")
+  eval("function X(x) { return new Object().__defineGetter__(0.2,function(){0.2}).length() }; X(void.isNull<<parseFloat(NaN))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete continue.toJSONProtocol.toLocaleString()")
+  eval("delete continue.toJSONProtocol.toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (continue.constructor.toObject() in true&&undef.toJSONProtocol) { String(0+break) }")
+  eval("for (continue.constructor.toObject() in true&&undef.toJSONProtocol) { String(0+break) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import true.call(continue)>>break.toString()")
+  eval("import true.call(continue)>>break.toString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label escape(this) > Math.pow(new RegExp)")
+  eval("label escape(this) > Math.pow(new RegExp)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {void}/IsSmi(new Object())")
+  eval("new {void}/IsSmi(new Object())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (native==null?debugger.prototype.name:null.toLocaleString()) { case (NaN.push(this).join()): (break instanceof continue); break; }")
+  eval("switch (native==null?debugger.prototype.name:null.toLocaleString()) { case (NaN.push(this).join()): (break instanceof continue); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new Math.pow(x.push(0))")
+  eval("x = new Math.pow(x.push(0))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new (Array(NaN))")
+  eval("new (Array(NaN))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label IsSmi(new RegExp).toLocaleString()")
+  eval("label IsSmi(new RegExp).toLocaleString()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label NaN.push(1).shift()")
+  eval("label NaN.push(1).shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("{escape(undef),debugger.filter(0.2)}.prototype.-1 > new RegExp[0.2.valueOf()] = new RegExp.prototype.value.splice()")
+  eval("{escape(undef),debugger.filter(0.2)}.prototype.-1 > new RegExp[0.2.valueOf()] = new RegExp.prototype.value.splice()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new Join(0.2, x, continue, debugger, new Object()).size")
+  eval("x = new Join(0.2, x, continue, debugger, new Object()).size")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("with ({ Number(null).name() : Math.pow(true).__defineGetter__(debugger.toString(),function(){false+0.2}) }) { this.{x,break} }")
+  eval("with ({ Number(null).name() : Math.pow(true).__defineGetter__(debugger.toString(),function(){false+0.2}) }) { this.{x,break} }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Math.pow(goto debugger)")
+  eval("new Math.pow(goto debugger)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = IsPrimitive(void.pop())")
+  eval("x = IsPrimitive(void.pop())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new Object().toString().toJSONProtocol")
+  eval("x = new Object().toString().toJSONProtocol")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(this.String(0.2))")
+  eval("Instantiate(this.String(0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let ({-1.call(new RegExp)}) { break.length().splice() }")
+  eval("let ({-1.call(new RegExp)}) { break.length().splice() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import null.size.__defineGetter__(void.filter(x),function(){null.pop()})")
+  eval("import null.size.__defineGetter__(void.filter(x),function(){null.pop()})")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new IsPrimitive(null.superConstructor)")
+  eval("const x = new IsPrimitive(null.superConstructor)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new eval(-1.prototype.continue)")
+  eval("new eval(-1.prototype.continue)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (typeof(Iterator('a'))) { case (0.constructor>>~1): void.__defineGetter__(void,function(){1})/GetFunctionFor(0); break; }")
+  eval("switch (typeof(Iterator('a'))) { case (0.constructor>>~1): void.__defineGetter__(void,function(){1})/GetFunctionFor(0); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for (false instanceof x.add(true.charAt(new RegExp)) in Join(undef.lastIndexOf(break), 0.2.add(new Object()), Iterator(1), {'a',x}, Array(new Object()))) { function () { null }/1&&-1 }")
+  eval("for (false instanceof x.add(true.charAt(new RegExp)) in Join(undef.lastIndexOf(break), 0.2.add(new Object()), Iterator(1), {'a',x}, Array(new Object()))) { function () { null }/1&&-1 }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new escape('a'.concat(undef))")
+  eval("new escape('a'.concat(undef))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(Math.pow(NaN).toText)")
+  eval("new Function(Math.pow(NaN).toText)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new throw new 0(NaN).className()")
+  eval("x = new throw new 0(NaN).className()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete String(GetFunctionFor(new Object()))")
+  eval("delete String(GetFunctionFor(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = Iterator(new Object()).charAt((0.2))")
+  eval("x = Iterator(new Object()).charAt((0.2))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Number(undef.charAt(1)).prototype.undef.lastIndexOf(true).slice(1.className(), undef.filter(-1)) = null<<null.push(parseInt('a'))")
+  eval("Number(undef.charAt(1)).prototype.undef.lastIndexOf(true).slice(1.className(), undef.filter(-1)) = null<<null.push(parseInt('a'))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = {Math.max(1),IsSmi(new Object())}")
+  eval("x = {Math.max(1),IsSmi(new Object())}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch (new Object().exec(0).isNull) { case (escape(IsSmi(false))): false.toObject()-null.size; break; }")
+  eval("switch (new Object().exec(0).isNull) { case (escape(IsSmi(false))): false.toObject()-null.size; break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new 'a'.__defineSetter__(debugger,function(){false}).name()")
+  eval("new 'a'.__defineSetter__(debugger,function(){false}).name()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = debugger?-1:0+true.prototype.1")
+  eval("x = debugger?-1:0+true.prototype.1")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new {false instanceof continue,native.size}")
+  eval("new {false instanceof continue,native.size}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("GetFunctionFor(continue.__lookupGetter__(0.2)).prototype.Math.max(1.splice()) = true.__defineGetter__(undef,function(){NaN}).filter(String(new RegExp))")
+  eval("GetFunctionFor(continue.__lookupGetter__(0.2)).prototype.Math.max(1.splice()) = true.__defineGetter__(undef,function(){NaN}).filter(String(new RegExp))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("null.size-1.toLocaleString().prototype.(this).shift() = GetFunctionFor(native.charAt(break))")
+  eval("null.size-1.toLocaleString().prototype.(this).shift() = GetFunctionFor(native.charAt(break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate((!null.indexOf(-1)))")
+  eval("Instantiate((!null.indexOf(-1)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = {break.sort()}")
+  eval("x = {break.sort()}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new throw new debugger.splice()(this.__lookupGetter__(undef))")
+  eval("new throw new debugger.splice()(this.__lookupGetter__(undef))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("unescape(x[native]).prototype.0.splice().-1.prototype.true = x.prototype.value.className()")
+  eval("unescape(x[native]).prototype.0.splice().-1.prototype.true = x.prototype.value.className()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export x+true.length")
+  eval("export x+true.length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export debugger.indexOf(-1).indexOf(true.constructor)")
+  eval("export debugger.indexOf(-1).indexOf(true.constructor)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("for ({break}.exec(new Object().continue) in eval(0.2.charAt(new Object()))) { throw new null.length(null?break:-1) }")
+  eval("for ({break}.exec(new Object().continue) in eval(0.2.charAt(new Object()))) { throw new null.length(null?break:-1) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = NaN.toLocaleString().toObject()")
+  eval("const x = NaN.toLocaleString().toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return Math.pow(break+false) }; X(Join(true.add(new Object()), null[-1], new RegExp[true], NaN&&debugger, x.charAt(undef)))")
+  eval("function X(x) { return Math.pow(break+false) }; X(Join(true.add(new Object()), null[-1], new RegExp[true], NaN&&debugger, x.charAt(undef)))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("switch ((break).add(true.sort())) { case (undef.charAt(native).__defineGetter__(IsPrimitive(1),function(){NaN<<new RegExp})): -1.__defineSetter__(null,function(){-1}) > this.charCodeAt(this); break; }")
+  eval("switch ((break).add(true.sort())) { case (undef.charAt(native).__defineGetter__(IsPrimitive(1),function(){NaN<<new RegExp})): -1.__defineSetter__(null,function(){-1}) > this.charCodeAt(this); break; }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import return 0.2.length")
+  eval("import return 0.2.length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("continue.join().toText.prototype.Number(debugger).slice(new RegExp.-1, (NaN)) = function () { (!null) }")
+  eval("continue.join().toText.prototype.Number(debugger).slice(new RegExp.-1, (NaN)) = function () { (!null) }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Number(break.__lookupGetter__(false))")
+  eval("export Number(break.__lookupGetter__(false))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Date(return null/x)")
+  eval("new Date(return null/x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export Number(undef).shift()")
+  eval("export Number(undef).shift()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = 1[native]/this&true")
+  eval("const x = 1[native]/this&true")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete typeof(debugger.unshift())")
+  eval("delete typeof(debugger.unshift())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import x.charAt(false)&-1>>x")
+  eval("import x.charAt(false)&-1>>x")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("if (null.toText.superConstructor) { typeof(-1).toString() }")
+  eval("if (null.toText.superConstructor) { typeof(-1).toString() }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (parseFloat(continue.superConstructor)) { 0.2.toText.prototype.value }")
+  eval("let (parseFloat(continue.superConstructor)) { 0.2.toText.prototype.value }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label parseInt(IsSmi(null))")
+  eval("label parseInt(IsSmi(null))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete new Object().valueOf().indexOf(true-x)")
+  eval("delete new Object().valueOf().indexOf(true-x)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new unescape(1.__defineGetter__(new Object(),function(){x}))")
+  eval("x = new unescape(1.__defineGetter__(new Object(),function(){x}))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("let (undef.size.splice()) { 1.constructor.charCodeAt(0+'a') }")
+  eval("let (undef.size.splice()) { 1.constructor.charCodeAt(0+'a') }")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("this.new RegExp.pop().prototype.eval(debugger).toJSONProtocol = unescape(continue).valueOf()")
+  eval("this.new RegExp.pop().prototype.eval(debugger).toJSONProtocol = unescape(continue).valueOf()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("const x = new this.new RegExp.indexOf(unescape(new Object()))")
+  eval("const x = new this.new RegExp.indexOf(unescape(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = new break instanceof false instanceof native.length()")
+  eval("x = new break instanceof false instanceof native.length()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate(parseFloat(x).valueOf())")
+  eval("Instantiate(parseFloat(x).valueOf())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label {escape(true),Math.max(null)}")
+  eval("label {escape(true),Math.max(null)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("'a'>>>=void.prototype.value.prototype.break.prototype.break.indexOf(0.className()) = (!this&native)")
+  eval("'a'>>>=void.prototype.value.prototype.break.prototype.break.indexOf(0.className()) = (!this&native)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("import Number(NaN).push(IsSmi(break))")
+  eval("import Number(NaN).push(IsSmi(break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("export true.exec(void).toObject()")
+  eval("export true.exec(void).toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function({'a',true}/eval(new Object()))")
+  eval("new Function({'a',true}/eval(new Object()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("label null.concat(null).toObject()")
+  eval("label null.concat(null).toObject()")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("native {0.2.length,new RegExp.lastIndexOf(-1)}")
+  eval("native {0.2.length,new RegExp.lastIndexOf(-1)}")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("function X(x) { return Math.max({0.2}) }; X(true.charCodeAt(null).add(new RegExp.name()))")
+  eval("function X(x) { return Math.max({0.2}) }; X(true.charCodeAt(null).add(new RegExp.name()))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("delete -1.lastIndex.length")
+  eval("delete -1.lastIndex.length")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("new Function(0.2[1].call(true > break))")
+  eval("new Function(0.2[1].call(true > break))")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("Instantiate('a'.toLocaleString().splice())")
+  eval("Instantiate('a'.toLocaleString().splice())")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
 
 try {
-	eval("x = typeof(void&&void)")
+  eval("x = typeof(void&&void)")
 } catch (e) { if (e.message.length > 0) { print (e.message); } };
-
diff --git a/test/mjsunit/regress/regress-1201933.js b/test/mjsunit/regress/regress-1201933.js
index ca66cf02a8a8..d4827e41cfa1 100644
--- a/test/mjsunit/regress/regress-1201933.js
+++ b/test/mjsunit/regress/regress-1201933.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1203459.js b/test/mjsunit/regress/regress-1203459.js
index 1714c6093a81..da1e0eda129e 100644
--- a/test/mjsunit/regress/regress-1203459.js
+++ b/test/mjsunit/regress/regress-1203459.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1207276.js b/test/mjsunit/regress/regress-1207276.js
index 5a49b597460c..ce7efe988076 100644
--- a/test/mjsunit/regress/regress-1207276.js
+++ b/test/mjsunit/regress/regress-1207276.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1213516.js b/test/mjsunit/regress/regress-1213516.js
index 39a0567ddb2c..6703f3260418 100644
--- a/test/mjsunit/regress/regress-1213516.js
+++ b/test/mjsunit/regress/regress-1213516.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1213575.js b/test/mjsunit/regress/regress-1213575.js
index 3a84aa88309e..0c3dcc28c604 100644
--- a/test/mjsunit/regress/regress-1213575.js
+++ b/test/mjsunit/regress/regress-1213575.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1215653.js b/test/mjsunit/regress/regress-1215653.js
index c6dc7a12cc1f..881e22c021bf 100644
--- a/test/mjsunit/regress/regress-1215653.js
+++ b/test/mjsunit/regress/regress-1215653.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1254366.js b/test/mjsunit/regress/regress-1254366.js
index c3abf1430c08..2f9e011e94db 100644
--- a/test/mjsunit/regress/regress-1254366.js
+++ b/test/mjsunit/regress/regress-1254366.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1327557.js b/test/mjsunit/regress/regress-1327557.js
index 4626765f1764..bdf4277cca02 100644
--- a/test/mjsunit/regress/regress-1327557.js
+++ b/test/mjsunit/regress/regress-1327557.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-1341167.js b/test/mjsunit/regress/regress-1341167.js
index 5367d23418e6..194a7b886a1a 100644
--- a/test/mjsunit/regress/regress-1341167.js
+++ b/test/mjsunit/regress/regress-1341167.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/bugs/bug-1346700.js b/test/mjsunit/regress/regress-1346700.js
similarity index 95%
rename from test/mjsunit/bugs/bug-1346700.js
rename to test/mjsunit/regress/regress-1346700.js
index 249ae417beb1..fe2d6fac4abc 100644
--- a/test/mjsunit/bugs/bug-1346700.js
+++ b/test/mjsunit/regress/regress-1346700.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2007-2008 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:
diff --git a/test/mjsunit/regress/regress-20070207.js b/test/mjsunit/regress/regress-20070207.js
index 7365f3243417..e90b2ec589d1 100644
--- a/test/mjsunit/regress/regress-20070207.js
+++ b/test/mjsunit/regress/regress-20070207.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-35.js b/test/mjsunit/regress/regress-35.js
new file mode 100644
index 000000000000..2fcdbe75d2bd
--- /dev/null
+++ b/test/mjsunit/regress/regress-35.js
@@ -0,0 +1,33 @@
+// Copyright 2008 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.
+
+var result;
+eval("result = 42; while(true)break");
+assertEquals(42, result);
+
+eval("result = 87; while(false)continue");
+assertEquals(87, result);
diff --git a/test/mjsunit/regress/regress-57.js b/test/mjsunit/regress/regress-57.js
new file mode 100644
index 000000000000..1d410b92e91c
--- /dev/null
+++ b/test/mjsunit/regress/regress-57.js
@@ -0,0 +1,32 @@
+// Copyright 2008 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.
+
+try {
+  delete (void 0).x;
+} catch (e) {
+  print(e.toString());
+}
diff --git a/test/mjsunit/regress/regress-588599.js b/test/mjsunit/regress/regress-588599.js
index ff6590af6f82..a1c16e245a7c 100644
--- a/test/mjsunit/regress/regress-588599.js
+++ b/test/mjsunit/regress/regress-588599.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-662254.js b/test/mjsunit/regress/regress-662254.js
index bc4ef77535d1..daf5e17d0bc3 100644
--- a/test/mjsunit/regress/regress-662254.js
+++ b/test/mjsunit/regress/regress-662254.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-666721.js b/test/mjsunit/regress/regress-666721.js
index 3ee60dcae006..e2c632f2f808 100644
--- a/test/mjsunit/regress/regress-666721.js
+++ b/test/mjsunit/regress/regress-666721.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-667061.js b/test/mjsunit/regress/regress-667061.js
index 7e9774840d06..4d29a1adb6ea 100644
--- a/test/mjsunit/regress/regress-667061.js
+++ b/test/mjsunit/regress/regress-667061.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-670147.js b/test/mjsunit/regress/regress-670147.js
index 680822761216..b5b00d071a55 100644
--- a/test/mjsunit/regress/regress-670147.js
+++ b/test/mjsunit/regress/regress-670147.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-674753.js b/test/mjsunit/regress/regress-674753.js
index 3331f235d146..361b457e47fc 100644
--- a/test/mjsunit/regress/regress-674753.js
+++ b/test/mjsunit/regress/regress-674753.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-676025.js b/test/mjsunit/regress/regress-676025.js
index 9e8a8e268f89..15157f2c09a2 100644
--- a/test/mjsunit/regress/regress-676025.js
+++ b/test/mjsunit/regress/regress-676025.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-678525.js b/test/mjsunit/regress/regress-678525.js
index b00d54c30c56..5ff9c3d9e419 100644
--- a/test/mjsunit/regress/regress-678525.js
+++ b/test/mjsunit/regress/regress-678525.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-682649.js b/test/mjsunit/regress/regress-682649.js
index 5f8b2e702238..f23aed5a854d 100644
--- a/test/mjsunit/regress/regress-682649.js
+++ b/test/mjsunit/regress/regress-682649.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-734862.js b/test/mjsunit/regress/regress-734862.js
index 7e0f02db493d..6239047310f7 100644
--- a/test/mjsunit/regress/regress-734862.js
+++ b/test/mjsunit/regress/regress-734862.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-737588.js b/test/mjsunit/regress/regress-737588.js
index 052b8f14d763..0f71dfc0bc4d 100644
--- a/test/mjsunit/regress/regress-737588.js
+++ b/test/mjsunit/regress/regress-737588.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-780423.js b/test/mjsunit/regress/regress-780423.js
index 6cdb61863093..862db324ab7e 100644
--- a/test/mjsunit/regress/regress-780423.js
+++ b/test/mjsunit/regress/regress-780423.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-799761.js b/test/mjsunit/regress/regress-799761.js
index 9d9661514c6f..d3be1bdadf7c 100644
--- a/test/mjsunit/regress/regress-799761.js
+++ b/test/mjsunit/regress/regress-799761.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-806473.js b/test/mjsunit/regress/regress-806473.js
index f78d9ad20f2e..6d6485d6e9ed 100644
--- a/test/mjsunit/regress/regress-806473.js
+++ b/test/mjsunit/regress/regress-806473.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-842017.js b/test/mjsunit/regress/regress-842017.js
index 1967a997c77e..3a367bbddb5c 100644
--- a/test/mjsunit/regress/regress-842017.js
+++ b/test/mjsunit/regress/regress-842017.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-874178.js b/test/mjsunit/regress/regress-874178.js
index 69ee8e9ff5f9..0ed5434a1ea9 100644
--- a/test/mjsunit/regress/regress-874178.js
+++ b/test/mjsunit/regress/regress-874178.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-875031.js b/test/mjsunit/regress/regress-875031.js
index 2ff8fd6e0db0..f18b08475b2e 100644
--- a/test/mjsunit/regress/regress-875031.js
+++ b/test/mjsunit/regress/regress-875031.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-877615.js b/test/mjsunit/regress/regress-877615.js
index 530dcbbde75a..d35aba62d3aa 100644
--- a/test/mjsunit/regress/regress-877615.js
+++ b/test/mjsunit/regress/regress-877615.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-892742.js b/test/mjsunit/regress/regress-892742.js
index 67fb1536aa36..a60395e872b3 100644
--- a/test/mjsunit/regress/regress-892742.js
+++ b/test/mjsunit/regress/regress-892742.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-900055.js b/test/mjsunit/regress/regress-900055.js
index bdeafb00a949..9a02f222c2d5 100644
--- a/test/mjsunit/regress/regress-900055.js
+++ b/test/mjsunit/regress/regress-900055.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-900966.js b/test/mjsunit/regress/regress-900966.js
index ee6a8cc217d9..b95d10ec08ba 100644
--- a/test/mjsunit/regress/regress-900966.js
+++ b/test/mjsunit/regress/regress-900966.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-925537.js b/test/mjsunit/regress/regress-925537.js
index 65438b7499eb..11582eaf9055 100644
--- a/test/mjsunit/regress/regress-925537.js
+++ b/test/mjsunit/regress/regress-925537.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-937896.js b/test/mjsunit/regress/regress-937896.js
index fb270aecfa47..e8e5ef21b7f8 100644
--- a/test/mjsunit/regress/regress-937896.js
+++ b/test/mjsunit/regress/regress-937896.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-990205.js b/test/mjsunit/regress/regress-990205.js
index 90d7381f4309..1ab5bf88b425 100644
--- a/test/mjsunit/regress/regress-990205.js
+++ b/test/mjsunit/regress/regress-990205.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-992733.js b/test/mjsunit/regress/regress-992733.js
index bf60b97c2e0a..d0f7511c0cb8 100644
--- a/test/mjsunit/regress/regress-992733.js
+++ b/test/mjsunit/regress/regress-992733.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-996542.js b/test/mjsunit/regress/regress-996542.js
index 3a4b96f5120a..8fc704eb28d1 100644
--- a/test/mjsunit/regress/regress-996542.js
+++ b/test/mjsunit/regress/regress-996542.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/regress/regress-998565.js b/test/mjsunit/regress/regress-998565.js
index 5c06f7731804..ff66154b3e0c 100644
--- a/test/mjsunit/regress/regress-998565.js
+++ b/test/mjsunit/regress/regress-998565.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/scanner.js b/test/mjsunit/scanner.js
index 4f75f80b9081..516a4e88803c 100644
--- a/test/mjsunit/scanner.js
+++ b/test/mjsunit/scanner.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/smi-negative-zero.js b/test/mjsunit/smi-negative-zero.js
index c65d4f1b3319..99ddc97207a3 100644
--- a/test/mjsunit/smi-negative-zero.js
+++ b/test/mjsunit/smi-negative-zero.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/smi-ops.js b/test/mjsunit/smi-ops.js
index c30b097c6f07..bdd7509c9e40 100644
--- a/test/mjsunit/smi-ops.js
+++ b/test/mjsunit/smi-ops.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/sparse-array-reverse.js b/test/mjsunit/sparse-array-reverse.js
index a2ba3e4e2f3d..9b9f32382e07 100644
--- a/test/mjsunit/sparse-array-reverse.js
+++ b/test/mjsunit/sparse-array-reverse.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/sparse-array.js b/test/mjsunit/sparse-array.js
index 19fee378eb03..0952f2caaab2 100644
--- a/test/mjsunit/sparse-array.js
+++ b/test/mjsunit/sparse-array.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/str-to-num.js b/test/mjsunit/str-to-num.js
index 907b8a45240f..12a371624725 100644
--- a/test/mjsunit/str-to-num.js
+++ b/test/mjsunit/str-to-num.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/stress-array-push.js b/test/mjsunit/stress-array-push.js
index ce7ed573c6dc..1db2e2ae8308 100644
--- a/test/mjsunit/stress-array-push.js
+++ b/test/mjsunit/stress-array-push.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/strict-equals.js b/test/mjsunit/strict-equals.js
index 82bff21ca094..d080ce8c4c7b 100644
--- a/test/mjsunit/strict-equals.js
+++ b/test/mjsunit/strict-equals.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-case.js b/test/mjsunit/string-case.js
index dd318114c71d..13dcd3ea8156 100644
--- a/test/mjsunit/string-case.js
+++ b/test/mjsunit/string-case.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-charat.js b/test/mjsunit/string-charat.js
index 665c874472ff..8ec8f1e08f5b 100644
--- a/test/mjsunit/string-charat.js
+++ b/test/mjsunit/string-charat.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-charcodeat.js b/test/mjsunit/string-charcodeat.js
index 3327c94512ec..f66dd3ef6859 100644
--- a/test/mjsunit/string-charcodeat.js
+++ b/test/mjsunit/string-charcodeat.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-flatten.js b/test/mjsunit/string-flatten.js
index 9086391eb867..91877b2df63d 100644
--- a/test/mjsunit/string-flatten.js
+++ b/test/mjsunit/string-flatten.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-index.js b/test/mjsunit/string-index.js
index 36ea74d79be8..2256286eece5 100644
--- a/test/mjsunit/string-index.js
+++ b/test/mjsunit/string-index.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-indexof.js b/test/mjsunit/string-indexof.js
index 1ce9384ac65d..5b37a4819653 100644
--- a/test/mjsunit/string-indexof.js
+++ b/test/mjsunit/string-indexof.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-lastindexof.js b/test/mjsunit/string-lastindexof.js
index dba0c1221e0f..bf46666ee074 100644
--- a/test/mjsunit/string-lastindexof.js
+++ b/test/mjsunit/string-lastindexof.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-localecompare.js b/test/mjsunit/string-localecompare.js
index aa33f990418e..90a18133361c 100644
--- a/test/mjsunit/string-localecompare.js
+++ b/test/mjsunit/string-localecompare.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-search.js b/test/mjsunit/string-search.js
index 5d2cdfe314e1..36891c24cb6e 100644
--- a/test/mjsunit/string-search.js
+++ b/test/mjsunit/string-search.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/string-split.js b/test/mjsunit/string-split.js
index bf9ad94242e8..59d3ad3ee387 100644
--- a/test/mjsunit/string-split.js
+++ b/test/mjsunit/string-split.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/substr.js b/test/mjsunit/substr.js
index 63058d356ec5..8c276f941800 100644
--- a/test/mjsunit/substr.js
+++ b/test/mjsunit/substr.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/testcfg.py b/test/mjsunit/testcfg.py
index 67ee85d3ef8b..f65365d22852 100644
--- a/test/mjsunit/testcfg.py
+++ b/test/mjsunit/testcfg.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -58,6 +58,9 @@ def GetCommand(self):
     result += [framework, self.file]
     return result
 
+  def GetSource(self):
+    return open(self.file).read()
+
 
 class MjsunitTestConfiguration(test.TestConfiguration):
 
diff --git a/test/mjsunit/this-in-callbacks.js b/test/mjsunit/this-in-callbacks.js
index 1b42ecc9aa4d..d50be6c193fd 100644
--- a/test/mjsunit/this-in-callbacks.js
+++ b/test/mjsunit/this-in-callbacks.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/this.js b/test/mjsunit/this.js
index 902606372ce9..0019eb2262b1 100644
--- a/test/mjsunit/this.js
+++ b/test/mjsunit/this.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/throw-exception-for-null-access.js b/test/mjsunit/throw-exception-for-null-access.js
index 016a10e116b5..018cfef9ecb7 100644
--- a/test/mjsunit/throw-exception-for-null-access.js
+++ b/test/mjsunit/throw-exception-for-null-access.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/to-precision.js b/test/mjsunit/to-precision.js
index e42fb8f8b73c..04c7d7614eeb 100644
--- a/test/mjsunit/to-precision.js
+++ b/test/mjsunit/to-precision.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/tobool.js b/test/mjsunit/tobool.js
index 25d2c93d1580..65bffb624f1d 100644
--- a/test/mjsunit/tobool.js
+++ b/test/mjsunit/tobool.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/toint32.js b/test/mjsunit/toint32.js
index e73e33cdafce..e1a64a6c5f36 100644
--- a/test/mjsunit/toint32.js
+++ b/test/mjsunit/toint32.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/touint32.js b/test/mjsunit/touint32.js
index b6cf6ef88c20..f06bddfcf581 100644
--- a/test/mjsunit/touint32.js
+++ b/test/mjsunit/touint32.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/try-finally-nested.js b/test/mjsunit/try-finally-nested.js
index f6380ee1f3c7..c05f96a9ebb3 100644
--- a/test/mjsunit/try-finally-nested.js
+++ b/test/mjsunit/try-finally-nested.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/try.js b/test/mjsunit/try.js
index 555c847fbef5..a3f443376bca 100644
--- a/test/mjsunit/try.js
+++ b/test/mjsunit/try.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/try_catch_scopes.js b/test/mjsunit/try_catch_scopes.js
index 3005cff3c289..c5bada273f79 100644
--- a/test/mjsunit/try_catch_scopes.js
+++ b/test/mjsunit/try_catch_scopes.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/unicode-string-to-number.js b/test/mjsunit/unicode-string-to-number.js
index 5d08b7b89f9a..13a7acfbc26f 100644
--- a/test/mjsunit/unicode-string-to-number.js
+++ b/test/mjsunit/unicode-string-to-number.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/unicode-test.js b/test/mjsunit/unicode-test.js
index 512b594832b1..581b3b7c37c7 100644
--- a/test/mjsunit/unicode-test.js
+++ b/test/mjsunit/unicode-test.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/unusual-constructor.js b/test/mjsunit/unusual-constructor.js
index 58fe6446a503..4e1ec2ec2dac 100644
--- a/test/mjsunit/unusual-constructor.js
+++ b/test/mjsunit/unusual-constructor.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/uri.js b/test/mjsunit/uri.js
index 775230066c09..178ff1f2a7fe 100644
--- a/test/mjsunit/uri.js
+++ b/test/mjsunit/uri.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/value-callic-prototype-change.js b/test/mjsunit/value-callic-prototype-change.js
index 44103e3bdc60..52f06297b024 100644
--- a/test/mjsunit/value-callic-prototype-change.js
+++ b/test/mjsunit/value-callic-prototype-change.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/var.js b/test/mjsunit/var.js
index f81c05e819ec..5999d7028eeb 100644
--- a/test/mjsunit/var.js
+++ b/test/mjsunit/var.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/with-leave.js b/test/mjsunit/with-leave.js
index 1478e7d4fa3d..ded62caf57e8 100644
--- a/test/mjsunit/with-leave.js
+++ b/test/mjsunit/with-leave.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/with-parameter-access.js b/test/mjsunit/with-parameter-access.js
index 8e055ee099f6..747da22bff3d 100644
--- a/test/mjsunit/with-parameter-access.js
+++ b/test/mjsunit/with-parameter-access.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mjsunit/with-value.js b/test/mjsunit/with-value.js
index d2003009d9ec..a4da1fad9c1c 100644
--- a/test/mjsunit/with-value.js
+++ b/test/mjsunit/with-value.js
@@ -1,4 +1,4 @@
-// Copyright 2008 Google Inc. All Rights Reserved.
+// Copyright 2008 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:
diff --git a/test/mozilla/mozilla.status b/test/mozilla/mozilla.status
index 24b3fda3e015..52f9c43aaba5 100644
--- a/test/mozilla/mozilla.status
+++ b/test/mozilla/mozilla.status
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -165,8 +165,10 @@ js1_5/Regress/regress-98901: PASS || FAIL
 js1_5/extensions/regress-371636: PASS || FAIL
 
 
-# Test depends on GC timings. Inherently flaky.
+# Tests depend on GC timings. Inherently flaky.
 js1_5/GC/regress-383269-01: PASS || FAIL
+js1_5/GC/regress-383269-02: PASS || FAIL
+js1_5/Regress/regress-404755: PASS || FAIL
 
 
 ##################### INCOMPATIBLE TESTS #####################
@@ -752,6 +754,7 @@ js1_5/decompilation/regress-406555: PASS || FAIL
 
 # This test is flaky because of the default timer resolution on Windows.
 js1_5/extensions/regress-363258: PASS || FAIL
+mozilla/js1_5/GC/regress-383269-02: PASS, FLAKY IF $mode == debug
 
 [ $FAST == yes ]
 
diff --git a/test/mozilla/testcfg.py b/test/mozilla/testcfg.py
index 96fe4f31ebed..8193b82fa31e 100644
--- a/test/mozilla/testcfg.py
+++ b/test/mozilla/testcfg.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -82,6 +82,9 @@ def GetCommand(self):
   def GetName(self):
     return self.path[-1]
 
+  def GetSource(self):
+    return open(self.filename).read()
+
 
 class MozillaTestConfiguration(test.TestConfiguration):
 
diff --git a/tools/js2c.py b/tools/js2c.py
index ac9c6b2099a4..181edb6d0fc6 100755
--- a/tools/js2c.py
+++ b/tools/js2c.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 #
-# Copyright 2006 Google Inc. All Rights Reserved.
+# Copyright 2006-2008 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:
diff --git a/tools/linux-tick-processor.py b/tools/linux-tick-processor.py
index 339c96b51608..794dceadb1e9 100755
--- a/tools/linux-tick-processor.py
+++ b/tools/linux-tick-processor.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 #
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/tools/presubmit.py b/tools/presubmit.py
index 32b78d98d7aa..aa2c6b8dc98b 100755
--- a/tools/presubmit.py
+++ b/tools/presubmit.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 #
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -30,7 +30,8 @@
 
 import optparse
 import os
-from os.path import abspath, join, dirname
+from os.path import abspath, join, dirname, basename
+import re
 import sys
 import subprocess
 
@@ -105,7 +106,7 @@ def Run(self, path):
     return True
 
   def IgnoreDir(self, name):
-    return name.startswith('.')
+    return name.startswith('.') or name == 'data'
 
   def IgnoreFile(self, name):
     return name.startswith('.')
@@ -143,19 +144,18 @@ def ProcessFiles(self, files):
     return process.wait() == 0
 
 
-class CopyrightProcessor(SourceFileProcessor):
+COPYRIGHT_HEADER_PATTERN = re.compile(
+    r'Copyright [\d-]*2008 the V8 project authors. All rights reserved.')
+
+class SourceProcessor(SourceFileProcessor):
   """
   Check that all files include a copyright notice.
   """
 
   RELEVANT_EXTENSIONS = ['.js', '.cc', '.h', '.py', '.c', 'SConscript',
       'SConstruct', '.status']
-  FILES_TO_IGNORE = ['pcre_chartables.c', 'config.h',
-      'earley-boyer.js', 'raytrace.js']
   def IsRelevant(self, name):
-    if name in CopyrightProcessor.FILES_TO_IGNORE:
-      return False
-    for ext in CopyrightProcessor.RELEVANT_EXTENSIONS:
+    for ext in SourceProcessor.RELEVANT_EXTENSIONS:
       if name.endswith(ext):
         return True
     return False
@@ -163,11 +163,27 @@ def IsRelevant(self, name):
   def GetPathsToSearch(self):
     return ['.']
 
+  def IgnoreDir(self, name):
+    return (super(SourceProcessor, self).IgnoreDir(name)
+              or (name == 'third_party')
+              or (name == 'obj'))
+
+  IGNORE_COPYRIGHTS = ['earley-boyer.js', 'raytrace.js', 'crypto.js']
+  IGNORE_TABS = IGNORE_COPYRIGHTS + ['unicode-test.js',
+      'html-comments.js']
+
   def ProcessContents(self, name, contents):
-    if not 'Copyright' in contents:
-      print "No copyright in %s." % name
-      return False
-    return True
+    result = True
+    base = basename(name)
+    if not base in SourceProcessor.IGNORE_TABS:
+      if '\t' in contents:
+        print "%s contains tabs" % name
+        result = False
+    if not base in SourceProcessor.IGNORE_COPYRIGHTS:
+      if not COPYRIGHT_HEADER_PATTERN.search(contents):
+        print "%s is missing a correct copyright header." % name
+        result = False
+    return result
 
   def ProcessFiles(self, files):
     success = True
@@ -195,7 +211,7 @@ def Main():
   success = True
   if not options.no_lint:
     success = CppLintProcessor().Run(workspace) and success
-  success = CopyrightProcessor().Run(workspace) and success
+  success = SourceProcessor().Run(workspace) and success
   if success:
     return 0
   else:
diff --git a/tools/splaytree.py b/tools/splaytree.py
index 86f52f378400..4353b645235a 100644
--- a/tools/splaytree.py
+++ b/tools/splaytree.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/tools/test.py b/tools/test.py
index c23ca2962a7e..0111722be8c5 100755
--- a/tools/test.py
+++ b/tools/test.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 #
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
@@ -259,6 +259,9 @@ def IsNegative(self):
   def IsFailureOutput(self, output):
     return output.exit_code != 0
 
+  def GetSource(self):
+    return "(no source available)"
+
   def Run(self):
     command = self.GetCommand()
     full_command = self.context.processor(command)
@@ -946,8 +949,12 @@ def BuildOptions():
   result.add_option("-t", "--timeout", help="Timeout in seconds",
       default=60, type="int")
   result.add_option("--arch", help='The architecture to run tests for',
-      default=ARCH_GUESS)
+      default='none')
+  result.add_option("--simulator", help="Run tests with architecture simulator",
+      default='none')
   result.add_option("--special-command", default=None)
+  result.add_option("--cat", help="Print the source of the tests",
+      default=False, action="store_true")
   return result
 
 
@@ -959,6 +966,21 @@ def ProcessOptions(options):
     if not mode in ['debug', 'release']:
       print "Unknown mode %s" % mode
       return False
+  if options.simulator != 'none':
+    # Simulator argument was set. Make sure arch and simulator agree.
+    if options.simulator != options.arch:
+      if options.arch == 'none':
+        options.arch = options.simulator
+      else:
+        print "Architecture %s does not match sim %s" %(options.arch, options.simulator)
+        return False
+    # Ensure that the simulator argument is handed down to scons.
+    options.scons_flags.append("simulator=" + options.simulator)
+  else:
+    # If options.arch is not set by the command line and no simulator setting
+    # was found, set the arch to the guess.
+    if options.arch == 'none':
+      options.arch = ARCH_GUESS
   return True
 
 
@@ -1069,6 +1091,7 @@ def Main():
   # List the tests
   all_cases = [ ]
   all_unused = [ ]
+  unclassified_tests = [ ]
   for path in paths:
     for mode in options.mode:
       env = {
@@ -1077,10 +1100,24 @@ def Main():
         'arch': options.arch
       }
       test_list = root.ListTests([], path, context, mode)
+      unclassified_tests += test_list
       (cases, unused_rules) = config.ClassifyTests(test_list, env)
       all_cases += cases
       all_unused.append(unused_rules)
 
+  if options.cat:
+    visited = set()
+    for test in unclassified_tests:
+      key = tuple(test.path)
+      if key in visited:
+        continue
+      visited.add(key)
+      print "--- begin source: %s ---" % test.GetLabel()
+      source = test.GetSource().strip()
+      print source
+      print "--- end source: %s ---" % test.GetLabel()
+    return 0
+
 #  for rule in unused_rules:
 #    print "Rule for '%s' was not used." % '/'.join([str(s) for s in rule.path])
 
diff --git a/tools/tickprocessor.py b/tools/tickprocessor.py
index 07dd94a75a7c..5ea8e28659e2 100644
--- a/tools/tickprocessor.py
+++ b/tools/tickprocessor.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/tools/utils.py b/tools/utils.py
index 7149b5d71259..e10bb7be81ba 100644
--- a/tools/utils.py
+++ b/tools/utils.py
@@ -1,4 +1,4 @@
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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:
diff --git a/tools/v8.xcodeproj/project.pbxproj b/tools/v8.xcodeproj/project.pbxproj
new file mode 100644
index 000000000000..616520427e60
--- /dev/null
+++ b/tools/v8.xcodeproj/project.pbxproj
@@ -0,0 +1,1128 @@
+// !$*UTF8*$!
+{
+	archiveVersion = 1;
+	classes = {
+	};
+	objectVersion = 45;
+	objects = {
+
+/* Begin PBXAggregateTarget section */
+		7BF891930E73098D000BAF8A /* All */ = {
+			isa = PBXAggregateTarget;
+			buildConfigurationList = 7BF8919F0E7309BE000BAF8A /* Build configuration list for PBXAggregateTarget "All" */;
+			buildPhases = (
+			);
+			dependencies = (
+				7BF8919B0E7309AD000BAF8A /* PBXTargetDependency */,
+				7BF891970E73099F000BAF8A /* PBXTargetDependency */,
+				7BF891990E73099F000BAF8A /* PBXTargetDependency */,
+			);
+			name = All;
+			productName = All;
+		};
+/* End PBXAggregateTarget section */
+
+/* Begin PBXBuildFile section */
+		8900116C0E71CA2300F91F35 /* libraries.cc in Sources */ = {isa = PBXBuildFile; fileRef = 8900116B0E71CA2300F91F35 /* libraries.cc */; };
+		893CCE640E71D83700357A03 /* code-stubs.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1110E719B8F00D62E90 /* code-stubs.cc */; };
+		897F767F0E71B690007ACF34 /* shell.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1B50E719C0900D62E90 /* shell.cc */; };
+		897F76840E71B6B1007ACF34 /* libjscre.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 897FF1BF0E719CB600D62E90 /* libjscre.a */; };
+		897F76850E71B6B1007ACF34 /* libv8.a in Frameworks */ = {isa = PBXBuildFile; fileRef = 8970F2F00E719FB2006AE7B5 /* libv8.a */; };
+		897FF1C40E719D6B00D62E90 /* pcre_compile.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EA0E719B3500D62E90 /* pcre_compile.cpp */; };
+		897FF1C50E719D6E00D62E90 /* pcre_exec.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EB0E719B3500D62E90 /* pcre_exec.cpp */; };
+		897FF1C60E719D7100D62E90 /* pcre_tables.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0ED0E719B3500D62E90 /* pcre_tables.cpp */; };
+		897FF1C70E719D7300D62E90 /* pcre_ucp_searchfuncs.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EE0E719B3500D62E90 /* pcre_ucp_searchfuncs.cpp */; };
+		897FF1C80E719D7600D62E90 /* pcre_xclass.cpp in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0EF0E719B3500D62E90 /* pcre_xclass.cpp */; };
+		89A88DEC0E71A5FF0043BA31 /* accessors.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0F60E719B8F00D62E90 /* accessors.cc */; };
+		89A88DED0E71A6000043BA31 /* allocation.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0F80E719B8F00D62E90 /* allocation.cc */; };
+		89A88DEE0E71A6010043BA31 /* api.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF0FA0E719B8F00D62E90 /* api.cc */; };
+		89A88DEF0E71A60A0043BA31 /* assembler-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1010E719B8F00D62E90 /* assembler-ia32.cc */; };
+		89A88DF00E71A60A0043BA31 /* assembler.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1030E719B8F00D62E90 /* assembler.cc */; };
+		89A88DF10E71A60B0043BA31 /* ast.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1050E719B8F00D62E90 /* ast.cc */; };
+		89A88DF20E71A60C0043BA31 /* bootstrapper.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1070E719B8F00D62E90 /* bootstrapper.cc */; };
+		89A88DF40E71A6160043BA31 /* builtins-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF10A0E719B8F00D62E90 /* builtins-ia32.cc */; };
+		89A88DF50E71A6170043BA31 /* builtins.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF10B0E719B8F00D62E90 /* builtins.cc */; };
+		89A88DF60E71A61C0043BA31 /* checks.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF10F0E719B8F00D62E90 /* checks.cc */; };
+		89A88DF70E71A6240043BA31 /* codegen-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1150E719B8F00D62E90 /* codegen-ia32.cc */; };
+		89A88DF80E71A6260043BA31 /* codegen.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1170E719B8F00D62E90 /* codegen.cc */; };
+		89A88DF90E71A6430043BA31 /* compiler.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1190E719B8F00D62E90 /* compiler.cc */; };
+		89A88DFA0E71A6440043BA31 /* contexts.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF11C0E719B8F00D62E90 /* contexts.cc */; };
+		89A88DFB0E71A6440043BA31 /* conversions.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF11F0E719B8F00D62E90 /* conversions.cc */; };
+		89A88DFC0E71A6460043BA31 /* counters.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1210E719B8F00D62E90 /* counters.cc */; };
+		89A88DFD0E71A6470043BA31 /* cpu-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1240E719B8F00D62E90 /* cpu-ia32.cc */; };
+		89A88DFE0E71A6480043BA31 /* dateparser.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1260E719B8F00D62E90 /* dateparser.cc */; };
+		89A88DFF0E71A6530043BA31 /* debug.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1280E719B8F00D62E90 /* debug.cc */; };
+		89A88E000E71A6540043BA31 /* disasm-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF12B0E719B8F00D62E90 /* disasm-ia32.cc */; };
+		89A88E010E71A6550043BA31 /* disassembler.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF12D0E719B8F00D62E90 /* disassembler.cc */; };
+		89A88E020E71A65A0043BA31 /* dtoa-config.c in Sources */ = {isa = PBXBuildFile; fileRef = 897FF12F0E719B8F00D62E90 /* dtoa-config.c */; };
+		89A88E030E71A65B0043BA31 /* execution.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1300E719B8F00D62E90 /* execution.cc */; };
+		89A88E040E71A65D0043BA31 /* factory.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1320E719B8F00D62E90 /* factory.cc */; };
+		89A88E050E71A65D0043BA31 /* flags.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1350E719B8F00D62E90 /* flags.cc */; };
+		89A88E060E71A6600043BA31 /* frames-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1390E719B8F00D62E90 /* frames-ia32.cc */; };
+		89A88E070E71A6610043BA31 /* frames.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF13C0E719B8F00D62E90 /* frames.cc */; };
+		89A88E080E71A6620043BA31 /* global-handles.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF13E0E719B8F00D62E90 /* global-handles.cc */; };
+		89A88E090E71A6640043BA31 /* handles.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1420E719B8F00D62E90 /* handles.cc */; };
+		89A88E0A0E71A6650043BA31 /* hashmap.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1440E719B8F00D62E90 /* hashmap.cc */; };
+		89A88E0B0E71A66C0043BA31 /* heap.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1470E719B8F00D62E90 /* heap.cc */; };
+		89A88E0C0E71A66D0043BA31 /* ic-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF14A0E719B8F00D62E90 /* ic-ia32.cc */; };
+		89A88E0D0E71A66E0043BA31 /* ic.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF14C0E719B8F00D62E90 /* ic.cc */; };
+		89A88E0E0E71A66F0043BA31 /* jsregexp.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF14E0E719B8F00D62E90 /* jsregexp.cc */; };
+		89A88E0F0E71A6740043BA31 /* log.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1520E719B8F00D62E90 /* log.cc */; };
+		89A88E100E71A6770043BA31 /* macro-assembler-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1560E719B8F00D62E90 /* macro-assembler-ia32.cc */; };
+		89A88E110E71A6780043BA31 /* mark-compact.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1590E719B8F00D62E90 /* mark-compact.cc */; };
+		89A88E120E71A67A0043BA31 /* messages.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF15C0E719B8F00D62E90 /* messages.cc */; };
+		89A88E130E71A6860043BA31 /* objects-debug.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1600E719B8F00D62E90 /* objects-debug.cc */; };
+		89A88E140E71A6870043BA31 /* objects.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1620E719B8F00D62E90 /* objects.cc */; };
+		89A88E150E71A68C0043BA31 /* parser.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1640E719B8F00D62E90 /* parser.cc */; };
+		89A88E160E71A68E0043BA31 /* platform-macos.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1670E719B8F00D62E90 /* platform-macos.cc */; };
+		89A88E170E71A6950043BA31 /* prettyprinter.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF16B0E719B8F00D62E90 /* prettyprinter.cc */; };
+		89A88E180E71A6960043BA31 /* property.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF16D0E719B8F00D62E90 /* property.cc */; };
+		89A88E190E71A6970043BA31 /* rewriter.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF16F0E719B8F00D62E90 /* rewriter.cc */; };
+		89A88E1A0E71A69B0043BA31 /* runtime.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1710E719B8F00D62E90 /* runtime.cc */; };
+		89A88E1B0E71A69D0043BA31 /* scanner.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1730E719B8F00D62E90 /* scanner.cc */; };
+		89A88E1C0E71A69E0043BA31 /* scopeinfo.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1760E719B8F00D62E90 /* scopeinfo.cc */; };
+		89A88E1D0E71A6A00043BA31 /* scopes.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1780E719B8F00D62E90 /* scopes.cc */; };
+		89A88E1E0E71A6A30043BA31 /* serialize.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF17A0E719B8F00D62E90 /* serialize.cc */; };
+		89A88E1F0E71A6B40043BA31 /* snapshot-common.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1820E719B8F00D62E90 /* snapshot-common.cc */; };
+		89A88E200E71A6B60043BA31 /* snapshot-empty.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1830E719B8F00D62E90 /* snapshot-empty.cc */; };
+		89A88E210E71A6B70043BA31 /* spaces.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1860E719B8F00D62E90 /* spaces.cc */; };
+		89A88E220E71A6BC0043BA31 /* string-stream.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1880E719B8F00D62E90 /* string-stream.cc */; };
+		89A88E230E71A6BE0043BA31 /* stub-cache-ia32.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF18B0E719B8F00D62E90 /* stub-cache-ia32.cc */; };
+		89A88E240E71A6BF0043BA31 /* stub-cache.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF18C0E719B8F00D62E90 /* stub-cache.cc */; };
+		89A88E250E71A6C20043BA31 /* token.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF18E0E719B8F00D62E90 /* token.cc */; };
+		89A88E260E71A6C90043BA31 /* top.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1900E719B8F00D62E90 /* top.cc */; };
+		89A88E270E71A6CB0043BA31 /* unicode.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1930E719B8F00D62E90 /* unicode.cc */; };
+		89A88E280E71A6CC0043BA31 /* usage-analyzer.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1950E719B8F00D62E90 /* usage-analyzer.cc */; };
+		89A88E290E71A6CE0043BA31 /* utils.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1970E719B8F00D62E90 /* utils.cc */; };
+		89A88E2A0E71A6D00043BA31 /* v8-counters.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1990E719B8F00D62E90 /* v8-counters.cc */; };
+		89A88E2B0E71A6D10043BA31 /* v8.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF19B0E719B8F00D62E90 /* v8.cc */; };
+		89A88E2C0E71A6D20043BA31 /* v8threads.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF19D0E719B8F00D62E90 /* v8threads.cc */; };
+		89A88E2D0E71A6D50043BA31 /* variables.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF19F0E719B8F00D62E90 /* variables.cc */; };
+		89A88E2E0E71A6D60043BA31 /* zone.cc in Sources */ = {isa = PBXBuildFile; fileRef = 897FF1A20E719B8F00D62E90 /* zone.cc */; };
+/* End PBXBuildFile section */
+
+/* Begin PBXContainerItemProxy section */
+		7BF891960E73099F000BAF8A /* PBXContainerItemProxy */ = {
+			isa = PBXContainerItemProxy;
+			containerPortal = 8915B8680E719336009C4E19 /* Project object */;
+			proxyType = 1;
+			remoteGlobalIDString = 8970F2EF0E719FB2006AE7B5;
+			remoteInfo = v8;
+		};
+		7BF891980E73099F000BAF8A /* PBXContainerItemProxy */ = {
+			isa = PBXContainerItemProxy;
+			containerPortal = 8915B8680E719336009C4E19 /* Project object */;
+			proxyType = 1;
+			remoteGlobalIDString = 897F76790E71B4CC007ACF34;
+			remoteInfo = v8_shell;
+		};
+		7BF8919A0E7309AD000BAF8A /* PBXContainerItemProxy */ = {
+			isa = PBXContainerItemProxy;
+			containerPortal = 8915B8680E719336009C4E19 /* Project object */;
+			proxyType = 1;
+			remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
+			remoteInfo = jscre;
+		};
+		897F76800E71B6AC007ACF34 /* PBXContainerItemProxy */ = {
+			isa = PBXContainerItemProxy;
+			containerPortal = 8915B8680E719336009C4E19 /* Project object */;
+			proxyType = 1;
+			remoteGlobalIDString = 897FF1BE0E719CB600D62E90;
+			remoteInfo = jscre;
+		};
+		897F76820E71B6AC007ACF34 /* PBXContainerItemProxy */ = {
+			isa = PBXContainerItemProxy;
+			containerPortal = 8915B8680E719336009C4E19 /* Project object */;
+			proxyType = 1;
+			remoteGlobalIDString = 8970F2EF0E719FB2006AE7B5;
+			remoteInfo = v8;
+		};
+/* End PBXContainerItemProxy section */
+
+/* Begin PBXFileReference section */
+		8900116B0E71CA2300F91F35 /* libraries.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = libraries.cc; sourceTree = "<group>"; };
+		8970F2F00E719FB2006AE7B5 /* libv8.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libv8.a; sourceTree = BUILT_PRODUCTS_DIR; };
+		897F767A0E71B4CC007ACF34 /* v8_shell */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = v8_shell; sourceTree = BUILT_PRODUCTS_DIR; };
+		897FF0D40E719A8500D62E90 /* v8-debug.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "v8-debug.h"; sourceTree = "<group>"; };
+		897FF0D50E719A8500D62E90 /* v8.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = v8.h; sourceTree = "<group>"; };
+		897FF0E00E719B3500D62E90 /* COPYING */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = COPYING; sourceTree = "<group>"; };
+		897FF0E10E719B3500D62E90 /* dtoa.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = dtoa.c; sourceTree = "<group>"; };
+		897FF0E30E719B3500D62E90 /* ASCIICType.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ASCIICType.h; sourceTree = "<group>"; };
+		897FF0E40E719B3500D62E90 /* AUTHORS */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = AUTHORS; sourceTree = "<group>"; };
+		897FF0E50E719B3500D62E90 /* config.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = config.h; sourceTree = "<group>"; };
+		897FF0E60E719B3500D62E90 /* COPYING */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = COPYING; sourceTree = "<group>"; };
+		897FF0E70E719B3500D62E90 /* LICENSE */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = LICENSE; sourceTree = "<group>"; };
+		897FF0E80E719B3500D62E90 /* pcre.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = pcre.h; sourceTree = "<group>"; };
+		897FF0E90E719B3500D62E90 /* pcre_chartables.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = pcre_chartables.c; sourceTree = "<group>"; };
+		897FF0EA0E719B3500D62E90 /* pcre_compile.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = pcre_compile.cpp; sourceTree = "<group>"; };
+		897FF0EB0E719B3500D62E90 /* pcre_exec.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = pcre_exec.cpp; sourceTree = "<group>"; };
+		897FF0EC0E719B3500D62E90 /* pcre_internal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = pcre_internal.h; sourceTree = "<group>"; };
+		897FF0ED0E719B3500D62E90 /* pcre_tables.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = pcre_tables.cpp; sourceTree = "<group>"; };
+		897FF0EE0E719B3500D62E90 /* pcre_ucp_searchfuncs.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = pcre_ucp_searchfuncs.cpp; sourceTree = "<group>"; };
+		897FF0EF0E719B3500D62E90 /* pcre_xclass.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = pcre_xclass.cpp; sourceTree = "<group>"; };
+		897FF0F00E719B3500D62E90 /* ucpinternal.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ucpinternal.h; sourceTree = "<group>"; };
+		897FF0F10E719B3500D62E90 /* ucptable.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ucptable.cpp; sourceTree = "<group>"; };
+		897FF0F60E719B8F00D62E90 /* accessors.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = accessors.cc; sourceTree = "<group>"; };
+		897FF0F70E719B8F00D62E90 /* accessors.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = accessors.h; sourceTree = "<group>"; };
+		897FF0F80E719B8F00D62E90 /* allocation.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = allocation.cc; sourceTree = "<group>"; };
+		897FF0F90E719B8F00D62E90 /* allocation.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = allocation.h; sourceTree = "<group>"; };
+		897FF0FA0E719B8F00D62E90 /* api.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = api.cc; sourceTree = "<group>"; };
+		897FF0FB0E719B8F00D62E90 /* api.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = api.h; sourceTree = "<group>"; };
+		897FF0FC0E719B8F00D62E90 /* arguments.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = arguments.h; sourceTree = "<group>"; };
+		897FF0FD0E719B8F00D62E90 /* assembler-arm-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "assembler-arm-inl.h"; sourceTree = "<group>"; };
+		897FF0FE0E719B8F00D62E90 /* assembler-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "assembler-arm.cc"; sourceTree = "<group>"; };
+		897FF0FF0E719B8F00D62E90 /* assembler-arm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "assembler-arm.h"; sourceTree = "<group>"; };
+		897FF1000E719B8F00D62E90 /* assembler-ia32-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "assembler-ia32-inl.h"; sourceTree = "<group>"; };
+		897FF1010E719B8F00D62E90 /* assembler-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "assembler-ia32.cc"; sourceTree = "<group>"; };
+		897FF1020E719B8F00D62E90 /* assembler-ia32.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "assembler-ia32.h"; sourceTree = "<group>"; };
+		897FF1030E719B8F00D62E90 /* assembler.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = assembler.cc; sourceTree = "<group>"; };
+		897FF1040E719B8F00D62E90 /* assembler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = assembler.h; sourceTree = "<group>"; };
+		897FF1050E719B8F00D62E90 /* ast.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ast.cc; sourceTree = "<group>"; };
+		897FF1060E719B8F00D62E90 /* ast.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ast.h; sourceTree = "<group>"; };
+		897FF1070E719B8F00D62E90 /* bootstrapper.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = bootstrapper.cc; sourceTree = "<group>"; };
+		897FF1080E719B8F00D62E90 /* bootstrapper.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = bootstrapper.h; sourceTree = "<group>"; };
+		897FF1090E719B8F00D62E90 /* builtins-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "builtins-arm.cc"; sourceTree = "<group>"; };
+		897FF10A0E719B8F00D62E90 /* builtins-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "builtins-ia32.cc"; sourceTree = "<group>"; };
+		897FF10B0E719B8F00D62E90 /* builtins.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = builtins.cc; sourceTree = "<group>"; };
+		897FF10C0E719B8F00D62E90 /* builtins.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = builtins.h; sourceTree = "<group>"; };
+		897FF10D0E719B8F00D62E90 /* char-predicates-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "char-predicates-inl.h"; sourceTree = "<group>"; };
+		897FF10E0E719B8F00D62E90 /* char-predicates.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "char-predicates.h"; sourceTree = "<group>"; };
+		897FF10F0E719B8F00D62E90 /* checks.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = checks.cc; sourceTree = "<group>"; };
+		897FF1100E719B8F00D62E90 /* checks.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = checks.h; sourceTree = "<group>"; };
+		897FF1110E719B8F00D62E90 /* code-stubs.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "code-stubs.cc"; sourceTree = "<group>"; };
+		897FF1120E719B8F00D62E90 /* code-stubs.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "code-stubs.h"; sourceTree = "<group>"; };
+		897FF1130E719B8F00D62E90 /* code.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = code.h; sourceTree = "<group>"; };
+		897FF1140E719B8F00D62E90 /* codegen-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "codegen-arm.cc"; sourceTree = "<group>"; };
+		897FF1150E719B8F00D62E90 /* codegen-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "codegen-ia32.cc"; sourceTree = "<group>"; };
+		897FF1160E719B8F00D62E90 /* codegen-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "codegen-inl.h"; sourceTree = "<group>"; };
+		897FF1170E719B8F00D62E90 /* codegen.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = codegen.cc; sourceTree = "<group>"; };
+		897FF1180E719B8F00D62E90 /* codegen.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = codegen.h; sourceTree = "<group>"; };
+		897FF1190E719B8F00D62E90 /* compiler.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = compiler.cc; sourceTree = "<group>"; };
+		897FF11A0E719B8F00D62E90 /* compiler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = compiler.h; sourceTree = "<group>"; };
+		897FF11B0E719B8F00D62E90 /* constants-arm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "constants-arm.h"; sourceTree = "<group>"; };
+		897FF11C0E719B8F00D62E90 /* contexts.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = contexts.cc; sourceTree = "<group>"; };
+		897FF11D0E719B8F00D62E90 /* contexts.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = contexts.h; sourceTree = "<group>"; };
+		897FF11E0E719B8F00D62E90 /* conversions-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "conversions-inl.h"; sourceTree = "<group>"; };
+		897FF11F0E719B8F00D62E90 /* conversions.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = conversions.cc; sourceTree = "<group>"; };
+		897FF1200E719B8F00D62E90 /* conversions.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = conversions.h; sourceTree = "<group>"; };
+		897FF1210E719B8F00D62E90 /* counters.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = counters.cc; sourceTree = "<group>"; };
+		897FF1220E719B8F00D62E90 /* counters.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = counters.h; sourceTree = "<group>"; };
+		897FF1230E719B8F00D62E90 /* cpu-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "cpu-arm.cc"; sourceTree = "<group>"; };
+		897FF1240E719B8F00D62E90 /* cpu-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "cpu-ia32.cc"; sourceTree = "<group>"; };
+		897FF1250E719B8F00D62E90 /* cpu.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = cpu.h; sourceTree = "<group>"; };
+		897FF1260E719B8F00D62E90 /* dateparser.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = dateparser.cc; sourceTree = "<group>"; };
+		897FF1270E719B8F00D62E90 /* dateparser.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = dateparser.h; sourceTree = "<group>"; };
+		897FF1280E719B8F00D62E90 /* debug.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = debug.cc; sourceTree = "<group>"; };
+		897FF1290E719B8F00D62E90 /* debug.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = debug.h; sourceTree = "<group>"; };
+		897FF12A0E719B8F00D62E90 /* disasm-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "disasm-arm.cc"; sourceTree = "<group>"; };
+		897FF12B0E719B8F00D62E90 /* disasm-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "disasm-ia32.cc"; sourceTree = "<group>"; };
+		897FF12C0E719B8F00D62E90 /* disasm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = disasm.h; sourceTree = "<group>"; };
+		897FF12D0E719B8F00D62E90 /* disassembler.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = disassembler.cc; sourceTree = "<group>"; };
+		897FF12E0E719B8F00D62E90 /* disassembler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = disassembler.h; sourceTree = "<group>"; };
+		897FF12F0E719B8F00D62E90 /* dtoa-config.c */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.c; path = "dtoa-config.c"; sourceTree = "<group>"; };
+		897FF1300E719B8F00D62E90 /* execution.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = execution.cc; sourceTree = "<group>"; };
+		897FF1310E719B8F00D62E90 /* execution.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = execution.h; sourceTree = "<group>"; };
+		897FF1320E719B8F00D62E90 /* factory.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = factory.cc; sourceTree = "<group>"; };
+		897FF1330E719B8F00D62E90 /* factory.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = factory.h; sourceTree = "<group>"; };
+		897FF1340E719B8F00D62E90 /* flags-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "flags-inl.h"; sourceTree = "<group>"; };
+		897FF1350E719B8F00D62E90 /* flags.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = flags.cc; sourceTree = "<group>"; };
+		897FF1360E719B8F00D62E90 /* flags.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = flags.h; sourceTree = "<group>"; };
+		897FF1370E719B8F00D62E90 /* frames-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "frames-arm.cc"; sourceTree = "<group>"; };
+		897FF1380E719B8F00D62E90 /* frames-arm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "frames-arm.h"; sourceTree = "<group>"; };
+		897FF1390E719B8F00D62E90 /* frames-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "frames-ia32.cc"; sourceTree = "<group>"; };
+		897FF13A0E719B8F00D62E90 /* frames-ia32.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "frames-ia32.h"; sourceTree = "<group>"; };
+		897FF13B0E719B8F00D62E90 /* frames-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "frames-inl.h"; sourceTree = "<group>"; };
+		897FF13C0E719B8F00D62E90 /* frames.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = frames.cc; sourceTree = "<group>"; };
+		897FF13D0E719B8F00D62E90 /* frames.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = frames.h; sourceTree = "<group>"; };
+		897FF13E0E719B8F00D62E90 /* global-handles.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "global-handles.cc"; sourceTree = "<group>"; };
+		897FF13F0E719B8F00D62E90 /* global-handles.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "global-handles.h"; sourceTree = "<group>"; };
+		897FF1400E719B8F00D62E90 /* globals.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = globals.h; sourceTree = "<group>"; };
+		897FF1410E719B8F00D62E90 /* handles-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "handles-inl.h"; sourceTree = "<group>"; };
+		897FF1420E719B8F00D62E90 /* handles.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = handles.cc; sourceTree = "<group>"; };
+		897FF1430E719B8F00D62E90 /* handles.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = handles.h; sourceTree = "<group>"; };
+		897FF1440E719B8F00D62E90 /* hashmap.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = hashmap.cc; sourceTree = "<group>"; };
+		897FF1450E719B8F00D62E90 /* hashmap.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = hashmap.h; sourceTree = "<group>"; };
+		897FF1460E719B8F00D62E90 /* heap-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "heap-inl.h"; sourceTree = "<group>"; };
+		897FF1470E719B8F00D62E90 /* heap.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = heap.cc; sourceTree = "<group>"; };
+		897FF1480E719B8F00D62E90 /* heap.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = heap.h; sourceTree = "<group>"; };
+		897FF1490E719B8F00D62E90 /* ic-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "ic-arm.cc"; sourceTree = "<group>"; };
+		897FF14A0E719B8F00D62E90 /* ic-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "ic-ia32.cc"; sourceTree = "<group>"; };
+		897FF14B0E719B8F00D62E90 /* ic-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "ic-inl.h"; sourceTree = "<group>"; };
+		897FF14C0E719B8F00D62E90 /* ic.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = ic.cc; sourceTree = "<group>"; };
+		897FF14D0E719B8F00D62E90 /* ic.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = ic.h; sourceTree = "<group>"; };
+		897FF14E0E719B8F00D62E90 /* jsregexp.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = jsregexp.cc; sourceTree = "<group>"; };
+		897FF14F0E719B8F00D62E90 /* jsregexp.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = jsregexp.h; sourceTree = "<group>"; };
+		897FF1500E719B8F00D62E90 /* list-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "list-inl.h"; sourceTree = "<group>"; };
+		897FF1510E719B8F00D62E90 /* list.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = list.h; sourceTree = "<group>"; };
+		897FF1520E719B8F00D62E90 /* log.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = log.cc; sourceTree = "<group>"; };
+		897FF1530E719B8F00D62E90 /* log.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = log.h; sourceTree = "<group>"; };
+		897FF1540E719B8F00D62E90 /* macro-assembler-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "macro-assembler-arm.cc"; sourceTree = "<group>"; };
+		897FF1550E719B8F00D62E90 /* macro-assembler-arm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "macro-assembler-arm.h"; sourceTree = "<group>"; };
+		897FF1560E719B8F00D62E90 /* macro-assembler-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "macro-assembler-ia32.cc"; sourceTree = "<group>"; };
+		897FF1570E719B8F00D62E90 /* macro-assembler-ia32.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "macro-assembler-ia32.h"; sourceTree = "<group>"; };
+		897FF1580E719B8F00D62E90 /* macro-assembler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "macro-assembler.h"; sourceTree = "<group>"; };
+		897FF1590E719B8F00D62E90 /* mark-compact.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "mark-compact.cc"; sourceTree = "<group>"; };
+		897FF15A0E719B8F00D62E90 /* mark-compact.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "mark-compact.h"; sourceTree = "<group>"; };
+		897FF15B0E719B8F00D62E90 /* memory.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = memory.h; sourceTree = "<group>"; };
+		897FF15C0E719B8F00D62E90 /* messages.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = messages.cc; sourceTree = "<group>"; };
+		897FF15D0E719B8F00D62E90 /* messages.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = messages.h; sourceTree = "<group>"; };
+		897FF15E0E719B8F00D62E90 /* mksnapshot.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = mksnapshot.cc; sourceTree = "<group>"; };
+		897FF15F0E719B8F00D62E90 /* natives.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = natives.h; sourceTree = "<group>"; };
+		897FF1600E719B8F00D62E90 /* objects-debug.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "objects-debug.cc"; sourceTree = "<group>"; };
+		897FF1610E719B8F00D62E90 /* objects-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "objects-inl.h"; sourceTree = "<group>"; };
+		897FF1620E719B8F00D62E90 /* objects.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = objects.cc; sourceTree = "<group>"; };
+		897FF1630E719B8F00D62E90 /* objects.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = objects.h; sourceTree = "<group>"; };
+		897FF1640E719B8F00D62E90 /* parser.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = parser.cc; sourceTree = "<group>"; };
+		897FF1650E719B8F00D62E90 /* parser.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = parser.h; sourceTree = "<group>"; };
+		897FF1660E719B8F00D62E90 /* platform-linux.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "platform-linux.cc"; sourceTree = "<group>"; };
+		897FF1670E719B8F00D62E90 /* platform-macos.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "platform-macos.cc"; sourceTree = "<group>"; };
+		897FF1680E719B8F00D62E90 /* platform-nullos.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "platform-nullos.cc"; sourceTree = "<group>"; };
+		897FF1690E719B8F00D62E90 /* platform-win32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "platform-win32.cc"; sourceTree = "<group>"; };
+		897FF16A0E719B8F00D62E90 /* platform.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = platform.h; sourceTree = "<group>"; };
+		897FF16B0E719B8F00D62E90 /* prettyprinter.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = prettyprinter.cc; sourceTree = "<group>"; };
+		897FF16C0E719B8F00D62E90 /* prettyprinter.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = prettyprinter.h; sourceTree = "<group>"; };
+		897FF16D0E719B8F00D62E90 /* property.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = property.cc; sourceTree = "<group>"; };
+		897FF16E0E719B8F00D62E90 /* property.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = property.h; sourceTree = "<group>"; };
+		897FF16F0E719B8F00D62E90 /* rewriter.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = rewriter.cc; sourceTree = "<group>"; };
+		897FF1700E719B8F00D62E90 /* rewriter.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = rewriter.h; sourceTree = "<group>"; };
+		897FF1710E719B8F00D62E90 /* runtime.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = runtime.cc; sourceTree = "<group>"; };
+		897FF1720E719B8F00D62E90 /* runtime.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = runtime.h; sourceTree = "<group>"; };
+		897FF1730E719B8F00D62E90 /* scanner.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = scanner.cc; sourceTree = "<group>"; };
+		897FF1740E719B8F00D62E90 /* scanner.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = scanner.h; sourceTree = "<group>"; };
+		897FF1750E719B8F00D62E90 /* SConscript */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text; path = SConscript; sourceTree = "<group>"; };
+		897FF1760E719B8F00D62E90 /* scopeinfo.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = scopeinfo.cc; sourceTree = "<group>"; };
+		897FF1770E719B8F00D62E90 /* scopeinfo.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = scopeinfo.h; sourceTree = "<group>"; };
+		897FF1780E719B8F00D62E90 /* scopes.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = scopes.cc; sourceTree = "<group>"; };
+		897FF1790E719B8F00D62E90 /* scopes.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = scopes.h; sourceTree = "<group>"; };
+		897FF17A0E719B8F00D62E90 /* serialize.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = serialize.cc; sourceTree = "<group>"; };
+		897FF17B0E719B8F00D62E90 /* serialize.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = serialize.h; sourceTree = "<group>"; };
+		897FF17C0E719B8F00D62E90 /* shell.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = shell.h; sourceTree = "<group>"; };
+		897FF17D0E719B8F00D62E90 /* simulator-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "simulator-arm.cc"; sourceTree = "<group>"; };
+		897FF17E0E719B8F00D62E90 /* simulator-arm.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "simulator-arm.h"; sourceTree = "<group>"; };
+		897FF17F0E719B8F00D62E90 /* simulator-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "simulator-ia32.cc"; sourceTree = "<group>"; };
+		897FF1800E719B8F00D62E90 /* simulator-ia32.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "simulator-ia32.h"; sourceTree = "<group>"; };
+		897FF1810E719B8F00D62E90 /* smart-pointer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "smart-pointer.h"; sourceTree = "<group>"; };
+		897FF1820E719B8F00D62E90 /* snapshot-common.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "snapshot-common.cc"; sourceTree = "<group>"; };
+		897FF1830E719B8F00D62E90 /* snapshot-empty.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "snapshot-empty.cc"; sourceTree = "<group>"; };
+		897FF1840E719B8F00D62E90 /* snapshot.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = snapshot.h; sourceTree = "<group>"; };
+		897FF1850E719B8F00D62E90 /* spaces-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "spaces-inl.h"; sourceTree = "<group>"; };
+		897FF1860E719B8F00D62E90 /* spaces.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = spaces.cc; sourceTree = "<group>"; };
+		897FF1870E719B8F00D62E90 /* spaces.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = spaces.h; sourceTree = "<group>"; };
+		897FF1880E719B8F00D62E90 /* string-stream.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "string-stream.cc"; sourceTree = "<group>"; };
+		897FF1890E719B8F00D62E90 /* string-stream.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "string-stream.h"; sourceTree = "<group>"; };
+		897FF18A0E719B8F00D62E90 /* stub-cache-arm.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "stub-cache-arm.cc"; sourceTree = "<group>"; };
+		897FF18B0E719B8F00D62E90 /* stub-cache-ia32.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "stub-cache-ia32.cc"; sourceTree = "<group>"; };
+		897FF18C0E719B8F00D62E90 /* stub-cache.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "stub-cache.cc"; sourceTree = "<group>"; };
+		897FF18D0E719B8F00D62E90 /* stub-cache.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "stub-cache.h"; sourceTree = "<group>"; };
+		897FF18E0E719B8F00D62E90 /* token.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = token.cc; sourceTree = "<group>"; };
+		897FF18F0E719B8F00D62E90 /* token.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = token.h; sourceTree = "<group>"; };
+		897FF1900E719B8F00D62E90 /* top.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = top.cc; sourceTree = "<group>"; };
+		897FF1910E719B8F00D62E90 /* top.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = top.h; sourceTree = "<group>"; };
+		897FF1920E719B8F00D62E90 /* unicode-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "unicode-inl.h"; sourceTree = "<group>"; };
+		897FF1930E719B8F00D62E90 /* unicode.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = unicode.cc; sourceTree = "<group>"; };
+		897FF1940E719B8F00D62E90 /* unicode.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = unicode.h; sourceTree = "<group>"; };
+		897FF1950E719B8F00D62E90 /* usage-analyzer.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "usage-analyzer.cc"; sourceTree = "<group>"; };
+		897FF1960E719B8F00D62E90 /* usage-analyzer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "usage-analyzer.h"; sourceTree = "<group>"; };
+		897FF1970E719B8F00D62E90 /* utils.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = utils.cc; sourceTree = "<group>"; };
+		897FF1980E719B8F00D62E90 /* utils.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = utils.h; sourceTree = "<group>"; };
+		897FF1990E719B8F00D62E90 /* v8-counters.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = "v8-counters.cc"; sourceTree = "<group>"; };
+		897FF19A0E719B8F00D62E90 /* v8-counters.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "v8-counters.h"; sourceTree = "<group>"; };
+		897FF19B0E719B8F00D62E90 /* v8.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = v8.cc; sourceTree = "<group>"; };
+		897FF19C0E719B8F00D62E90 /* v8.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = v8.h; sourceTree = "<group>"; };
+		897FF19D0E719B8F00D62E90 /* v8threads.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = v8threads.cc; sourceTree = "<group>"; };
+		897FF19E0E719B8F00D62E90 /* v8threads.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = v8threads.h; sourceTree = "<group>"; };
+		897FF19F0E719B8F00D62E90 /* variables.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = variables.cc; sourceTree = "<group>"; };
+		897FF1A00E719B8F00D62E90 /* variables.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = variables.h; sourceTree = "<group>"; };
+		897FF1A10E719B8F00D62E90 /* zone-inl.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = "zone-inl.h"; sourceTree = "<group>"; };
+		897FF1A20E719B8F00D62E90 /* zone.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = zone.cc; sourceTree = "<group>"; };
+		897FF1A30E719B8F00D62E90 /* zone.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = zone.h; sourceTree = "<group>"; };
+		897FF1A60E719BC100D62E90 /* apinatives.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = apinatives.js; sourceTree = "<group>"; };
+		897FF1A70E719BC100D62E90 /* array.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = array.js; sourceTree = "<group>"; };
+		897FF1A80E719BC100D62E90 /* date-delay.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = "date-delay.js"; sourceTree = "<group>"; };
+		897FF1A90E719BC100D62E90 /* debug-delay.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = "debug-delay.js"; sourceTree = "<group>"; };
+		897FF1AA0E719BC100D62E90 /* math.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = math.js; sourceTree = "<group>"; };
+		897FF1AB0E719BC100D62E90 /* messages.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = messages.js; sourceTree = "<group>"; };
+		897FF1AC0E719BC100D62E90 /* mirror-delay.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = "mirror-delay.js"; sourceTree = "<group>"; };
+		897FF1AD0E719BC100D62E90 /* regexp-delay.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = "regexp-delay.js"; sourceTree = "<group>"; };
+		897FF1AE0E719BC100D62E90 /* runtime.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = runtime.js; sourceTree = "<group>"; };
+		897FF1AF0E719BC100D62E90 /* string.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = string.js; sourceTree = "<group>"; };
+		897FF1B00E719BC100D62E90 /* uri.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = uri.js; sourceTree = "<group>"; };
+		897FF1B10E719BC100D62E90 /* v8natives.js */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.javascript; path = v8natives.js; sourceTree = "<group>"; };
+		897FF1B50E719C0900D62E90 /* shell.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = shell.cc; sourceTree = "<group>"; };
+		897FF1B60E719C2300D62E90 /* js2c.py */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.python; path = js2c.py; sourceTree = "<group>"; };
+		897FF1B70E719C2E00D62E90 /* macros.py */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.script.python; name = macros.py; path = ../src/macros.py; sourceTree = "<group>"; };
+		897FF1BF0E719CB600D62E90 /* libjscre.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = libjscre.a; sourceTree = BUILT_PRODUCTS_DIR; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+		8970F2EE0E719FB2006AE7B5 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		897F76780E71B4CC007ACF34 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				897F76840E71B6B1007ACF34 /* libjscre.a in Frameworks */,
+				897F76850E71B6B1007ACF34 /* libv8.a in Frameworks */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		897FF1BD0E719CB600D62E90 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+		8915B8660E719336009C4E19 = {
+			isa = PBXGroup;
+			children = (
+				897FF0CF0E71996900D62E90 /* v8 */,
+				897FF1C00E719CB600D62E90 /* Products */,
+			);
+			sourceTree = "<group>";
+		};
+		897FF0CF0E71996900D62E90 /* v8 */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0D10E71999E00D62E90 /* include */,
+				897FF0D00E71999800D62E90 /* src */,
+				897FF1B30E719BCE00D62E90 /* samples */,
+				897FF1B40E719BE800D62E90 /* tools */,
+			);
+			name = v8;
+			path = ..;
+			sourceTree = "<group>";
+		};
+		897FF0D00E71999800D62E90 /* src */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0D70E719AB300D62E90 /* C++ */,
+				897FF0D80E719ABA00D62E90 /* js */,
+				897FF0DE0E719B3400D62E90 /* third_party */,
+				89A9C1630E71C8E300BE6CCA /* generated */,
+			);
+			path = src;
+			sourceTree = "<group>";
+		};
+		897FF0D10E71999E00D62E90 /* include */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0D40E719A8500D62E90 /* v8-debug.h */,
+				897FF0D50E719A8500D62E90 /* v8.h */,
+			);
+			path = include;
+			sourceTree = "<group>";
+		};
+		897FF0D70E719AB300D62E90 /* C++ */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0F60E719B8F00D62E90 /* accessors.cc */,
+				897FF0F70E719B8F00D62E90 /* accessors.h */,
+				897FF0F80E719B8F00D62E90 /* allocation.cc */,
+				897FF0F90E719B8F00D62E90 /* allocation.h */,
+				897FF0FA0E719B8F00D62E90 /* api.cc */,
+				897FF0FB0E719B8F00D62E90 /* api.h */,
+				897FF0FC0E719B8F00D62E90 /* arguments.h */,
+				897FF0FD0E719B8F00D62E90 /* assembler-arm-inl.h */,
+				897FF0FE0E719B8F00D62E90 /* assembler-arm.cc */,
+				897FF0FF0E719B8F00D62E90 /* assembler-arm.h */,
+				897FF1000E719B8F00D62E90 /* assembler-ia32-inl.h */,
+				897FF1010E719B8F00D62E90 /* assembler-ia32.cc */,
+				897FF1020E719B8F00D62E90 /* assembler-ia32.h */,
+				897FF1030E719B8F00D62E90 /* assembler.cc */,
+				897FF1040E719B8F00D62E90 /* assembler.h */,
+				897FF1050E719B8F00D62E90 /* ast.cc */,
+				897FF1060E719B8F00D62E90 /* ast.h */,
+				897FF1070E719B8F00D62E90 /* bootstrapper.cc */,
+				897FF1080E719B8F00D62E90 /* bootstrapper.h */,
+				897FF1090E719B8F00D62E90 /* builtins-arm.cc */,
+				897FF10A0E719B8F00D62E90 /* builtins-ia32.cc */,
+				897FF10B0E719B8F00D62E90 /* builtins.cc */,
+				897FF10C0E719B8F00D62E90 /* builtins.h */,
+				897FF10D0E719B8F00D62E90 /* char-predicates-inl.h */,
+				897FF10E0E719B8F00D62E90 /* char-predicates.h */,
+				897FF10F0E719B8F00D62E90 /* checks.cc */,
+				897FF1100E719B8F00D62E90 /* checks.h */,
+				897FF1110E719B8F00D62E90 /* code-stubs.cc */,
+				897FF1120E719B8F00D62E90 /* code-stubs.h */,
+				897FF1130E719B8F00D62E90 /* code.h */,
+				897FF1140E719B8F00D62E90 /* codegen-arm.cc */,
+				897FF1150E719B8F00D62E90 /* codegen-ia32.cc */,
+				897FF1160E719B8F00D62E90 /* codegen-inl.h */,
+				897FF1170E719B8F00D62E90 /* codegen.cc */,
+				897FF1180E719B8F00D62E90 /* codegen.h */,
+				897FF1190E719B8F00D62E90 /* compiler.cc */,
+				897FF11A0E719B8F00D62E90 /* compiler.h */,
+				897FF11B0E719B8F00D62E90 /* constants-arm.h */,
+				897FF11C0E719B8F00D62E90 /* contexts.cc */,
+				897FF11D0E719B8F00D62E90 /* contexts.h */,
+				897FF11E0E719B8F00D62E90 /* conversions-inl.h */,
+				897FF11F0E719B8F00D62E90 /* conversions.cc */,
+				897FF1200E719B8F00D62E90 /* conversions.h */,
+				897FF1210E719B8F00D62E90 /* counters.cc */,
+				897FF1220E719B8F00D62E90 /* counters.h */,
+				897FF1230E719B8F00D62E90 /* cpu-arm.cc */,
+				897FF1240E719B8F00D62E90 /* cpu-ia32.cc */,
+				897FF1250E719B8F00D62E90 /* cpu.h */,
+				897FF1260E719B8F00D62E90 /* dateparser.cc */,
+				897FF1270E719B8F00D62E90 /* dateparser.h */,
+				897FF1280E719B8F00D62E90 /* debug.cc */,
+				897FF1290E719B8F00D62E90 /* debug.h */,
+				897FF12A0E719B8F00D62E90 /* disasm-arm.cc */,
+				897FF12B0E719B8F00D62E90 /* disasm-ia32.cc */,
+				897FF12C0E719B8F00D62E90 /* disasm.h */,
+				897FF12D0E719B8F00D62E90 /* disassembler.cc */,
+				897FF12E0E719B8F00D62E90 /* disassembler.h */,
+				897FF12F0E719B8F00D62E90 /* dtoa-config.c */,
+				897FF1300E719B8F00D62E90 /* execution.cc */,
+				897FF1310E719B8F00D62E90 /* execution.h */,
+				897FF1320E719B8F00D62E90 /* factory.cc */,
+				897FF1330E719B8F00D62E90 /* factory.h */,
+				897FF1340E719B8F00D62E90 /* flags-inl.h */,
+				897FF1350E719B8F00D62E90 /* flags.cc */,
+				897FF1360E719B8F00D62E90 /* flags.h */,
+				897FF1370E719B8F00D62E90 /* frames-arm.cc */,
+				897FF1380E719B8F00D62E90 /* frames-arm.h */,
+				897FF1390E719B8F00D62E90 /* frames-ia32.cc */,
+				897FF13A0E719B8F00D62E90 /* frames-ia32.h */,
+				897FF13B0E719B8F00D62E90 /* frames-inl.h */,
+				897FF13C0E719B8F00D62E90 /* frames.cc */,
+				897FF13D0E719B8F00D62E90 /* frames.h */,
+				897FF13E0E719B8F00D62E90 /* global-handles.cc */,
+				897FF13F0E719B8F00D62E90 /* global-handles.h */,
+				897FF1400E719B8F00D62E90 /* globals.h */,
+				897FF1410E719B8F00D62E90 /* handles-inl.h */,
+				897FF1420E719B8F00D62E90 /* handles.cc */,
+				897FF1430E719B8F00D62E90 /* handles.h */,
+				897FF1440E719B8F00D62E90 /* hashmap.cc */,
+				897FF1450E719B8F00D62E90 /* hashmap.h */,
+				897FF1460E719B8F00D62E90 /* heap-inl.h */,
+				897FF1470E719B8F00D62E90 /* heap.cc */,
+				897FF1480E719B8F00D62E90 /* heap.h */,
+				897FF1490E719B8F00D62E90 /* ic-arm.cc */,
+				897FF14A0E719B8F00D62E90 /* ic-ia32.cc */,
+				897FF14B0E719B8F00D62E90 /* ic-inl.h */,
+				897FF14C0E719B8F00D62E90 /* ic.cc */,
+				897FF14D0E719B8F00D62E90 /* ic.h */,
+				897FF14E0E719B8F00D62E90 /* jsregexp.cc */,
+				897FF14F0E719B8F00D62E90 /* jsregexp.h */,
+				897FF1500E719B8F00D62E90 /* list-inl.h */,
+				897FF1510E719B8F00D62E90 /* list.h */,
+				897FF1520E719B8F00D62E90 /* log.cc */,
+				897FF1530E719B8F00D62E90 /* log.h */,
+				897FF1540E719B8F00D62E90 /* macro-assembler-arm.cc */,
+				897FF1550E719B8F00D62E90 /* macro-assembler-arm.h */,
+				897FF1560E719B8F00D62E90 /* macro-assembler-ia32.cc */,
+				897FF1570E719B8F00D62E90 /* macro-assembler-ia32.h */,
+				897FF1580E719B8F00D62E90 /* macro-assembler.h */,
+				897FF1590E719B8F00D62E90 /* mark-compact.cc */,
+				897FF15A0E719B8F00D62E90 /* mark-compact.h */,
+				897FF15B0E719B8F00D62E90 /* memory.h */,
+				897FF15C0E719B8F00D62E90 /* messages.cc */,
+				897FF15D0E719B8F00D62E90 /* messages.h */,
+				897FF15E0E719B8F00D62E90 /* mksnapshot.cc */,
+				897FF15F0E719B8F00D62E90 /* natives.h */,
+				897FF1600E719B8F00D62E90 /* objects-debug.cc */,
+				897FF1610E719B8F00D62E90 /* objects-inl.h */,
+				897FF1620E719B8F00D62E90 /* objects.cc */,
+				897FF1630E719B8F00D62E90 /* objects.h */,
+				897FF1640E719B8F00D62E90 /* parser.cc */,
+				897FF1650E719B8F00D62E90 /* parser.h */,
+				897FF1660E719B8F00D62E90 /* platform-linux.cc */,
+				897FF1670E719B8F00D62E90 /* platform-macos.cc */,
+				897FF1680E719B8F00D62E90 /* platform-nullos.cc */,
+				897FF1690E719B8F00D62E90 /* platform-win32.cc */,
+				897FF16A0E719B8F00D62E90 /* platform.h */,
+				897FF16B0E719B8F00D62E90 /* prettyprinter.cc */,
+				897FF16C0E719B8F00D62E90 /* prettyprinter.h */,
+				897FF16D0E719B8F00D62E90 /* property.cc */,
+				897FF16E0E719B8F00D62E90 /* property.h */,
+				897FF16F0E719B8F00D62E90 /* rewriter.cc */,
+				897FF1700E719B8F00D62E90 /* rewriter.h */,
+				897FF1710E719B8F00D62E90 /* runtime.cc */,
+				897FF1720E719B8F00D62E90 /* runtime.h */,
+				897FF1730E719B8F00D62E90 /* scanner.cc */,
+				897FF1740E719B8F00D62E90 /* scanner.h */,
+				897FF1750E719B8F00D62E90 /* SConscript */,
+				897FF1760E719B8F00D62E90 /* scopeinfo.cc */,
+				897FF1770E719B8F00D62E90 /* scopeinfo.h */,
+				897FF1780E719B8F00D62E90 /* scopes.cc */,
+				897FF1790E719B8F00D62E90 /* scopes.h */,
+				897FF17A0E719B8F00D62E90 /* serialize.cc */,
+				897FF17B0E719B8F00D62E90 /* serialize.h */,
+				897FF17C0E719B8F00D62E90 /* shell.h */,
+				897FF17D0E719B8F00D62E90 /* simulator-arm.cc */,
+				897FF17E0E719B8F00D62E90 /* simulator-arm.h */,
+				897FF17F0E719B8F00D62E90 /* simulator-ia32.cc */,
+				897FF1800E719B8F00D62E90 /* simulator-ia32.h */,
+				897FF1810E719B8F00D62E90 /* smart-pointer.h */,
+				897FF1820E719B8F00D62E90 /* snapshot-common.cc */,
+				897FF1830E719B8F00D62E90 /* snapshot-empty.cc */,
+				897FF1840E719B8F00D62E90 /* snapshot.h */,
+				897FF1850E719B8F00D62E90 /* spaces-inl.h */,
+				897FF1860E719B8F00D62E90 /* spaces.cc */,
+				897FF1870E719B8F00D62E90 /* spaces.h */,
+				897FF1880E719B8F00D62E90 /* string-stream.cc */,
+				897FF1890E719B8F00D62E90 /* string-stream.h */,
+				897FF18A0E719B8F00D62E90 /* stub-cache-arm.cc */,
+				897FF18B0E719B8F00D62E90 /* stub-cache-ia32.cc */,
+				897FF18C0E719B8F00D62E90 /* stub-cache.cc */,
+				897FF18D0E719B8F00D62E90 /* stub-cache.h */,
+				897FF18E0E719B8F00D62E90 /* token.cc */,
+				897FF18F0E719B8F00D62E90 /* token.h */,
+				897FF1900E719B8F00D62E90 /* top.cc */,
+				897FF1910E719B8F00D62E90 /* top.h */,
+				897FF1920E719B8F00D62E90 /* unicode-inl.h */,
+				897FF1930E719B8F00D62E90 /* unicode.cc */,
+				897FF1940E719B8F00D62E90 /* unicode.h */,
+				897FF1950E719B8F00D62E90 /* usage-analyzer.cc */,
+				897FF1960E719B8F00D62E90 /* usage-analyzer.h */,
+				897FF1970E719B8F00D62E90 /* utils.cc */,
+				897FF1980E719B8F00D62E90 /* utils.h */,
+				897FF1990E719B8F00D62E90 /* v8-counters.cc */,
+				897FF19A0E719B8F00D62E90 /* v8-counters.h */,
+				897FF19B0E719B8F00D62E90 /* v8.cc */,
+				897FF19C0E719B8F00D62E90 /* v8.h */,
+				897FF19D0E719B8F00D62E90 /* v8threads.cc */,
+				897FF19E0E719B8F00D62E90 /* v8threads.h */,
+				897FF19F0E719B8F00D62E90 /* variables.cc */,
+				897FF1A00E719B8F00D62E90 /* variables.h */,
+				897FF1A10E719B8F00D62E90 /* zone-inl.h */,
+				897FF1A20E719B8F00D62E90 /* zone.cc */,
+				897FF1A30E719B8F00D62E90 /* zone.h */,
+			);
+			name = "C++";
+			sourceTree = "<group>";
+		};
+		897FF0D80E719ABA00D62E90 /* js */ = {
+			isa = PBXGroup;
+			children = (
+				897FF1A60E719BC100D62E90 /* apinatives.js */,
+				897FF1A70E719BC100D62E90 /* array.js */,
+				897FF1A80E719BC100D62E90 /* date-delay.js */,
+				897FF1A90E719BC100D62E90 /* debug-delay.js */,
+				897FF1AA0E719BC100D62E90 /* math.js */,
+				897FF1AB0E719BC100D62E90 /* messages.js */,
+				897FF1AC0E719BC100D62E90 /* mirror-delay.js */,
+				897FF1AD0E719BC100D62E90 /* regexp-delay.js */,
+				897FF1AE0E719BC100D62E90 /* runtime.js */,
+				897FF1AF0E719BC100D62E90 /* string.js */,
+				897FF1B00E719BC100D62E90 /* uri.js */,
+				897FF1B10E719BC100D62E90 /* v8natives.js */,
+			);
+			name = js;
+			sourceTree = "<group>";
+		};
+		897FF0DE0E719B3400D62E90 /* third_party */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0DF0E719B3400D62E90 /* dtoa */,
+				897FF0E20E719B3500D62E90 /* jscre */,
+			);
+			path = third_party;
+			sourceTree = "<group>";
+		};
+		897FF0DF0E719B3400D62E90 /* dtoa */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0E00E719B3500D62E90 /* COPYING */,
+				897FF0E10E719B3500D62E90 /* dtoa.c */,
+			);
+			path = dtoa;
+			sourceTree = "<group>";
+		};
+		897FF0E20E719B3500D62E90 /* jscre */ = {
+			isa = PBXGroup;
+			children = (
+				897FF0E30E719B3500D62E90 /* ASCIICType.h */,
+				897FF0E40E719B3500D62E90 /* AUTHORS */,
+				897FF0E50E719B3500D62E90 /* config.h */,
+				897FF0E60E719B3500D62E90 /* COPYING */,
+				897FF0E70E719B3500D62E90 /* LICENSE */,
+				897FF0E80E719B3500D62E90 /* pcre.h */,
+				897FF0E90E719B3500D62E90 /* pcre_chartables.c */,
+				897FF0EA0E719B3500D62E90 /* pcre_compile.cpp */,
+				897FF0EB0E719B3500D62E90 /* pcre_exec.cpp */,
+				897FF0EC0E719B3500D62E90 /* pcre_internal.h */,
+				897FF0ED0E719B3500D62E90 /* pcre_tables.cpp */,
+				897FF0EE0E719B3500D62E90 /* pcre_ucp_searchfuncs.cpp */,
+				897FF0EF0E719B3500D62E90 /* pcre_xclass.cpp */,
+				897FF0F00E719B3500D62E90 /* ucpinternal.h */,
+				897FF0F10E719B3500D62E90 /* ucptable.cpp */,
+			);
+			path = jscre;
+			sourceTree = "<group>";
+		};
+		897FF1B30E719BCE00D62E90 /* samples */ = {
+			isa = PBXGroup;
+			children = (
+				897FF1B50E719C0900D62E90 /* shell.cc */,
+			);
+			path = samples;
+			sourceTree = "<group>";
+		};
+		897FF1B40E719BE800D62E90 /* tools */ = {
+			isa = PBXGroup;
+			children = (
+				897FF1B60E719C2300D62E90 /* js2c.py */,
+				897FF1B70E719C2E00D62E90 /* macros.py */,
+			);
+			path = tools;
+			sourceTree = "<group>";
+		};
+		897FF1C00E719CB600D62E90 /* Products */ = {
+			isa = PBXGroup;
+			children = (
+				897FF1BF0E719CB600D62E90 /* libjscre.a */,
+				8970F2F00E719FB2006AE7B5 /* libv8.a */,
+				897F767A0E71B4CC007ACF34 /* v8_shell */,
+			);
+			name = Products;
+			sourceTree = "<group>";
+		};
+		89A9C1630E71C8E300BE6CCA /* generated */ = {
+			isa = PBXGroup;
+			children = (
+				8900116B0E71CA2300F91F35 /* libraries.cc */,
+			);
+			path = generated;
+			sourceTree = CONFIGURATION_TEMP_DIR;
+		};
+/* End PBXGroup section */
+
+/* Begin PBXNativeTarget section */
+		8970F2EF0E719FB2006AE7B5 /* v8 */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 8970F2F70E719FC1006AE7B5 /* Build configuration list for PBXNativeTarget "v8" */;
+			buildPhases = (
+				89EA6FB50E71AA1F00F59E1B /* ShellScript */,
+				8970F2ED0E719FB2006AE7B5 /* Sources */,
+				8970F2EE0E719FB2006AE7B5 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = v8;
+			productName = v8;
+			productReference = 8970F2F00E719FB2006AE7B5 /* libv8.a */;
+			productType = "com.apple.product-type.library.static";
+		};
+		897F76790E71B4CC007ACF34 /* v8_shell */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 897F767E0E71B4EA007ACF34 /* Build configuration list for PBXNativeTarget "v8_shell" */;
+			buildPhases = (
+				897F76770E71B4CC007ACF34 /* Sources */,
+				897F76780E71B4CC007ACF34 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+				897F76810E71B6AC007ACF34 /* PBXTargetDependency */,
+				897F76830E71B6AC007ACF34 /* PBXTargetDependency */,
+			);
+			name = v8_shell;
+			productName = v8_shell;
+			productReference = 897F767A0E71B4CC007ACF34 /* v8_shell */;
+			productType = "com.apple.product-type.tool";
+		};
+		897FF1BE0E719CB600D62E90 /* jscre */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 897FF1C30E719CB600D62E90 /* Build configuration list for PBXNativeTarget "jscre" */;
+			buildPhases = (
+				897FF1BC0E719CB600D62E90 /* Sources */,
+				897FF1BD0E719CB600D62E90 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = jscre;
+			productName = jscre;
+			productReference = 897FF1BF0E719CB600D62E90 /* libjscre.a */;
+			productType = "com.apple.product-type.library.static";
+		};
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+		8915B8680E719336009C4E19 /* Project object */ = {
+			isa = PBXProject;
+			buildConfigurationList = 8915B86B0E719336009C4E19 /* Build configuration list for PBXProject "v8" */;
+			compatibilityVersion = "Xcode 3.1";
+			hasScannedForEncodings = 0;
+			mainGroup = 8915B8660E719336009C4E19;
+			productRefGroup = 897FF1C00E719CB600D62E90 /* Products */;
+			projectDirPath = "";
+			projectRoot = ..;
+			targets = (
+				7BF891930E73098D000BAF8A /* All */,
+				897FF1BE0E719CB600D62E90 /* jscre */,
+				8970F2EF0E719FB2006AE7B5 /* v8 */,
+				897F76790E71B4CC007ACF34 /* v8_shell */,
+			);
+		};
+/* End PBXProject section */
+
+/* Begin PBXShellScriptBuildPhase section */
+		89EA6FB50E71AA1F00F59E1B /* ShellScript */ = {
+			isa = PBXShellScriptBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			inputPaths = (
+			);
+			outputPaths = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+			shellPath = /bin/sh;
+			shellScript = "set -ex\nJS_FILES=\"runtime.js\"\\\n\" v8natives.js\"\\\n\" array.js\"\\\n\" string.js\"\\\n\" uri.js\"\\\n\" math.js\"\\\n\" messages.js\"\\\n\" apinatives.js\"\\\n\" debug-delay.js\"\\\n\" mirror-delay.js\"\\\n\" date-delay.js\"\\\n\" regexp-delay.js\"\\\n\" macros.py\"\n\nV8ROOT=\"${SRCROOT}/..\"\n\nSRC_DIR=\"${V8ROOT}/src\"\n\nNATIVE_JS_FILES=\"\"\n\nfor i in ${JS_FILES} ; do\n  NATIVE_JS_FILES+=\"${SRC_DIR}/${i} \"\ndone\n\nV8_GENERATED_SOURCES_DIR=\"${CONFIGURATION_TEMP_DIR}/generated\"\nmkdir -p \"${V8_GENERATED_SOURCES_DIR}\"\n\nLIBRARIES_CC=\"${V8_GENERATED_SOURCES_DIR}/libraries.cc\"\nLIBRARIES_EMPTY_CC=\"${V8_GENERATED_SOURCES_DIR}/libraries-empty.cc\"\n\npython \"${V8ROOT}/tools/js2c.py\" \\\n  \"${LIBRARIES_CC}.new\" \\\n  \"${LIBRARIES_EMPTY_CC}.new\" \\\n  ${NATIVE_JS_FILES}\n\n# Only use the new files if they're different from the existing files (if any),\n# preserving the existing files' timestamps when there are no changes.  This\n# minimizes unnecessary build activity for a no-change build.\n\nif ! diff -q \"${LIBRARIES_CC}.new\" \"${LIBRARIES_CC}\" >& /dev/null ; then\n  mv \"${LIBRARIES_CC}.new\" \"${LIBRARIES_CC}\"\nelse\n  rm \"${LIBRARIES_CC}.new\"\nfi\n\nif ! diff -q \"${LIBRARIES_EMPTY_CC}.new\" \"${LIBRARIES_EMPTY_CC}\" >& /dev/null ; then\n  mv \"${LIBRARIES_EMPTY_CC}.new\" \"${LIBRARIES_EMPTY_CC}\"\nelse\n  rm \"${LIBRARIES_EMPTY_CC}.new\"\nfi\n";
+		};
+/* End PBXShellScriptBuildPhase section */
+
+/* Begin PBXSourcesBuildPhase section */
+		8970F2ED0E719FB2006AE7B5 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				89A88DEC0E71A5FF0043BA31 /* accessors.cc in Sources */,
+				89A88DED0E71A6000043BA31 /* allocation.cc in Sources */,
+				89A88DEE0E71A6010043BA31 /* api.cc in Sources */,
+				89A88DEF0E71A60A0043BA31 /* assembler-ia32.cc in Sources */,
+				89A88DF00E71A60A0043BA31 /* assembler.cc in Sources */,
+				89A88DF10E71A60B0043BA31 /* ast.cc in Sources */,
+				89A88DF20E71A60C0043BA31 /* bootstrapper.cc in Sources */,
+				89A88DF40E71A6160043BA31 /* builtins-ia32.cc in Sources */,
+				89A88DF50E71A6170043BA31 /* builtins.cc in Sources */,
+				89A88DF60E71A61C0043BA31 /* checks.cc in Sources */,
+				893CCE640E71D83700357A03 /* code-stubs.cc in Sources */,
+				89A88DF70E71A6240043BA31 /* codegen-ia32.cc in Sources */,
+				89A88DF80E71A6260043BA31 /* codegen.cc in Sources */,
+				89A88DF90E71A6430043BA31 /* compiler.cc in Sources */,
+				89A88DFA0E71A6440043BA31 /* contexts.cc in Sources */,
+				89A88DFB0E71A6440043BA31 /* conversions.cc in Sources */,
+				89A88DFC0E71A6460043BA31 /* counters.cc in Sources */,
+				89A88DFD0E71A6470043BA31 /* cpu-ia32.cc in Sources */,
+				89A88DFE0E71A6480043BA31 /* dateparser.cc in Sources */,
+				89A88DFF0E71A6530043BA31 /* debug.cc in Sources */,
+				89A88E000E71A6540043BA31 /* disasm-ia32.cc in Sources */,
+				89A88E010E71A6550043BA31 /* disassembler.cc in Sources */,
+				89A88E020E71A65A0043BA31 /* dtoa-config.c in Sources */,
+				89A88E030E71A65B0043BA31 /* execution.cc in Sources */,
+				89A88E040E71A65D0043BA31 /* factory.cc in Sources */,
+				89A88E050E71A65D0043BA31 /* flags.cc in Sources */,
+				89A88E060E71A6600043BA31 /* frames-ia32.cc in Sources */,
+				89A88E070E71A6610043BA31 /* frames.cc in Sources */,
+				89A88E080E71A6620043BA31 /* global-handles.cc in Sources */,
+				89A88E090E71A6640043BA31 /* handles.cc in Sources */,
+				89A88E0A0E71A6650043BA31 /* hashmap.cc in Sources */,
+				89A88E0B0E71A66C0043BA31 /* heap.cc in Sources */,
+				89A88E0C0E71A66D0043BA31 /* ic-ia32.cc in Sources */,
+				89A88E0D0E71A66E0043BA31 /* ic.cc in Sources */,
+				89A88E0E0E71A66F0043BA31 /* jsregexp.cc in Sources */,
+				8900116C0E71CA2300F91F35 /* libraries.cc in Sources */,
+				89A88E0F0E71A6740043BA31 /* log.cc in Sources */,
+				89A88E100E71A6770043BA31 /* macro-assembler-ia32.cc in Sources */,
+				89A88E110E71A6780043BA31 /* mark-compact.cc in Sources */,
+				89A88E120E71A67A0043BA31 /* messages.cc in Sources */,
+				89A88E130E71A6860043BA31 /* objects-debug.cc in Sources */,
+				89A88E140E71A6870043BA31 /* objects.cc in Sources */,
+				89A88E150E71A68C0043BA31 /* parser.cc in Sources */,
+				89A88E160E71A68E0043BA31 /* platform-macos.cc in Sources */,
+				89A88E170E71A6950043BA31 /* prettyprinter.cc in Sources */,
+				89A88E180E71A6960043BA31 /* property.cc in Sources */,
+				89A88E190E71A6970043BA31 /* rewriter.cc in Sources */,
+				89A88E1A0E71A69B0043BA31 /* runtime.cc in Sources */,
+				89A88E1B0E71A69D0043BA31 /* scanner.cc in Sources */,
+				89A88E1C0E71A69E0043BA31 /* scopeinfo.cc in Sources */,
+				89A88E1D0E71A6A00043BA31 /* scopes.cc in Sources */,
+				89A88E1E0E71A6A30043BA31 /* serialize.cc in Sources */,
+				89A88E1F0E71A6B40043BA31 /* snapshot-common.cc in Sources */,
+				89A88E200E71A6B60043BA31 /* snapshot-empty.cc in Sources */,
+				89A88E210E71A6B70043BA31 /* spaces.cc in Sources */,
+				89A88E220E71A6BC0043BA31 /* string-stream.cc in Sources */,
+				89A88E230E71A6BE0043BA31 /* stub-cache-ia32.cc in Sources */,
+				89A88E240E71A6BF0043BA31 /* stub-cache.cc in Sources */,
+				89A88E250E71A6C20043BA31 /* token.cc in Sources */,
+				89A88E260E71A6C90043BA31 /* top.cc in Sources */,
+				89A88E270E71A6CB0043BA31 /* unicode.cc in Sources */,
+				89A88E280E71A6CC0043BA31 /* usage-analyzer.cc in Sources */,
+				89A88E290E71A6CE0043BA31 /* utils.cc in Sources */,
+				89A88E2A0E71A6D00043BA31 /* v8-counters.cc in Sources */,
+				89A88E2B0E71A6D10043BA31 /* v8.cc in Sources */,
+				89A88E2C0E71A6D20043BA31 /* v8threads.cc in Sources */,
+				89A88E2D0E71A6D50043BA31 /* variables.cc in Sources */,
+				89A88E2E0E71A6D60043BA31 /* zone.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		897F76770E71B4CC007ACF34 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				897F767F0E71B690007ACF34 /* shell.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		897FF1BC0E719CB600D62E90 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				897FF1C40E719D6B00D62E90 /* pcre_compile.cpp in Sources */,
+				897FF1C50E719D6E00D62E90 /* pcre_exec.cpp in Sources */,
+				897FF1C60E719D7100D62E90 /* pcre_tables.cpp in Sources */,
+				897FF1C70E719D7300D62E90 /* pcre_ucp_searchfuncs.cpp in Sources */,
+				897FF1C80E719D7600D62E90 /* pcre_xclass.cpp in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXSourcesBuildPhase section */
+
+/* Begin PBXTargetDependency section */
+		7BF891970E73099F000BAF8A /* PBXTargetDependency */ = {
+			isa = PBXTargetDependency;
+			target = 8970F2EF0E719FB2006AE7B5 /* v8 */;
+			targetProxy = 7BF891960E73099F000BAF8A /* PBXContainerItemProxy */;
+		};
+		7BF891990E73099F000BAF8A /* PBXTargetDependency */ = {
+			isa = PBXTargetDependency;
+			target = 897F76790E71B4CC007ACF34 /* v8_shell */;
+			targetProxy = 7BF891980E73099F000BAF8A /* PBXContainerItemProxy */;
+		};
+		7BF8919B0E7309AD000BAF8A /* PBXTargetDependency */ = {
+			isa = PBXTargetDependency;
+			target = 897FF1BE0E719CB600D62E90 /* jscre */;
+			targetProxy = 7BF8919A0E7309AD000BAF8A /* PBXContainerItemProxy */;
+		};
+		897F76810E71B6AC007ACF34 /* PBXTargetDependency */ = {
+			isa = PBXTargetDependency;
+			target = 897FF1BE0E719CB600D62E90 /* jscre */;
+			targetProxy = 897F76800E71B6AC007ACF34 /* PBXContainerItemProxy */;
+		};
+		897F76830E71B6AC007ACF34 /* PBXTargetDependency */ = {
+			isa = PBXTargetDependency;
+			target = 8970F2EF0E719FB2006AE7B5 /* v8 */;
+			targetProxy = 897F76820E71B6AC007ACF34 /* PBXContainerItemProxy */;
+		};
+/* End PBXTargetDependency section */
+
+/* Begin XCBuildConfiguration section */
+		7BF891940E73098D000BAF8A /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				PRODUCT_NAME = All;
+			};
+			name = Debug;
+		};
+		7BF891950E73098D000BAF8A /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				PRODUCT_NAME = All;
+			};
+			name = Release;
+		};
+		8915B8690E719336009C4E19 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				COPY_PHASE_STRIP = NO;
+				GCC_CW_ASM_SYNTAX = NO;
+				GCC_C_LANGUAGE_STANDARD = ansi;
+				GCC_DYNAMIC_NO_PIC = YES;
+				GCC_ENABLE_CPP_EXCEPTIONS = NO;
+				GCC_ENABLE_CPP_RTTI = NO;
+				GCC_ENABLE_PASCAL_STRINGS = NO;
+				GCC_INLINES_ARE_PRIVATE_EXTERN = YES;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				GCC_PRECOMPILE_PREFIX_HEADER = YES;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"$(GCC_PREPROCESSOR_DEFINITIONS)",
+					DEBUG,
+					_GLIBCXX_CONCEPT_CHECKS,
+					_GLIBCXX_DEBUG,
+					_GLIBCXX_DEBUG_PEDANTIC,
+				);
+				GCC_SYMBOLS_PRIVATE_EXTERN = YES;
+				GCC_TREAT_WARNINGS_AS_ERRORS = YES;
+				GCC_WARN_ABOUT_MISSING_NEWLINE = YES;
+				OTHER_CFLAGS = (
+					"$(OTHER_CFLAGS)",
+					"-fstack-protector",
+					"-fstack-protector-all",
+				);
+				PREBINDING = NO;
+				SYMROOT = ../xcodebuild;
+				USE_HEADERMAP = NO;
+				WARNING_CFLAGS = (
+					"$(WARNING_CFLAGS)",
+					"-Wall",
+					"-Wendif-labels",
+				);
+			};
+			name = Debug;
+		};
+		8915B86A0E719336009C4E19 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				DEAD_CODE_STRIPPING = YES;
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				DEPLOYMENT_POSTPROCESSING = YES;
+				GCC_CW_ASM_SYNTAX = NO;
+				GCC_C_LANGUAGE_STANDARD = ansi;
+				GCC_DYNAMIC_NO_PIC = YES;
+				GCC_ENABLE_CPP_EXCEPTIONS = NO;
+				GCC_ENABLE_CPP_RTTI = NO;
+				GCC_ENABLE_PASCAL_STRINGS = NO;
+				GCC_INLINES_ARE_PRIVATE_EXTERN = YES;
+				GCC_OPTIMIZATION_LEVEL = 2;
+				GCC_PRECOMPILE_PREFIX_HEADER = YES;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"$(GCC_PREPROCESSOR_DEFINITIONS)",
+					NDEBUG,
+				);
+				GCC_SYMBOLS_PRIVATE_EXTERN = YES;
+				GCC_TREAT_WARNINGS_AS_ERRORS = NO;
+				GCC_WARN_ABOUT_MISSING_NEWLINE = YES;
+				PREBINDING = NO;
+				STRIP_STYLE = all;
+				SYMROOT = ../xcodebuild;
+				USE_HEADERMAP = NO;
+				WARNING_CFLAGS = (
+					"$(WARNING_CFLAGS)",
+					"-Wall",
+					"-Wendif-labels",
+				);
+			};
+			name = Release;
+		};
+		8970F2F10E719FB2006AE7B5 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				DEPLOYMENT_POSTPROCESSING = NO;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"$(GCC_PREPROCESSOR_DEFINITIONS)",
+					ENABLE_DISASSEMBLER,
+					ENABLE_LOGGING_AND_PROFILING,
+				);
+				HEADER_SEARCH_PATHS = ../src;
+				PRODUCT_NAME = v8;
+				STRIP_STYLE = debugging;
+			};
+			name = Debug;
+		};
+		8970F2F20E719FB2006AE7B5 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				DEPLOYMENT_POSTPROCESSING = NO;
+				HEADER_SEARCH_PATHS = ../src;
+				PRODUCT_NAME = v8;
+				STRIP_STYLE = debugging;
+			};
+			name = Release;
+		};
+		897F767C0E71B4CC007ACF34 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				HEADER_SEARCH_PATHS = ../src;
+				PRODUCT_NAME = v8_shell;
+			};
+			name = Debug;
+		};
+		897F767D0E71B4CC007ACF34 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				HEADER_SEARCH_PATHS = ../src;
+				PRODUCT_NAME = v8_shell;
+			};
+			name = Release;
+		};
+		897FF1C10E719CB600D62E90 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				DEPLOYMENT_POSTPROCESSING = NO;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"$(GCC_PREPROCESSOR_DEFINITIONS)",
+					SUPPORT_UTF8,
+					SUPPORT_UCP,
+					NO_RECURSE,
+				);
+				PRODUCT_NAME = jscre;
+				STRIP_STYLE = debugging;
+			};
+			name = Debug;
+		};
+		897FF1C20E719CB600D62E90 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				DEPLOYMENT_POSTPROCESSING = NO;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"$(GCC_PREPROCESSOR_DEFINITIONS)",
+					SUPPORT_UTF8,
+					SUPPORT_UCP,
+					NO_RECURSE,
+				);
+				PRODUCT_NAME = jscre;
+				STRIP_STYLE = debugging;
+			};
+			name = Release;
+		};
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+		7BF8919F0E7309BE000BAF8A /* Build configuration list for PBXAggregateTarget "All" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				7BF891940E73098D000BAF8A /* Debug */,
+				7BF891950E73098D000BAF8A /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		8915B86B0E719336009C4E19 /* Build configuration list for PBXProject "v8" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				8915B8690E719336009C4E19 /* Debug */,
+				8915B86A0E719336009C4E19 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		8970F2F70E719FC1006AE7B5 /* Build configuration list for PBXNativeTarget "v8" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				8970F2F10E719FB2006AE7B5 /* Debug */,
+				8970F2F20E719FB2006AE7B5 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		897F767E0E71B4EA007ACF34 /* Build configuration list for PBXNativeTarget "v8_shell" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				897F767C0E71B4CC007ACF34 /* Debug */,
+				897F767D0E71B4CC007ACF34 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		897FF1C30E719CB600D62E90 /* Build configuration list for PBXNativeTarget "jscre" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				897FF1C10E719CB600D62E90 /* Debug */,
+				897FF1C20E719CB600D62E90 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+/* End XCConfigurationList section */
+	};
+	rootObject = 8915B8680E719336009C4E19 /* Project object */;
+}
diff --git a/tools/visual_studio/v8.vcproj b/tools/visual_studio/v8.vcproj
index b3b5a62f9a37..212fd07c0d2b 100644
--- a/tools/visual_studio/v8.vcproj
+++ b/tools/visual_studio/v8.vcproj
@@ -183,7 +183,7 @@
 					<Tool
 						Name="VCCustomBuildTool"
 						Description="Processing js files..."
-						CommandLine=".\js2c.cmd ..\..\src $(IntDir)\DerivedSources&#x0D;&#x0A;"
+						CommandLine=".\js2c.cmd ..\..\src &quot;$(IntDir)\DerivedSources&quot;"
 						AdditionalDependencies="..\..\src\macros.py;..\..\src\runtime.js;..\..\src\v8natives.js;..\..\src\array.js;..\..\src\string.js;..\..\src\uri.js;..\..\src\math.js;..\..\src\messages.js;..\..\src\apinatives.js;..\..\src\debug-delay.js;..\..\src\mirror-delay.js;..\..\src\date-delay.js;..\..\src\regexp-delay.js"
 						Outputs="$(IntDir)\DerivedSources\natives.cc;$(IntDir)\DerivedSources\natives-empty.cc"
 					/>
@@ -194,7 +194,7 @@
 					<Tool
 						Name="VCCustomBuildTool"
 						Description="Processing js files..."
-						CommandLine=".\js2c.cmd ..\..\src $(IntDir)\DerivedSources&#x0D;&#x0A;"
+						CommandLine=".\js2c.cmd ..\..\src &quot;$(IntDir)\DerivedSources&quot;"
 						AdditionalDependencies="..\..\src\macros.py;..\..\src\runtime.js;..\..\src\v8natives.js;..\..\src\array.js;..\..\src\string.js;..\..\src\uri.js;..\..\src\math.js;..\..\src\messages.js;..\..\src\apinatives.js;..\..\src\debug-delay.js;..\..\src\mirror-delay.js;..\..\src\date-delay.js;..\..\src\regexp-delay.js"
 						Outputs="$(IntDir)\DerivedSources\natives.cc;$(IntDir)\DerivedSources\natives-empty.cc"
 					/>
diff --git a/tools/windows-tick-processor.py b/tools/windows-tick-processor.py
index 447e3075b2fe..4b1c3f1fd1fa 100755
--- a/tools/windows-tick-processor.py
+++ b/tools/windows-tick-processor.py
@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 #
-# Copyright 2008 Google Inc.  All rights reserved.
+# Copyright 2008 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: