1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476
|
/*
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.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "third_party/blink/renderer/platform/loader/fetch/memory_cache.h"
#include <utility>
#include "base/feature_list.h"
#include "base/functional/bind.h"
#include "base/logging.h"
#include "base/metrics/histogram_functions.h"
#include "base/task/single_thread_task_runner.h"
#include "third_party/blink/public/common/features.h"
#include "third_party/blink/public/platform/platform.h"
#include "third_party/blink/renderer/platform/heap/garbage_collected.h"
#include "third_party/blink/renderer/platform/heap/visitor.h"
#include "third_party/blink/renderer/platform/instrumentation/tracing/trace_event.h"
#include "third_party/blink/renderer/platform/loader/fetch/resource_loading_log.h"
#include "third_party/blink/renderer/platform/scheduler/public/main_thread.h"
#include "third_party/blink/renderer/platform/weborigin/security_origin.h"
#include "third_party/blink/renderer/platform/wtf/functional.h"
#include "third_party/blink/renderer/platform/wtf/math_extras.h"
namespace blink {
static Persistent<MemoryCache>* g_memory_cache;
static constexpr base::TimeDelta kDefaultStrongReferencePruneDelay =
base::Minutes(5);
// Feature to control the duration for which a strong reference may remain
// in the MemoryCache after its last access.
BASE_FEATURE(kMemoryCacheChangeStrongReferencePruneDelay,
"MemoryCacheChangeStrongReferencePruneDelay",
base::FEATURE_DISABLED_BY_DEFAULT);
// Parameter defining the delay after which a strong reference is removed
// from the MemoryCache after its last access.
BASE_FEATURE_PARAM(base::TimeDelta,
kMemoryCacheStrongReferencePruneDelay,
&kMemoryCacheChangeStrongReferencePruneDelay,
"strong_reference_prune_delay",
kDefaultStrongReferencePruneDelay);
static constexpr char kPageSavedResourceStrongReferenceSize[] =
"Blink.MemoryCache.PageSavedResourceStrongReferenceSize";
MemoryCache* ReplaceMemoryCacheForTesting(MemoryCache* cache) {
MemoryCache::Get();
MemoryCache* old_cache = g_memory_cache->Release();
*g_memory_cache = cache;
MemoryCacheDumpProvider::Instance()->SetMemoryCache(cache);
return old_cache;
}
void MemoryCacheEntry::Trace(Visitor* visitor) const {
visitor->template RegisterWeakCallbackMethod<
MemoryCacheEntry, &MemoryCacheEntry::ClearResourceWeak>(this);
}
void MemoryCacheEntry::ClearResourceWeak(const LivenessBroker& info) {
if (!resource_ || info.IsHeapObjectAlive(resource_))
return;
MemoryCache::Get()->Remove(resource_.Get());
resource_.Clear();
}
// static
MemoryCache* MemoryCache::Get() {
DCHECK(WTF::IsMainThread());
if (!g_memory_cache) {
g_memory_cache = new Persistent<MemoryCache>(
MakeGarbageCollected<MemoryCache>(Thread::MainThread()->GetTaskRunner(
MainThreadTaskRunnerRestricted())));
}
return g_memory_cache->Get();
}
MemoryCache::MemoryCache(
scoped_refptr<base::SingleThreadTaskRunner> task_runner)
: strong_references_prune_duration_(
kMemoryCacheStrongReferencePruneDelay.Get()),
task_runner_(std::move(task_runner)) {
MemoryCacheDumpProvider::Instance()->SetMemoryCache(this);
MemoryPressureListenerRegistry::Instance().RegisterClient(this);
}
MemoryCache::~MemoryCache() = default;
void MemoryCache::Trace(Visitor* visitor) const {
visitor->Trace(resource_maps_);
visitor->Trace(strong_references_);
MemoryCacheDumpClient::Trace(visitor);
MemoryPressureListener::Trace(visitor);
}
KURL MemoryCache::RemoveFragmentIdentifierIfNeeded(const KURL& original_url) {
if (!original_url.HasFragmentIdentifier())
return original_url;
// 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 (!original_url.ProtocolIsInHTTPFamily())
return original_url;
KURL url = original_url;
url.RemoveFragmentIdentifier();
return url;
}
String MemoryCache::DefaultCacheIdentifier() {
return g_empty_string;
}
MemoryCache::ResourceMap* MemoryCache::EnsureResourceMap(
const String& cache_identifier) {
if (!resource_maps_.Contains(cache_identifier)) {
ResourceMapIndex::AddResult result = resource_maps_.insert(
cache_identifier, MakeGarbageCollected<ResourceMap>());
CHECK(result.is_new_entry);
}
return resource_maps_.at(cache_identifier);
}
void MemoryCache::Add(Resource* resource) {
DCHECK(resource);
ResourceMap* resources = EnsureResourceMap(resource->CacheIdentifier());
AddInternal(resources, MakeGarbageCollected<MemoryCacheEntry>(resource));
RESOURCE_LOADING_DVLOG(1)
<< "MemoryCache::add Added " << resource->Url().GetString()
<< ", resource " << resource;
}
void MemoryCache::AddInternal(ResourceMap* resource_map,
MemoryCacheEntry* entry) {
DCHECK(WTF::IsMainThread());
DCHECK(resource_map);
Resource* resource = entry->GetResource();
if (!resource)
return;
DCHECK(resource->Url().IsValid());
KURL url = RemoveFragmentIdentifierIfNeeded(resource->Url());
ResourceMap::iterator it = resource_map->find(url);
if (it != resource_map->end()) {
Resource* old_resource = it->value->GetResource();
CHECK_NE(old_resource, resource);
Update(old_resource, old_resource->size(), 0);
strong_references_.erase(old_resource);
}
resource_map->Set(url, entry);
Update(resource, 0, resource->size());
}
void MemoryCache::Remove(Resource* resource) {
DCHECK(WTF::IsMainThread());
DCHECK(resource);
// Resources can be created with garbage urls in error cases. These Resources
// should never be added to the cache (AddInternal() DCHECKs that the url is
// valid). Null urls will crash if we attempt to hash them, so early exit.
if (resource->Url().IsNull())
return;
RESOURCE_LOADING_DVLOG(1) << "Evicting resource " << resource << " for "
<< resource->Url().GetString() << " from cache";
TRACE_EVENT1("blink", "MemoryCache::evict", "resource",
resource->Url().GetString().Utf8());
const auto resource_maps_it =
resource_maps_.find(resource->CacheIdentifier());
if (resource_maps_it == resource_maps_.end())
return;
ResourceMap* resources = resource_maps_it->value.Get();
KURL url = RemoveFragmentIdentifierIfNeeded(resource->Url());
ResourceMap::iterator it = resources->find(url);
if (it == resources->end() || it->value->GetResource() != resource)
return;
RemoveInternal(resources, it);
}
void MemoryCache::RemoveInternal(ResourceMap* resource_map,
const ResourceMap::iterator& it) {
DCHECK(WTF::IsMainThread());
DCHECK(resource_map);
Resource* resource = it->value->GetResource();
DCHECK(resource);
Update(resource, resource->size(), 0);
resource_map->erase(it);
strong_references_.erase(resource);
}
bool MemoryCache::Contains(const Resource* resource) const {
if (!resource || resource->Url().IsEmpty())
return false;
const auto resource_maps_it =
resource_maps_.find(resource->CacheIdentifier());
if (resource_maps_it == resource_maps_.end())
return false;
const ResourceMap* resources = resource_maps_it->value.Get();
KURL url = RemoveFragmentIdentifierIfNeeded(resource->Url());
const auto resources_it = resources->find(url);
if (resources_it == resources->end())
return false;
return resource == resources_it->value->GetResource();
}
Resource* MemoryCache::ResourceForURLForTesting(
const KURL& resource_url) const {
return ResourceForURL(resource_url, DefaultCacheIdentifier());
}
Resource* MemoryCache::ResourceForURL(const KURL& resource_url,
const String& cache_identifier) const {
DCHECK(WTF::IsMainThread());
if (!resource_url.IsValid() || resource_url.IsNull())
return nullptr;
DCHECK(!cache_identifier.IsNull());
const auto resource_maps_it = resource_maps_.find(cache_identifier);
if (resource_maps_it == resource_maps_.end()) {
return nullptr;
}
const ResourceMap* resources = resource_maps_it->value.Get();
KURL url = RemoveFragmentIdentifierIfNeeded(resource_url);
const auto resources_it = resources->find(url);
if (resources_it == resources->end()) {
return nullptr;
}
return resources_it->value->GetResource();
}
HeapVector<Member<Resource>> MemoryCache::ResourcesForURL(
const KURL& resource_url) const {
DCHECK(WTF::IsMainThread());
KURL url = RemoveFragmentIdentifierIfNeeded(resource_url);
HeapVector<Member<Resource>> results;
for (const auto& resource_maps_it : resource_maps_) {
const auto resources_it = resource_maps_it.value->find(url);
if (resources_it == resource_maps_it.value->end())
continue;
Resource* resource = resources_it->value->GetResource();
DCHECK(resource);
results.push_back(resource);
}
return results;
}
void MemoryCache::Update(Resource* resource, size_t old_size, size_t new_size) {
ptrdiff_t delta = new_size - old_size;
if (Contains(resource)) {
DCHECK(delta >= 0 || size_ >= static_cast<size_t>(-delta));
size_ += delta;
}
if (strong_references_.Contains(resource)) {
PruneStrongReferences();
}
}
void MemoryCache::RemoveURLFromCache(const KURL& url) {
HeapVector<Member<Resource>> resources = ResourcesForURL(url);
for (Resource* resource : resources)
Remove(resource);
}
void MemoryCache::TypeStatistic::AddResource(Resource* o) {
count++;
size += o->size();
decoded_size += o->DecodedSize();
encoded_size += o->EncodedSize();
overhead_size += o->OverheadSize();
code_cache_size += o->CodeCacheSize();
encoded_size_duplicated_in_data_urls +=
o->Url().ProtocolIsData() ? o->EncodedSize() : 0;
}
MemoryCache::Statistics MemoryCache::GetStatistics() const {
Statistics stats;
for (const auto& resource_map_iter : resource_maps_) {
for (const auto& resource_iter : *resource_map_iter.value) {
Resource* resource = resource_iter.value->GetResource();
DCHECK(resource);
switch (resource->GetType()) {
case ResourceType::kImage:
stats.images.AddResource(resource);
break;
case ResourceType::kCSSStyleSheet:
stats.css_style_sheets.AddResource(resource);
break;
case ResourceType::kScript:
stats.scripts.AddResource(resource);
break;
case ResourceType::kXSLStyleSheet:
stats.xsl_style_sheets.AddResource(resource);
break;
case ResourceType::kFont:
stats.fonts.AddResource(resource);
break;
default:
stats.other.AddResource(resource);
break;
}
}
}
return stats;
}
void MemoryCache::EvictResources() {
for (auto resource_map_iter = resource_maps_.begin();
resource_map_iter != resource_maps_.end();) {
ResourceMap* resources = resource_map_iter->value.Get();
for (auto resource_iter = resources->begin();
resource_iter != resources->end();
resource_iter = resources->begin()) {
DCHECK(resource_iter.Get());
DCHECK(resource_iter->value.Get());
DCHECK(resource_iter->value->GetResource());
Resource* resource = resource_iter->value->GetResource();
DCHECK(resource);
RemoveInternal(resources, resource_iter);
}
resource_maps_.erase(resource_map_iter);
resource_map_iter = resource_maps_.begin();
}
ClearStrongReferences();
}
bool MemoryCache::OnMemoryDump(WebMemoryDumpLevelOfDetail level_of_detail,
WebProcessMemoryDump* memory_dump) {
if (level_of_detail == WebMemoryDumpLevelOfDetail::kBackground) {
Statistics stats = GetStatistics();
WebMemoryAllocatorDump* dump1 =
memory_dump->CreateMemoryAllocatorDump("web_cache/Image_resources");
dump1->AddScalar("size", "bytes",
stats.images.encoded_size + stats.images.overhead_size);
WebMemoryAllocatorDump* dump2 = memory_dump->CreateMemoryAllocatorDump(
"web_cache/CSS stylesheet_resources");
dump2->AddScalar("size", "bytes",
stats.css_style_sheets.encoded_size +
stats.css_style_sheets.overhead_size);
WebMemoryAllocatorDump* dump3 =
memory_dump->CreateMemoryAllocatorDump("web_cache/Script_resources");
dump3->AddScalar("size", "bytes",
stats.scripts.encoded_size + stats.scripts.overhead_size);
WebMemoryAllocatorDump* dump4 = memory_dump->CreateMemoryAllocatorDump(
"web_cache/XSL stylesheet_resources");
dump4->AddScalar("size", "bytes",
stats.xsl_style_sheets.encoded_size +
stats.xsl_style_sheets.overhead_size);
WebMemoryAllocatorDump* dump5 =
memory_dump->CreateMemoryAllocatorDump("web_cache/Font_resources");
dump5->AddScalar("size", "bytes",
stats.fonts.encoded_size + stats.fonts.overhead_size);
WebMemoryAllocatorDump* dump6 =
memory_dump->CreateMemoryAllocatorDump("web_cache/Code_cache");
dump6->AddScalar("size", "bytes", stats.scripts.code_cache_size);
WebMemoryAllocatorDump* dump7 = memory_dump->CreateMemoryAllocatorDump(
"web_cache/Encoded_size_duplicated_in_data_urls");
dump7->AddScalar("size", "bytes",
stats.other.encoded_size +
stats.other.encoded_size_duplicated_in_data_urls);
WebMemoryAllocatorDump* dump8 =
memory_dump->CreateMemoryAllocatorDump("web_cache/Other_resources");
dump8->AddScalar("size", "bytes",
stats.other.encoded_size + stats.other.overhead_size);
return true;
}
for (const auto& resource_map_iter : resource_maps_) {
for (const auto& resource_iter : *resource_map_iter.value) {
Resource* resource = resource_iter.value->GetResource();
resource->OnMemoryDump(level_of_detail, memory_dump);
}
}
return true;
}
void MemoryCache::OnMemoryPressure(
base::MemoryPressureListener::MemoryPressureLevel level) {
if (base::FeatureList::IsEnabled(
features::kReleaseResourceStrongReferencesOnMemoryPressure)) {
ClearStrongReferences();
}
}
void MemoryCache::SavePageResourceStrongReferences(
HeapVector<Member<Resource>> resources) {
DCHECK(base::FeatureList::IsEnabled(features::kMemoryCacheStrongReference));
base::UmaHistogramCustomCounts(kPageSavedResourceStrongReferenceSize,
resources.size(), 0, 200, 50);
for (Resource* resource : resources) {
resource->UpdateMemoryCacheLastAccessedTime();
strong_references_.AppendOrMoveToLast(resource);
}
PruneStrongReferences();
}
void MemoryCache::SaveStrongReference(Resource* resource) {
resource->UpdateMemoryCacheLastAccessedTime();
strong_references_.AppendOrMoveToLast(resource);
PruneStrongReferences();
}
void MemoryCache::PruneStrongReferences() {
DCHECK(base::FeatureList::IsEnabled(features::kMemoryCacheStrongReference));
static const size_t max_threshold = static_cast<size_t>(
features::kMemoryCacheStrongReferenceTotalSizeThresholdParam.Get());
base::TimeTicks last_ticks;
size_t strong_reference_total_size = 0;
for (Resource* resource : strong_references_) {
// Sanity check on data structure.
CHECK(resource->MemoryCacheLastAccessed() >= last_ticks);
last_ticks = resource->MemoryCacheLastAccessed();
strong_reference_total_size += resource->size();
}
while (strong_reference_total_size > max_threshold) {
CHECK(!strong_references_.empty());
Resource* front_resource = strong_references_.front();
strong_references_.erase(strong_references_.begin());
size_t resource_size = front_resource->size();
CHECK_GE(strong_reference_total_size, resource_size);
strong_reference_total_size -= resource_size;
}
base::TimeTicks now = base::TimeTicks::Now();
while (!strong_references_.empty()) {
Resource* front_resource = strong_references_.front();
base::TimeTicks next_expiry = front_resource->MemoryCacheLastAccessed() +
strong_references_prune_duration_;
if (next_expiry > now) {
if (strong_references_prune_time_ < now ||
strong_references_prune_time_ > next_expiry) {
task_runner_->PostDelayedTask(
FROM_HERE,
base::BindOnce(&MemoryCache::PruneStrongReferences,
WrapWeakPersistent(this)),
next_expiry - now);
strong_references_prune_time_ = next_expiry;
}
break;
}
strong_references_.erase(strong_references_.begin());
}
}
void MemoryCache::ClearStrongReferences() {
strong_references_.clear();
}
} // namespace blink
|