[heap] Modernize all *Page iterators to be proper C++ iterators

test/cctest/heap/heap-utils.cc

 // Copyright 2016 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 "test/cctest/heap/heap-utils.h"
 
 #include "src/factory.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/incremental-marking.h"
 #include "src/heap/mark-compact.h"
 #include "src/isolate.h"
 
 namespace v8 {
 namespace internal {
 namespace heap {
 
 void SealCurrentObjects(Heap* heap) {
   heap->CollectAllGarbage();
   heap->CollectAllGarbage();
   heap->mark_compact_collector()->EnsureSweepingCompleted();
-  PageIterator it(heap->old_space());
   heap->old_space()->EmptyAllocationInfo();
-  while (it.has_next()) {
-    Page* page = it.next();
+  for (Page* page : *heap->old_space()) {
     page->MarkNeverAllocateForTesting();
   }
 }
 
 int FixedArrayLenFromSize(int size) {
   return (size - FixedArray::kHeaderSize) / kPointerSize;
 }
 
 std::vector<Handle<FixedArray>> CreatePadding(Heap* heap, int padding_size,
                                               PretenureFlag tenure,
@@ skipping 101 matching lines @@
 }
 
 void SimulateFullSpace(v8::internal::PagedSpace* space) {
   space->EmptyAllocationInfo();
   space->ResetFreeList();
   space->ClearStats();
 }
 
 void AbandonCurrentlyFreeMemory(PagedSpace* space) {
   space->EmptyAllocationInfo();
-  PageIterator pit(space);
-  while (pit.has_next()) {
-    pit.next()->MarkNeverAllocateForTesting();
+  for (Page* page : *space) {
+    page->MarkNeverAllocateForTesting();
   }
 }
 
 void GcAndSweep(Heap* heap, AllocationSpace space) {
   heap->CollectGarbage(space);
   if (heap->mark_compact_collector()->sweeping_in_progress()) {
     heap->mark_compact_collector()->EnsureSweepingCompleted();
   }
 }
 
 }  // namespace heap
 }  // namespace internal
 }  // namespace v8