[heap] Add more tasks for parallel compaction

src/heap/spaces.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_H_
 #define V8_HEAP_SPACES_H_
 
 #include "src/allocation.h"
 #include "src/atomic-utils.h"
 #include "src/base/atomicops.h"
@@ skipping 1613 matching lines @@
 //     and limit when the object we need to allocate is 256-2047 words in size.
 //     These spaces are call large.
 // At least 16384 words.  This list is for objects of 2048 words or larger.
 //     Empty pages are added to this list.  These spaces are called huge.
 class FreeList {
  public:
   explicit FreeList(PagedSpace* owner);
 
   intptr_t Concatenate(FreeList* free_list);
 
+  void Divide(FreeList** other_free_lists, int num, intptr_t limit);

[Hannes Payer (out of office), 2015/09/23 07:26:03]

This code should be mentioned in the CL description.

[Hannes Payer (out of office), 2015/09/23 07:26:03]

Add a description what divide is doing.

[Michael Lippautz, 2015/09/23 07:40:50]

Done.

[Michael Lippautz, 2015/09/23 07:40:50]

Done.

+
   // Clear the free list.
   void Reset();
 
   // Return the number of bytes available on the free list.
   intptr_t available() {
     return small_list_.available() + medium_list_.available() +
            large_list_.available() + huge_list_.available();
   }
 
   // Place a node on the free list.  The block of size 'size_in_bytes'
@@ skipping 1333 matching lines @@
     count = 0;
   }
   // Must be small, since an iteration is used for lookup.
   static const int kMaxComments = 64;
 };
 #endif
 }
 }  // namespace v8::internal
 
 #endif  // V8_HEAP_SPACES_H_