* Complete new store buffer on ia32. The store buffer now covers...

src/spaces.h

 // Copyright 2006-2010 the V8 project authors. 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 1576 matching lines @@
   int Free(Address start, int size_in_bytes);
 
   // Allocate a block of size 'size_in_bytes' from the free list.  The block
   // is unitialized.  A failure is returned if no block is available.  The
   // number of bytes lost to fragmentation is returned in the output parameter
   // 'wasted_bytes'.  The size should be a non-zero multiple of the word size.
   MUST_USE_RESULT MaybeObject* Allocate(int size_in_bytes, int* wasted_bytes);
 
   void MarkNodes();
 
+#ifdef DEBUG
+  void Zap();
+#endif
+
  private:
   // The size range of blocks, in bytes. (Smaller allocations are allowed, but
   // will always result in waste.)
   static const int kMinBlockSize = 2 * kPointerSize;
   static const int kMaxBlockSize = Page::kMaxHeapObjectSize;
 
   // The identity of the owning space, for building allocation Failure
   // objects.
   AllocationSpace owner_;
 
@@ skipping 80 matching lines @@
   // information will be written to the block, ie, its contents will be
   // destroyed.  The start address should be word aligned.
   void Free(Address start);
 
   // Allocate a fixed sized block from the free list.  The block is unitialized.
   // A failure is returned if no block is available.
   MUST_USE_RESULT MaybeObject* Allocate();
 
   void MarkNodes();
 
+#ifdef DEBUG
+  void Zap();
+#endif
+
  private:
   // Available bytes on the free list.
   intptr_t available_;
 
   // The head of the free list.
   Address head_;
 
   // The tail of the free list.
   Address tail_;
 
@@ skipping 52 matching lines @@
   // clears the free list.
   virtual void PrepareForMarkCompact(bool will_compact);
 
   virtual void PutRestOfCurrentPageOnFreeList(Page* current_page);
 
   void MarkFreeListNodes() { free_list_.MarkNodes(); }
 
 #ifdef DEBUG
   // Reports statistics for the space
   void ReportStatistics();
+
+  OldSpaceFreeList* free_list() { return &free_list_; }
 #endif
 
  protected:
   // Virtual function in the superclass.  Slow path of AllocateRaw.
   MUST_USE_RESULT HeapObject* SlowAllocateRaw(int size_in_bytes);
 
   // Virtual function in the superclass.  Allocate linearly at the start of
   // the page after current_page (there is assumed to be one).
   HeapObject* AllocateInNextPage(Page* current_page, int size_in_bytes);
 
@@ skipping 46 matching lines @@
 
   virtual void DeallocateBlock(Address start,
                                int size_in_bytes,
                                bool add_to_freelist);
 
   void MarkFreeListNodes() { free_list_.MarkNodes(); }
 
 #ifdef DEBUG
   // Reports statistic info of the space
   void ReportStatistics();
+
+  FixedSizeFreeList* free_list() { return &free_list_; }
 #endif
 
  protected:
   // Virtual function in the superclass.  Slow path of AllocateRaw.
   MUST_USE_RESULT HeapObject* SlowAllocateRaw(int size_in_bytes);
 
   // Virtual function in the superclass.  Allocate linearly at the start of
   // the page after current_page (there is assumed to be one).
   HeapObject* AllocateInNextPage(Page* current_page, int size_in_bytes);
 
@@ skipping 248 matching lines @@
 
  private:
   LargePage* current_;
   HeapObjectCallback size_func_;
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_H_