* Improve the interface to the memory-reservation functionality....

src/spaces.cc

 // 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:
 //
 //     * 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 1845 matching lines @@
   ASSERT(TopPageOf(allocation_info_)->next_page()->is_valid());
   SetAllocationInfo(&allocation_info_,
                     TopPageOf(allocation_info_)->next_page());
   return true;
 }
 
 
 // You have to call this last, since the implementation from PagedSpace
 // doesn't know that memory was 'promised' to large object space.
 bool LargeObjectSpace::ReserveSpace(int bytes) {
-  // We add a slack-factor of 2 in order to have space for the remembered
-  // set and a series of large-object allocations that are only just larger
-  // than the page size.
-  return Heap::OldGenerationSpaceAvailable() >= bytes * 2;
+  return Heap::OldGenerationSpaceAvailable() >= bytes;
 }
 
 
 // Slow case for normal allocation.  Try in order: (1) allocate in the next
 // page in the space, (2) allocate off the space's free list, (3) expand the
 // space, (4) fail.
 HeapObject* OldSpace::SlowAllocateRaw(int size_in_bytes) {
   // Linear allocation in this space has failed.  If there is another page
   // in the space, move to that page and allocate there.  This allocation
   // should succeed (size_in_bytes should not be greater than a page's
@@ skipping 978 matching lines @@
                      reinterpret_cast<Object**>(object->address()
                                                 + Page::kObjectAreaSize),
                      allocation_top);
       PrintF("\n");
     }
   }
 }
 #endif  // DEBUG
 
 } }  // namespace v8::internal