[heap] Use Page::FromAllocationAreaAddress when dealing with allocation info.

src/heap/spaces.cc

 // Copyright 2011 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.
 
 #include "src/heap/spaces.h"
 
 #include "src/base/bits.h"
 #include "src/base/platform/platform.h"
 #include "src/base/platform/semaphore.h"
 #include "src/full-codegen/full-codegen.h"
@@ skipping 1240 matching lines @@
 void PagedSpace::ResetFreeListStatistics() {
   for (Page* page : *this) {
     page->ResetFreeListStatistics();
   }
 }
 
 void PagedSpace::SetAllocationInfo(Address top, Address limit) {
   SetTopAndLimit(top, limit);
   if (top != nullptr && top != limit &&
       heap()->incremental_marking()->black_allocation()) {
-    Page* page = Page::FromAddress(top);
+    Page* page = Page::FromAllocationAreaAddress(top);
     page->markbits()->SetRange(page->AddressToMarkbitIndex(top),
                                page->AddressToMarkbitIndex(limit));
     page->IncrementLiveBytes(static_cast<int>(limit - top));
   }
 }
 
 void PagedSpace::MarkAllocationInfoBlack() {
   DCHECK(heap()->incremental_marking()->black_allocation());
   Address current_top = top();
   Address current_limit = limit();
   if (current_top != nullptr && current_top != current_limit) {
-    Page* page = Page::FromAddress(current_top);
+    Page* page = Page::FromAllocationAreaAddress(current_top);
     page->markbits()->SetRange(page->AddressToMarkbitIndex(current_top),
                                page->AddressToMarkbitIndex(current_limit));
     page->IncrementLiveBytes(static_cast<int>(current_limit - current_top));
   }
 }
 
 // Empty space allocation info, returning unused area to free list.
 void PagedSpace::EmptyAllocationInfo() {
   // Mark the old linear allocation area with a free space map so it can be
   // skipped when scanning the heap.
   Address current_top = top();
   Address current_limit = limit();
   if (current_top == nullptr) {
     DCHECK(current_limit == nullptr);
     return;
   }
 
   if (heap()->incremental_marking()->black_allocation()) {
-    Page* page = Page::FromAddress(current_top);
+    Page* page = Page::FromAllocationAreaAddress(current_top);
     // We have to remember the end of the current black allocation area if
     // something was allocated in the current bump pointer range.
     if (allocation_info_.original_top() != current_top) {
       Address end_black_area = current_top - kPointerSize;
       page->AddBlackAreaEndMarker(end_black_area);
     }
 
     // Clear the bits in the unused black area.
     if (current_top != current_limit) {
       page->markbits()->ClearRange(page->AddressToMarkbitIndex(current_top),
@@ skipping 1842 matching lines @@
     object->ShortPrint();
     PrintF("\n");
   }
   printf(" --------------------------------------\n");
   printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes());
 }
 
 #endif  // DEBUG
 }  // namespace internal
 }  // namespace v8