Split nodes and edges into separate arrays in heap profiler.

src/list-inl.h

 // Copyright 2006-2009 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 119 matching lines @@
     if (data_[i] == elm) {
       Remove(i);
       return true;
     }
   }
   return false;
 }
 
 
 template<typename T, class P>
+void List<T, P>::Allocate(int length) {
+  DeleteData(data_);
+  Initialize(length);
+  length_ = length;
+}
+
+
+template<typename T, class P>
 void List<T, P>::Clear() {
   DeleteData(data_);
   Initialize(0);
 }
 
 
 template<typename T, class P>
 void List<T, P>::Rewind(int pos) {
   length_ = pos;
 }
@@ skipping 94 matching lines @@
 
 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem) {
   return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem));
 }
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_LIST_INL_H_