Split nodes and edges into separate arrays in heap profiler.

src/list.h

 // 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 99 matching lines @@
   T Remove(int i);
 
   // Remove the given element from the list. Returns whether or not
   // the input is included in the list in the first place.
   bool RemoveElement(const T& elm);
 
   // Removes the last element without deleting it even if T is a
   // pointer type. Returns the removed element.
   INLINE(T RemoveLast()) { return Remove(length_ - 1); }
 
+  // Allocates space for 'length' elements.

[mnaganov (inactive), 2012/05/08 12:05:20]

nit: Please state that it also deletes current list contents.

[alexeif, 2012/05/09 12:38:07]

Done.

+  INLINE(void Allocate(int length));
+
   // Clears the list by setting the length to zero. Even if T is a
   // pointer type, clearing the list doesn't delete the entries.
   INLINE(void Clear());
 
   // Drops all but the first 'pos' elements from the list.
   INLINE(void Rewind(int pos));
 
   // Drop the last 'count' elements from the list.
   INLINE(void RewindBy(int count)) { Rewind(length_ - count); }
 
@@ skipping 49 matching lines @@
 template <typename T, class P>
 int SortedListBSearch(const List<T>& list, P cmp);
 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem);
 
 
 } }  // namespace v8::internal
 
 
 #endif  // V8_LIST_H_