Revert of Add MemoryCoordinatorClient

third_party/WebKit/Source/core/fetch/MemoryCache.cpp

 /*
     Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de)
     Copyright (C) 2001 Dirk Mueller (mueller@kde.org)
     Copyright (C) 2002 Waldo Bastian (bastian@kde.org)
     Copyright (C) 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
 
     This library is free software; you can redistribute it and/or
     modify it under the terms of the GNU Library General Public
     License as published by the Free Software Foundation; either
     version 2 of the License, or (at your option) any later version.
@@ skipping 86 matching lines @@
     , m_maxDeadCapacity(cDefaultCacheCapacity)
     , m_maxDeferredPruneDeadCapacity(cDeferredPruneDeadCapacityFactor * cDefaultCacheCapacity)
     , m_delayBeforeLiveDecodedPrune(cMinDelayBeforeLiveDecodedPrune)
     , m_liveSize(0)
     , m_deadSize(0)
 #ifdef MEMORY_CACHE_STATS
     , m_statsTimer(this, &MemoryCache::dumpStats)
 #endif
 {
     MemoryCacheDumpProvider::instance()->setMemoryCache(this);
-    if (ProcessHeap::isLowEndDevice())
-        MemoryCoordinator::instance().registerClient(this);
 #ifdef MEMORY_CACHE_STATS
     const double statsIntervalInSeconds = 15;
     m_statsTimer.startRepeating(statsIntervalInSeconds, BLINK_FROM_HERE);
 #endif
 }
 
 MemoryCache* MemoryCache::create()
 {
     return new MemoryCache;
 }
 
 MemoryCache::~MemoryCache()
 {
     if (m_prunePending)
         Platform::current()->currentThread()->removeTaskObserver(this);
 }
 
 DEFINE_TRACE(MemoryCache)
 {
     visitor->trace(m_allResources);
     visitor->trace(m_liveDecodedResources);
     visitor->trace(m_resourceMaps);
     MemoryCacheDumpClient::trace(visitor);
-    MemoryCoordinatorClient::trace(visitor);
 }
 
 KURL MemoryCache::removeFragmentIdentifierIfNeeded(const KURL& originalURL)
 {
     if (!originalURL.hasFragmentIdentifier())
         return originalURL;
     // Strip away fragment identifier from HTTP URLs.
     // Data URLs must be unmodified. For file and custom URLs clients may expect resources
     // to be unique even when they differ by the fragment identifier only.
     if (!originalURL.protocolIsInHTTPFamily())
@@ skipping 588 matching lines @@
 {
     for (const auto& resourceMapIter : m_resourceMaps) {
         for (const auto& resourceIter : *resourceMapIter.value) {
             Resource* resource = resourceIter.value->resource();
             resource->onMemoryDump(levelOfDetail, memoryDump);
         }
     }
     return true;
 }
 
-void MemoryCache::onMemoryPressure(WebMemoryPressureLevel level)
-{
-    pruneAll();
-}
-
 bool MemoryCache::isInSameLRUListForTest(const Resource* x, const Resource* y)
 {
     MemoryCacheEntry* ex = getEntryForResource(x);
     MemoryCacheEntry* ey = getEntryForResource(y);
     ASSERT(ex);
     ASSERT(ey);
     return lruListFor(ex->m_accessCount, x->size()) == lruListFor(ey->m_accessCount, y->size());
 }
 
 #ifdef MEMORY_CACHE_STATS
@@ skipping 34 matching lines @@
                 printf("(%.1fK, %.1fK, %uA, %dR, %d); ", currentResource->decodedSize() / 1024.0f, (currentResource->encodedSize() + currentResource->overheadSize()) / 1024.0f, current->m_accessCount, currentResource->hasClientsOrObservers(), currentResource->isPurgeable());
 
             current = current->m_previousInAllResourcesList;
         }
     }
 }
 
 #endif // MEMORY_CACHE_STATS
 
 } // namespace blink