[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 c4219df48b7dbbac8a29e1d1d7e3728b16415397..6cb85742818b3063987698c4f0f3787acb48a21a 100644
--- a/src/heap/spaces.cc
+++ b/src/heap/spaces.cc
@@ -2390,7 +2390,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/04/19 10:49:50]

nit: can we do this as "else" to make clear that this will always hold? (we
already have the DCHECK on line 2357 that enforces this)

[Hannes Payer (out of office), 2016/04/19 11:03:56]

Also would also mean that this value could be negative.

     // 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,