Use worst-fit allocation in old space for prentured objects.

src/spaces-inl.h

 // Copyright 2011 the V8 project authors. 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
@@ skipping 254 matching lines @@
 HeapObject* PagedSpace::AllocateLinearly(int size_in_bytes) {
   Address current_top = allocation_info_.top;
   Address new_top = current_top + size_in_bytes;
   if (new_top > allocation_info_.limit) return NULL;
 
   allocation_info_.top = new_top;
   return HeapObject::FromAddress(current_top);
 }
 
 
-// Raw allocation.
+template MaybeObject* PagedSpace::
+    AllocateRaw<FreeList::BEST_FIT>(int size_in_bytes);
+
+
+template MaybeObject* PagedSpace::
+    AllocateRaw<FreeList::WORST_FIT>(int size_in_bytes);
+
+
+// Raw allocation
+template<FreeList::AllocationStrategy strategy>
 MaybeObject* PagedSpace::AllocateRaw(int size_in_bytes) {
   HeapObject* object = AllocateLinearly(size_in_bytes);
   if (object != NULL) {
     if (identity() == CODE_SPACE) {
       SkipList::Update(object->address(), size_in_bytes);
     }
     return object;
   }
 
   ASSERT(!heap()->linear_allocation() ||
          (anchor_.next_chunk() == &anchor_ &&
           anchor_.prev_chunk() == &anchor_));
 
-  object = free_list_.Allocate(size_in_bytes);
+  object = free_list_.Allocate<strategy>(size_in_bytes);
   if (object != NULL) {
     if (identity() == CODE_SPACE) {
       SkipList::Update(object->address(), size_in_bytes);
     }
     return object;
   }
 
-  object = SlowAllocateRaw(size_in_bytes);
+  object = SlowAllocateRaw<strategy>(size_in_bytes);
   if (object != NULL) {
     if (identity() == CODE_SPACE) {
       SkipList::Update(object->address(), size_in_bytes);
     }
     return object;
   }
 
   return Failure::RetryAfterGC(identity());
 }
 
@@ skipping 47 matching lines @@
   Map* map = object->map();
   Heap* heap = object->GetHeap();
   return map == heap->raw_unchecked_free_space_map()
       || map == heap->raw_unchecked_one_pointer_filler_map()
       || map == heap->raw_unchecked_two_pointer_filler_map();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_INL_H_