Provide tagged allocation top pointer

test/cctest/heap/utils-inl.h

 // Copyright 2015 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef HEAP_UTILS_H_
 #define HEAP_UTILS_H_
 
 #include "src/factory.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/incremental-marking.h"
@@ skipping 17 matching lines @@
   int allocate_memory;
   int length;
   int free_memory = padding_size;
   if (tenure == i::TENURED) {
     heap->old_space()->EmptyAllocationInfo();
     int overall_free_memory = static_cast<int>(heap->old_space()->Available());
     CHECK(padding_size <= overall_free_memory || overall_free_memory == 0);
   } else {
     heap->new_space()->DisableInlineAllocationSteps();
     int overall_free_memory =
-        static_cast<int>(*heap->new_space()->allocation_limit_address() -
-                         *heap->new_space()->allocation_top_address());
+        static_cast<int>(heap->new_space()->limit() - heap->new_space()->top());
     CHECK(padding_size <= overall_free_memory || overall_free_memory == 0);
   }
   while (free_memory > 0) {
     if (free_memory > object_size) {
       allocate_memory = object_size;
       length = LenFromSize(allocate_memory);
     } else {
       allocate_memory = free_memory;
       length = LenFromSize(allocate_memory);
       if (length <= 0) {
         // Not enough room to create another fixed array. Let's create a filler.
-        heap->CreateFillerObjectAt(*heap->old_space()->allocation_top_address(),
-                                   free_memory, ClearRecordedSlots::kNo);
+        if (tenure == i::TENURED) {
+          heap->CreateFillerObjectAt(heap->old_space()->top(), free_memory,
+                                     ClearRecordedSlots::kNo);
+        } else {
+          heap->CreateFillerObjectAt(heap->new_space()->top(), free_memory,
+                                     ClearRecordedSlots::kNo);
+        }
         break;
       }
     }
     handles.push_back(isolate->factory()->NewFixedArray(length, tenure));
     CHECK((tenure == NOT_TENURED && heap->InNewSpace(*handles.back())) ||
           (tenure == TENURED && heap->InOldSpace(*handles.back())));
     free_memory -= allocate_memory;
   }
   return handles;
 }
 
 
 // Helper function that simulates a full new-space in the heap.
 static inline bool FillUpOnePage(
     v8::internal::NewSpace* space,
     std::vector<Handle<FixedArray>>* out_handles = nullptr) {
   space->DisableInlineAllocationSteps();
-  int space_remaining = static_cast<int>(*space->allocation_limit_address() -
-                                         *space->allocation_top_address());
+  int space_remaining = static_cast<int>(space->limit() - space->top());
   if (space_remaining == 0) return false;
   std::vector<Handle<FixedArray>> handles =
       CreatePadding(space->heap(), space_remaining, i::NOT_TENURED);
   if (out_handles != nullptr)
     out_handles->insert(out_handles->end(), handles.begin(), handles.end());
   return true;
 }
 
 
 // Helper function that simulates a fill new-space in the heap.
 static inline void AllocateAllButNBytes(
     v8::internal::NewSpace* space, int extra_bytes,
     std::vector<Handle<FixedArray>>* out_handles = nullptr) {
   space->DisableInlineAllocationSteps();
-  int space_remaining = static_cast<int>(*space->allocation_limit_address() -
-                                         *space->allocation_top_address());
+  int space_remaining = static_cast<int>(space->limit() - space->top());
   CHECK(space_remaining >= extra_bytes);
   int new_linear_size = space_remaining - extra_bytes;
   if (new_linear_size == 0) return;
   std::vector<Handle<FixedArray>> handles =
       CreatePadding(space->heap(), new_linear_size, i::NOT_TENURED);
   if (out_handles != nullptr)
     out_handles->insert(out_handles->end(), handles.begin(), handles.end());
 }
 
 static inline void FillCurrentPage(
@@ skipping 41 matching lines @@
       marking->FinalizeIncrementally();
     }
   }
   CHECK(marking->IsComplete());
 }
 
 }  // namespace internal
 }  // namespace v8
 
 #endif  // HEAP_UTILS_H_