[crankshaft] Fragmentation-free allocation folding.

src/heap/spaces.cc

Index: src/heap/spaces.cc
diff --git a/src/heap/spaces.cc b/src/heap/spaces.cc
index 1ab5de737919cbe8d92fd9e0a31985144132aa7c..baca7ac1569145430466d052d9eb028439125e1b 100644
--- a/src/heap/spaces.cc
+++ b/src/heap/spaces.cc
@@ -2483,7 +2483,7 @@ HeapObject* FreeList::Allocate(int size_in_bytes) {
                  new_node_size - size_in_bytes - linear_size);
     owner_->SetTopAndLimit(new_node->address() + size_in_bytes,
                            new_node->address() + size_in_bytes + linear_size);
-  } else if (bytes_left > 0) {
+  } else if (bytes_left >= 0) {

[Michael Lippautz, 2016/05/10 08:32:58]

Still would rather see the else followed by a DCHECK here.

[Hannes Payer (out of office), 2016/05/10 09:04:44]

Done.

     // Normally we give the rest of the node to the allocator as its new
     // linear allocation area.
     owner_->SetTopAndLimit(new_node->address() + size_in_bytes,