[heap] refactor inline allocation step code

src/heap/spaces.h

Index: src/heap/spaces.h
diff --git a/src/heap/spaces.h b/src/heap/spaces.h
index 0bc1c175a2c019020ff17a1c1d724d3fb71decbf..85eb5c575cb44da4323adf6be92e2394a1a82ae1 100644
--- a/src/heap/spaces.h
+++ b/src/heap/spaces.h
@@ -2737,6 +2737,15 @@ class NewSpace : public Space {
 
   bool EnsureAllocation(int size_in_bytes, AllocationAlignment alignment);
 
+  // If we are doing inline allocation in steps, this method performs the 'step'
+  // operation. Right now incremental mark is the only consumer of inline

[Hannes Payer (out of office), 2015/09/24 10:58:07]

marking

+  // allocation steps. top is the memory address of the bump pointer at the last
+  // inline allocation (i.e. it determines the numbers of bytes actually
+  // allocated since the last step.) new_top is the address of the bump pointer
+  // where the next byte is going to be allocated from. top and new_top may be
+  // different when we cross a page boundary or reset the space.
+  void InlineAllocationStep(Address top, Address new_top);
+
   friend class SemiSpaceIterator;
 };