Simplified large object allocation strategy.

src/heap.h

Index: src/heap.h
diff --git a/src/heap.h b/src/heap.h
index 6b0236330f9c96185fa8d3cf8c61d379b8f081a2..4babcce0afd4b8188dcf50fa53a3260c41d92578 100644
--- a/src/heap.h
+++ b/src/heap.h
@@ -1716,8 +1716,6 @@ class Heap {
   // we try to promote this object.
   inline bool ShouldBePromoted(Address old_address, int object_size);
 
-  int MaxObjectSizeInNewSpace() { return kMaxObjectSizeInNewSpace; }
-
   void ClearJSFunctionResultCaches();
 
   void ClearNormalizedMapCaches();
@@ -1966,12 +1964,6 @@ class Heap {
 
   int scan_on_scavenge_pages_;
 
-#if V8_TARGET_ARCH_X64
-  static const int kMaxObjectSizeInNewSpace = 1024*KB;
-#else
-  static const int kMaxObjectSizeInNewSpace = 512*KB;
-#endif
-
   NewSpace new_space_;
   OldSpace* old_pointer_space_;
   OldSpace* old_data_space_;