Revert "Break deserializer reservations into chunks that fit onto a page."

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 "src/checks.h"
 #include "src/utils.h"
 
@@ skipping 62 matching lines @@
   typedef T* iterator;
   inline iterator begin() const { return &data_[0]; }
   inline iterator end() const { return &data_[length_]; }
 
   INLINE(bool is_empty() const) { return length_ == 0; }
   INLINE(int length() const) { return length_; }
   INLINE(int capacity() const) { return capacity_; }
 
   Vector<T> ToVector() const { return Vector<T>(data_, length_); }
 
-  Vector<const T> ToConstVector() const {
-    return Vector<const T>(data_, length_);
-  }
+  Vector<const T> ToConstVector() { return Vector<const T>(data_, length_); }
 
   // Adds a copy of the given 'element' to the end of the list,
   // expanding the list if necessary.
   void Add(const T& element, AllocationPolicy allocator = AllocationPolicy());
 
   // Add all the elements from the argument list to this list.
   void AddAll(const List<T, AllocationPolicy>& other,
               AllocationPolicy allocator = AllocationPolicy());
 
   // Add all the elements from the vector to this list.
@@ skipping 112 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_