| OLD | NEW |
| (Empty) |
| 1 /* | |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 29 */ | |
| 30 | |
| 31 #include "config.h" | |
| 32 #include "core/fetch/ResourceLoadPriorityOptimizer.h" | |
| 33 #include "core/layout/LayoutObject.h" | |
| 34 #include "platform/TraceEvent.h" | |
| 35 | |
| 36 #include "wtf/Vector.h" | |
| 37 | |
| 38 namespace blink { | |
| 39 | |
| 40 ResourceLoadPriorityOptimizer* ResourceLoadPriorityOptimizer::resourceLoadPriori
tyOptimizer() | |
| 41 { | |
| 42 DEFINE_STATIC_LOCAL(ResourceLoadPriorityOptimizer, s_renderLoadOptimizer, ()
); | |
| 43 return &s_renderLoadOptimizer; | |
| 44 } | |
| 45 | |
| 46 ResourceLoadPriorityOptimizer::ResourceAndVisibility::ResourceAndVisibility(Imag
eResource* image, VisibilityStatus visibilityStatus, uint32_t screenArea) | |
| 47 : imageResource(image) | |
| 48 , status(visibilityStatus) | |
| 49 , screenArea(screenArea) | |
| 50 { | |
| 51 } | |
| 52 | |
| 53 ResourceLoadPriorityOptimizer::ResourceAndVisibility::~ResourceAndVisibility() | |
| 54 { | |
| 55 } | |
| 56 | |
| 57 ResourceLoadPriorityOptimizer::ResourceLoadPriorityOptimizer() | |
| 58 { | |
| 59 } | |
| 60 | |
| 61 ResourceLoadPriorityOptimizer::~ResourceLoadPriorityOptimizer() | |
| 62 { | |
| 63 } | |
| 64 | |
| 65 void ResourceLoadPriorityOptimizer::addLayoutObject(LayoutObject* layoutObject) | |
| 66 { | |
| 67 m_objects.add(layoutObject); | |
| 68 layoutObject->setHasPendingResourceUpdate(true); | |
| 69 } | |
| 70 | |
| 71 void ResourceLoadPriorityOptimizer::removeLayoutObject(LayoutObject* layoutObjec
t) | |
| 72 { | |
| 73 if (!layoutObject->hasPendingResourceUpdate()) | |
| 74 return; | |
| 75 m_objects.remove(layoutObject); | |
| 76 layoutObject->setHasPendingResourceUpdate(false); | |
| 77 } | |
| 78 | |
| 79 void ResourceLoadPriorityOptimizer::updateAllImageResourcePriorities() | |
| 80 { | |
| 81 TRACE_EVENT0("blink", "ResourceLoadPriorityOptimizer::updateAllImageResource
Priorities"); | |
| 82 | |
| 83 m_imageResources.clear(); | |
| 84 | |
| 85 Vector<LayoutObject*> objectsToRemove; | |
| 86 for (const auto& layoutObject : m_objects) { | |
| 87 if (!layoutObject->updateImageLoadingPriorities()) | |
| 88 objectsToRemove.append(layoutObject); | |
| 89 } | |
| 90 m_objects.removeAll(objectsToRemove); | |
| 91 | |
| 92 updateImageResourcesWithLoadPriority(); | |
| 93 } | |
| 94 | |
| 95 void ResourceLoadPriorityOptimizer::updateImageResourcesWithLoadPriority() | |
| 96 { | |
| 97 for (const auto& resource : m_imageResources) { | |
| 98 ResourceLoadPriority priority = resource.value->status == Visible ? | |
| 99 ResourceLoadPriorityLow : ResourceLoadPriorityVeryLow; | |
| 100 | |
| 101 if (priority != resource.value->imageResource->resourceRequest().priorit
y()) { | |
| 102 resource.value->imageResource->mutableResourceRequest().setPriority(
priority, resource.value->screenArea); | |
| 103 resource.value->imageResource->didChangePriority(priority, resource.
value->screenArea); | |
| 104 } | |
| 105 } | |
| 106 m_imageResources.clear(); | |
| 107 } | |
| 108 | |
| 109 void ResourceLoadPriorityOptimizer::notifyImageResourceVisibility(ImageResource*
img, VisibilityStatus status, const LayoutRect& screenRect) | |
| 110 { | |
| 111 if (!img || img->isLoaded()) | |
| 112 return; | |
| 113 | |
| 114 int screenArea = 0; | |
| 115 if (!screenRect.isEmpty() && status == Visible) | |
| 116 screenArea += static_cast<uint32_t>(screenRect.width() * screenRect.heig
ht()); | |
| 117 | |
| 118 ImageResourceMap::AddResult result = m_imageResources.add(img->identifier(),
adoptPtr(new ResourceAndVisibility(img, status, screenArea))); | |
| 119 if (!result.isNewEntry && status == Visible) { | |
| 120 result.storedValue->value->status = Visible; | |
| 121 result.storedValue->value->screenArea += screenArea; | |
| 122 } | |
| 123 } | |
| 124 | |
| 125 } | |
| OLD | NEW |