Add DiscardableMemoryAllocator to work around FD limit issue.

base/memory/scoped_vector.h

 // Copyright (c) 2012 The Chromium 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 BASE_MEMORY_SCOPED_VECTOR_H_
 #define BASE_MEMORY_SCOPED_VECTOR_H_
 
 #include <vector>
 
 #include "base/basictypes.h"
@@ skipping 46 matching lines @@
   iterator end() { return v_.end(); }
   const_iterator end() const { return v_.end(); }
 
   const_reference front() const { return v_.front(); }
   reference front() { return v_.front(); }
   const_reference back() const { return v_.back(); }
   reference back() { return v_.back(); }
 
   void push_back(T* elem) { v_.push_back(elem); }
 
+  void pop_back() {
+    DCHECK(!empty());

[willchan no longer on Chromium, 2013/11/28 17:44:19]

Add logging.h for this.

[Philippe, 2013/11/29 12:41:05]

Done.

+    delete v_.back();
+    v_.pop_back();
+  }
+
   std::vector<T*>& get() { return v_; }
   const std::vector<T*>& get() const { return v_; }
   void swap(std::vector<T*>& other) { v_.swap(other); }
   void swap(ScopedVector<T>& other) { v_.swap(other.v_); }
   void release(std::vector<T*>* out) {
     out->swap(v_);
     v_.clear();
   }
 
   void reserve(size_t capacity) { v_.reserve(capacity); }
@@ skipping 44 matching lines @@
   // Like |erase()|, but doesn't delete the elements in [first, last).
   iterator weak_erase(iterator first, iterator last) {
     return v_.erase(first, last);
   }
 
  private:
   std::vector<T*> v_;
 };
 
 #endif  // BASE_MEMORY_SCOPED_VECTOR_H_