[not for landing] Debugging gpu failures

src/heap/spaces-inl.h

 // 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.
 
 #ifndef V8_HEAP_SPACES_INL_H_
 #define V8_HEAP_SPACES_INL_H_
 
 #include "src/heap/incremental-marking.h"
 #include "src/heap/spaces.h"
 #include "src/isolate.h"
@@ skipping 362 matching lines @@
 bool FreeListCategory::is_linked() {
   return prev_ != nullptr || next_ != nullptr || owner()->top(type_) == this;
 }
 
 // Try linear allocation in the page of alloc_info's allocation top.  Does
 // not contain slow case logic (e.g. move to the next page or try free list
 // allocation) so it can be used by all the allocation functions and for all
 // the paged spaces.
 HeapObject* PagedSpace::AllocateLinearly(int size_in_bytes) {
   Address current_top = allocation_info_.top();
+  if (allocation_info_.top() > allocation_info_.limit()) {
+    PrintF("top > limit: %p %p\n",
+           reinterpret_cast<void*>(allocation_info_.top()),
+           reinterpret_cast<void*>(allocation_info_.limit())),
+        PrintStackFramesAndDie();
+  }
   Address new_top = current_top + size_in_bytes;
   if (new_top > allocation_info_.limit()) return NULL;
 
   allocation_info_.set_top(new_top);
   return HeapObject::FromAddress(current_top);
 }
 
 
 AllocationResult LocalAllocationBuffer::AllocateRawAligned(
     int size_in_bytes, AllocationAlignment alignment) {
@@ skipping 77 matching lines @@
   HeapObject* object = AllocateLinearlyAligned(&allocation_size, alignment);
 
   if (object == NULL) {
     // We don't know exactly how much filler we need to align until space is
     // allocated, so assume the worst case.
     int filler_size = Heap::GetMaximumFillToAlign(alignment);
     allocation_size += filler_size;
     object = free_list_.Allocate(allocation_size);
     if (object == NULL) {
       object = SlowAllocateRaw(allocation_size);
+    } else {
+      DCHECK(allocation_info_.limit() != nullptr);
     }
     if (object != NULL && filler_size != 0) {
+      DCHECK(allocation_info_.limit() != nullptr);
       object = heap()->AlignWithFiller(object, size_in_bytes, allocation_size,
                                        alignment);
+      DCHECK(allocation_info_.limit() != nullptr);
       // Filler objects are initialized, so mark only the aligned object memory
       // as uninitialized.
       allocation_size = size_in_bytes;
     }
+  } else {
+    DCHECK(allocation_info_.limit() != nullptr);
   }
 
   if (object != NULL) {
     MSAN_ALLOCATED_UNINITIALIZED_MEMORY(object->address(), allocation_size);
     return object;
   }
 
   return AllocationResult::Retry(identity());
 }
 
 
 AllocationResult PagedSpace::AllocateRaw(int size_in_bytes,
                                          AllocationAlignment alignment) {
 #ifdef V8_HOST_ARCH_32_BIT
   AllocationResult result =
       alignment == kDoubleAligned
           ? AllocateRawAligned(size_in_bytes, kDoubleAligned)
           : AllocateRawUnaligned(size_in_bytes);
 #else
   AllocationResult result = AllocateRawUnaligned(size_in_bytes);
 #endif
   HeapObject* heap_obj = nullptr;
   if (!result.IsRetry() && result.To(&heap_obj)) {
+    DCHECK(allocation_info_.limit() != nullptr);
     AllocationStep(heap_obj->address(), size_in_bytes);
+    DCHECK(allocation_info_.limit() != nullptr);
   }
   return result;
 }
 
 
 // -----------------------------------------------------------------------------
 // NewSpace
 
 
 AllocationResult NewSpace::AllocateRawAligned(int size_in_bytes,
@@ skipping 106 matching lines @@
     other->allocation_info_.Reset(nullptr, nullptr);
     return true;
   }
   return false;
 }
 
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_HEAP_SPACES_INL_H_