Split nodes and edges into separate arrays in heap profiler.

test/cctest/test-list.cc

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 112 matching lines @@
   for (int i = 0; i < kElements; i++) list.Add(i);
   for (int j = kElements - 1; j >= 0; j--) {
     CHECK_EQ(j + 1, list.length());
     CHECK_EQ(j, list.last());
     list.RemoveLast();
     CHECK_EQ(j, list.length());
   }
 }
 
 
+TEST(Allocate) {
+  List<int> list(4);
+  list.Add(1);
+  CHECK_EQ(1, list.length());
+  list.Allocate(100);
+  CHECK_EQ(100, list.length());
+  CHECK_LE(100, list.capacity());
+  list[99] = 123;
+  CHECK_EQ(123, list[99]);
+}
+
+
 TEST(Clear) {
   List<int> list(4);
   CHECK_EQ(0, list.length());
   for (int i = 0; i < 4; ++i) list.Add(i);
   CHECK_EQ(4, list.length());
   list.Clear();
   CHECK_EQ(0, list.length());
 }
 
 
 TEST(DeleteEmpty) {
   {
     List<int>* list = new List<int>(0);
     delete list;
   }
   {
     List<int> list(0);
   }
 }