Oilpan: HeapVectorBacking should call destructors for its elements

Source/wtf/Deque.h

 /*
  * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2009 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
@@ skipping 320 matching lines @@
     {
         size_t oldCapacity = m_buffer.capacity();
         T* oldBuffer = m_buffer.buffer();
         size_t newCapacity = std::max(static_cast<size_t>(16), oldCapacity + oldCapacity / 4 + 1);
         if (m_buffer.expandBuffer(newCapacity)) {
             if (m_start <= m_end) {
                 // No adjustments to be done.
             } else {
                 size_t newStart = m_buffer.capacity() - (oldCapacity - m_start);
                 TypeOperations::moveOverlapping(oldBuffer + m_start, oldBuffer + oldCapacity, m_buffer.buffer() + newStart);
+                m_buffer.clearUnusedSlots(oldBuffer + m_start, oldBuffer + std::min(oldCapacity, newStart));
                 m_start = newStart;
             }
             return;
         }
         m_buffer.allocateBuffer(newCapacity);
-        if (m_start <= m_end)
+        if (m_start <= m_end) {
             TypeOperations::move(oldBuffer + m_start, oldBuffer + m_end, m_buffer.buffer() + m_start);
-        else {
+            m_buffer.clearUnusedSlots(oldBuffer + m_start, oldBuffer + m_end);
+        } else {
             TypeOperations::move(oldBuffer, oldBuffer + m_end, m_buffer.buffer());
+            m_buffer.clearUnusedSlots(oldBuffer, oldBuffer + m_end);
             size_t newStart = m_buffer.capacity() - (oldCapacity - m_start);
             TypeOperations::move(oldBuffer + m_start, oldBuffer + oldCapacity, m_buffer.buffer() + newStart);
+            m_buffer.clearUnusedSlots(oldBuffer + m_start, oldBuffer + oldCapacity);
             m_start = newStart;
         }
         m_buffer.deallocateBuffer(oldBuffer);
     }
 
     template<typename T, size_t inlineCapacity, typename Allocator>
     inline typename Deque<T, inlineCapacity, Allocator>::PassType Deque<T, inlineCapacity, Allocator>::takeFirst()
     {
         T oldFirst = Pass::transfer(first());
         removeFirst();
@@ skipping 200 matching lines @@
     struct NeedsTracing<Deque<T, N>> {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::Deque;
 
 #endif // WTF_Deque_h