Simplified large object allocation strategy.

test/cctest/test-mark-compact.cc

Index: test/cctest/test-mark-compact.cc
diff --git a/test/cctest/test-mark-compact.cc b/test/cctest/test-mark-compact.cc
index 626df16617128ca371283b4657d97e2fe4a407d3..ba487d50c6d03b9d368141b91e88bf5ef091bf65 100644
--- a/test/cctest/test-mark-compact.cc
+++ b/test/cctest/test-mark-compact.cc
@@ -120,7 +120,7 @@ TEST(NoPromotion) {
 
   // Allocate a big Fixed array in the new space.
   int max_size =
-      Min(Page::kMaxNonCodeHeapObjectSize, HEAP->MaxObjectSizeInNewSpace());
+      Min(Page::kMaxNonCodeHeapObjectSize, Page::kMaxNonCodeHeapObjectSize);

[Michael Starzinger, 2013/07/22 19:27:50]

nit: This Min() looks kind of redundant now. I guess the left constant is
slightly smaller than the right one on Mondays and Wednesdays, but I think it's
safe to ignore that. :)

[Hannes Payer (out of office), 2013/07/23 20:00:51]

Done.

 
   int length = (max_size - FixedArray::kHeaderSize) / (2*kPointerSize);
   Object* obj = i::Isolate::Current()->heap()->AllocateFixedArray(length)->