[Oilpan] Unify memory usage reporters of Oilpan

third_party/WebKit/Source/core/html/CollectionItemsCache.h

 /*
  * Copyright (C) 2012,2013 Google Inc. All rights reserved.
  * Copyright (C) 2014 Apple 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 42 matching lines @@
         visitor->trace(m_cachedList);
         Base::trace(visitor);
     }
 
     unsigned nodeCount(const Collection&);
     NodeType* nodeAt(const Collection&, unsigned index);
     void invalidate();
 
 private:
     ptrdiff_t allocationSize() const { return m_cachedList.capacity() * sizeof(NodeType*); }
-    static void reportExtraMemoryCostForCollectionItemsCache(ptrdiff_t diff)
-    {
-        v8::Isolate::GetCurrent()->AdjustAmountOfExternalAllocatedMemory(diff);
-    }
 
     bool m_listValid;
     WillBeHeapVector<RawPtrWillBeMember<NodeType>> m_cachedList;
 };
 
 template <typename Collection, typename NodeType>
 CollectionItemsCache<Collection, NodeType>::CollectionItemsCache()
     : m_listValid(false)
 {
 }
 
 template <typename Collection, typename NodeType>
 CollectionItemsCache<Collection, NodeType>::~CollectionItemsCache()
 {
-    if (ptrdiff_t diff = allocationSize())
-        reportExtraMemoryCostForCollectionItemsCache(-diff);
 }
 
 template <typename Collection, typename NodeType>
 void CollectionItemsCache<Collection, NodeType>::invalidate()
 {
     Base::invalidate();
     if (m_listValid) {
         m_cachedList.shrink(0);
         m_listValid = false;
     }
 }
 
 template <class Collection, class NodeType>
 unsigned CollectionItemsCache<Collection, NodeType>::nodeCount(const Collection& collection)
 {
     if (this->isCachedNodeCountValid())
         return this->cachedNodeCount();
 
     NodeType* currentNode = collection.traverseToFirst();
     unsigned currentIndex = 0;
-    ptrdiff_t oldCapacity = allocationSize();
     while (currentNode) {
         m_cachedList.append(currentNode);
         currentNode = collection.traverseForwardToOffset(currentIndex + 1, *currentNode, currentIndex);
     }
-    if (ptrdiff_t diff = allocationSize() - oldCapacity)
-        reportExtraMemoryCostForCollectionItemsCache(diff);
 
     this->setCachedNodeCount(m_cachedList.size());
     m_listValid = true;
     return this->cachedNodeCount();
 }
 
 template <typename Collection, typename NodeType>
 inline NodeType* CollectionItemsCache<Collection, NodeType>::nodeAt(const Collection& collection, unsigned index)
 {
     if (m_listValid) {
         ASSERT(this->isCachedNodeCountValid());
         return index < this->cachedNodeCount() ? m_cachedList[index] : nullptr;
     }
     return Base::nodeAt(collection, index);
 }
 
 } // namespace blink
 
 #endif // CollectionItemsCache_h