[heap] New heuristics for incremental marking step size.

test/cctest/heap/test-heap.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 6191 matching lines @@
   CHECK_LE(kSize, counter2 - counter1);
   CcTest::CollectGarbage(NEW_SPACE);
   size_t counter3 = heap->OldGenerationAllocationCounter();
   CHECK_EQ(0u, counter3 - counter2);
   AllocateInSpace(isolate, kSize, OLD_SPACE);
   CcTest::CollectGarbage(OLD_SPACE);
   size_t counter4 = heap->OldGenerationAllocationCounter();
   CHECK_LE(kSize, counter4 - counter3);
   // Test counter overflow.
   size_t max_counter = -1;
-  heap->set_old_generation_allocation_counter(max_counter - 10 * kSize);
+  heap->set_old_generation_allocation_counter_at_last_gc(max_counter -
+                                                         10 * kSize);
   size_t start = heap->OldGenerationAllocationCounter();
   for (int i = 0; i < 20; i++) {
     AllocateInSpace(isolate, kSize, OLD_SPACE);
     size_t counter = heap->OldGenerationAllocationCounter();
     CHECK_LE(kSize, counter - start);
     start = counter;
   }
 }
 
 
@@ skipping 897 matching lines @@
     heap::SimulateFullSpace(heap->new_space());
   }
   heap::GcAndSweep(heap, OLD_SPACE);
   for (Page* p : *heap->new_space()) {
     CHECK(!p->InIntermediateGeneration());
   }
 }
 
 }  // namespace internal
 }  // namespace v8