[heap] Add GC accounting to slow allocation and incremental marking job

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 <utility>
 
 #include "src/base/bits.h"
 #include "src/base/platform/platform.h"
@@ skipping 2878 matching lines @@
 HeapObject* CompactionSpace::SweepAndRetryAllocation(int size_in_bytes) {
   MarkCompactCollector* collector = heap()->mark_compact_collector();
   if (collector->sweeping_in_progress()) {
     collector->SweepAndRefill(this);
     return free_list_.Allocate(size_in_bytes);
   }
   return nullptr;
 }
 
 HeapObject* PagedSpace::SlowAllocateRaw(int size_in_bytes) {
+  // Allocation in this space has failed.
   DCHECK_GE(size_in_bytes, 0);
   const int kMaxPagesToSweep = 1;
 
-  // Allocation in this space has failed.
+  VMState<GC> state(heap()->isolate());

[Michael Lippautz, 2017/05/03 15:44:52]

I think this is a pretty good estimate here that avoids polluting the fast path.
wdyt?

+  RuntimeCallTimerScope(heap()->isolate(), &RuntimeCallStats::GC);
 
   MarkCompactCollector* collector = heap()->mark_compact_collector();
   // Sweeping is still in progress.
   if (collector->sweeping_in_progress()) {
     if (FLAG_concurrent_sweeping && !is_local() &&
         !collector->sweeper().AreSweeperTasksRunning()) {
       collector->EnsureSweepingCompleted();
     }
 
     // First try to refill the free-list, concurrent sweeper threads
@@ skipping 409 matching lines @@
     PrintF("\n");
   }
   printf(" --------------------------------------\n");
   printf(" Marked: %x, LiveCount: %" V8PRIdPTR "\n", mark_size,
          MarkingState::Internal(this).live_bytes());
 }
 
 #endif  // DEBUG
 }  // namespace internal
 }  // namespace v8