Replace HeapType with a non-templated FieldType class.

src/list.h

 // Copyright 2011 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef V8_LIST_H_
 #define V8_LIST_H_
 
 #include <algorithm>
 
 #include "src/checks.h"
@@ skipping 189 matching lines @@
 };
 
 
 template<typename T, class P>
 size_t GetMemoryUsedByList(const List<T, P>& list) {
   return list.length() * sizeof(T) + sizeof(list);
 }
 
 
 class Map;
-template<class> class TypeImpl;
-struct HeapTypeConfig;
-typedef TypeImpl<HeapTypeConfig> HeapType;
+class FieldType;
 class Code;
 template<typename T> class Handle;
 typedef List<Map*> MapList;
 typedef List<Code*> CodeList;
 typedef List<Handle<Map> > MapHandleList;
-typedef List<Handle<HeapType> > TypeHandleList;
+typedef List<Handle<FieldType> > TypeHandleList;
 typedef List<Handle<Code> > CodeHandleList;
 
 // Perform binary search for an element in an already sorted
 // list. Returns the index of the element of -1 if it was not found.
 // |cmp| is a predicate that takes a pointer to an element of the List
 // and returns +1 if it is greater, -1 if it is less than the element
 // being searched.
 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 internal
 }  // namespace v8
 
 
 #endif  // V8_LIST_H_