[heap] Removes spaces.h include from heap.h

src/heap/heap-inl.h

 // Copyright 2012 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 V8_HEAP_HEAP_INL_H_
 #define V8_HEAP_HEAP_INL_H_
 
 #include <cmath>
 
 #include "src/base/platform/platform.h"
@@ skipping 154 matching lines @@
     case NEW_SPACE:
       return new_space();
     case LO_SPACE:
       return lo_space();
     default:
       return paged_space(idx);
   }
 }
 
 Address* Heap::NewSpaceAllocationTopAddress() {
-  return new_space_.allocation_top_address();
+  return new_space_->allocation_top_address();
 }
 
 Address* Heap::NewSpaceAllocationLimitAddress() {
-  return new_space_.allocation_limit_address();
+  return new_space_->allocation_limit_address();
 }
 
 Address* Heap::OldSpaceAllocationTopAddress() {
   return old_space_->allocation_top_address();
 }
 
 Address* Heap::OldSpaceAllocationLimitAddress() {
   return old_space_->allocation_limit_address();
 }
 
 bool Heap::HeapIsFullEnoughToStartIncrementalMarking(intptr_t limit) {
   if (FLAG_stress_compaction && (gc_count_ & 1) != 0) return true;
 
-  intptr_t adjusted_allocation_limit = limit - new_space_.Capacity();
+  intptr_t adjusted_allocation_limit = limit - new_space_->Capacity();
 
   if (PromotedTotalSize() >= adjusted_allocation_limit) return true;
 
   if (HighMemoryPressure()) return true;
 
   return false;
 }
 
 void Heap::UpdateNewSpaceAllocationCounter() {
   new_space_allocation_counter_ = NewSpaceAllocationCounter();
@@ skipping 122 matching lines @@
   isolate_->counters()->objs_since_last_young()->Increment();
 #endif
 
   bool large_object = size_in_bytes > kMaxRegularHeapObjectSize;
   HeapObject* object = nullptr;
   AllocationResult allocation;
   if (NEW_SPACE == space) {
     if (large_object) {
       space = LO_SPACE;
     } else {
-      allocation = new_space_.AllocateRaw(size_in_bytes, alignment);
+      allocation = new_space_->AllocateRaw(size_in_bytes, alignment);
       if (allocation.To(&object)) {
         OnAllocationEvent(object, size_in_bytes);
       }
       return allocation;
     }
   }
 
   // Here we only allocate in the old generation.
   if (OLD_SPACE == space) {
     if (large_object) {
@@ skipping 118 matching lines @@
           reinterpret_cast<byte*>(string) + ExternalString::kResourceOffset -
           kHeapObjectTag);
 
   // Dispose of the C++ object if it has not already been disposed.
   if (*resource_addr != NULL) {
     (*resource_addr)->Dispose();
     *resource_addr = NULL;
   }
 }
 
+Address Heap::NewSpaceTop() { return new_space_->top(); }
+
+bool Heap::DeoptMaybeTenuredAllocationSites() {
+  return new_space_->IsAtMaximumCapacity() && maximum_size_scavenges_ == 0;
+}
 
 bool Heap::InNewSpace(Object* object) {
   // Inlined check from NewSpace::Contains.
   bool result =
       object->IsHeapObject() &&
       Page::FromAddress(HeapObject::cast(object)->address())->InNewSpace();
   DCHECK(!result ||                 // Either not in new space
          gc_state_ != NOT_IN_GC ||  // ... or in the middle of GC
          InToSpace(object));        // ... or in to-space (where we allocate).
   return result;
 }
 
 bool Heap::InFromSpace(Object* object) {
   return object->IsHeapObject() &&
          MemoryChunk::FromAddress(HeapObject::cast(object)->address())
              ->IsFlagSet(Page::IN_FROM_SPACE);
 }
 
 
 bool Heap::InToSpace(Object* object) {
   return object->IsHeapObject() &&
          MemoryChunk::FromAddress(HeapObject::cast(object)->address())
              ->IsFlagSet(Page::IN_TO_SPACE);
 }
 
 bool Heap::InOldSpace(Object* object) { return old_space_->Contains(object); }
 
 bool Heap::InNewSpaceSlow(Address address) {
-  return new_space_.ContainsSlow(address);
+  return new_space_->ContainsSlow(address);
 }
 
 bool Heap::InOldSpaceSlow(Address address) {
   return old_space_->ContainsSlow(address);
 }
 
 bool Heap::OldGenerationAllocationLimitReached() {
   if (!incremental_marking()->IsStopped() && !ShouldOptimizeForMemoryUsage()) {
     return false;
   }
   return OldGenerationSpaceAvailable() < 0;
 }
 
 template <PromotionMode promotion_mode>
 bool Heap::ShouldBePromoted(Address old_address, int object_size) {
   Page* page = Page::FromAddress(old_address);
-  Address age_mark = new_space_.age_mark();
+  Address age_mark = new_space_->age_mark();
 
   if (promotion_mode == PROMOTE_MARKED) {
     MarkBit mark_bit = ObjectMarking::MarkBitFrom(old_address);
     if (!Marking::IsWhite(mark_bit)) {
       return true;
     }
   }
 
   return page->IsFlagSet(MemoryChunk::NEW_SPACE_BELOW_AGE_MARK) &&
          (!page->ContainsLimit(age_mark) || old_address < age_mark);
@@ skipping 345 matching lines @@
 
 void VerifySmisVisitor::VisitPointers(Object** start, Object** end) {
   for (Object** current = start; current < end; current++) {
     CHECK((*current)->IsSmi());
   }
 }
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_HEAP_HEAP_INL_H_