[heap] Add more tasks for parallel compaction

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 "src/base/bits.h"
 #include "src/base/platform/platform.h"
 #include "src/full-codegen/full-codegen.h"
 #include "src/heap/slots-buffer.h"
@@ skipping 2200 matching lines @@
 intptr_t FreeList::Concatenate(FreeList* free_list) {
   intptr_t free_bytes = 0;
   free_bytes += small_list_.Concatenate(free_list->small_list());
   free_bytes += medium_list_.Concatenate(free_list->medium_list());
   free_bytes += large_list_.Concatenate(free_list->large_list());
   free_bytes += huge_list_.Concatenate(free_list->huge_list());
   return free_bytes;
 }
 
 
+void FreeList::Divide(FreeList** free_lists, int num, intptr_t limit) {
+  CHECK(num > 0);
+  CHECK(free_lists != nullptr);
+  if (limit == 0) {
+    limit = std::numeric_limits<intptr_t>::max();
+  }
+  int size = 0;
+  int cnt = 0;
+  FreeSpace* space = nullptr;
+  while (((space = huge_list_.PickNodeFromList(&size)) != nullptr) &&
+         (free_lists[cnt % num]->available() < limit)) {
+    free_lists[cnt % num]->huge_list_.Free(space, size);
+    cnt++;
+  }
+  while (((space = large_list_.PickNodeFromList(&size)) != nullptr) &&
+         (free_lists[cnt % num]->available() < limit)) {
+    free_lists[cnt % num]->large_list_.Free(space, size);
+    cnt++;
+  }
+  while (((space = medium_list_.PickNodeFromList(&size)) != nullptr) &&
+         (free_lists[cnt % num]->available() < limit)) {
+    free_lists[cnt % num]->medium_list_.Free(space, size);
+    cnt++;
+  }
+  while (((space = small_list_.PickNodeFromList(&size)) != nullptr) &&
+         (free_lists[cnt % num]->available() < limit)) {
+    free_lists[cnt % num]->small_list_.Free(space, size);
+    cnt++;
+  }
+}
+
+
 void FreeList::Reset() {
   small_list_.Reset();
   medium_list_.Reset();
   large_list_.Reset();
   huge_list_.Reset();
 }
 
 
 int FreeList::Free(Address start, int size_in_bytes) {
   if (size_in_bytes == 0) return 0;
@@ skipping 913 matching lines @@
     object->ShortPrint();
     PrintF("\n");
   }
   printf(" --------------------------------------\n");
   printf(" Marked: %x, LiveCount: %x\n", mark_size, LiveBytes());
 }
 
 #endif  // DEBUG
 }  // namespace internal
 }  // namespace v8