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 | |
34 #include "core/fetch/ResourceLoader.h" | |
35 #include "core/layout/LayoutObject.h" | |
36 #include "platform/TraceEvent.h" | |
37 | |
38 #include "wtf/Vector.h" | |
39 | |
40 namespace blink { | |
41 | |
42 ResourceLoadPriorityOptimizer* ResourceLoadPriorityOptimizer::resourceLoadPriori
tyOptimizer() | |
43 { | |
44 DEFINE_STATIC_LOCAL(ResourceLoadPriorityOptimizer, s_renderLoadOptimizer, ()
); | |
45 return &s_renderLoadOptimizer; | |
46 } | |
47 | |
48 ResourceLoadPriorityOptimizer::ResourceAndVisibility::ResourceAndVisibility(Imag
eResource* image, VisibilityStatus visibilityStatus, uint32_t screenArea) | |
49 : imageResource(image) | |
50 , status(visibilityStatus) | |
51 , screenArea(screenArea) | |
52 { | |
53 } | |
54 | |
55 ResourceLoadPriorityOptimizer::ResourceAndVisibility::~ResourceAndVisibility() | |
56 { | |
57 } | |
58 | |
59 ResourceLoadPriorityOptimizer::ResourceLoadPriorityOptimizer() | |
60 { | |
61 } | |
62 | |
63 ResourceLoadPriorityOptimizer::~ResourceLoadPriorityOptimizer() | |
64 { | |
65 } | |
66 | |
67 void ResourceLoadPriorityOptimizer::addLayoutObject(LayoutObject* layoutObject) | |
68 { | |
69 m_objects.add(layoutObject); | |
70 layoutObject->setHasPendingResourceUpdate(true); | |
71 } | |
72 | |
73 void ResourceLoadPriorityOptimizer::removeLayoutObject(LayoutObject* layoutObjec
t) | |
74 { | |
75 if (!layoutObject->hasPendingResourceUpdate()) | |
76 return; | |
77 m_objects.remove(layoutObject); | |
78 layoutObject->setHasPendingResourceUpdate(false); | |
79 } | |
80 | |
81 void ResourceLoadPriorityOptimizer::updateAllImageResourcePriorities() | |
82 { | |
83 TRACE_EVENT0("blink", "ResourceLoadPriorityOptimizer::updateAllImageResource
Priorities"); | |
84 | |
85 m_imageResources.clear(); | |
86 | |
87 Vector<LayoutObject*> objectsToRemove; | |
88 for (const auto& layoutObject : m_objects) { | |
89 if (!layoutObject->updateImageLoadingPriorities()) | |
90 objectsToRemove.append(layoutObject); | |
91 } | |
92 m_objects.removeAll(objectsToRemove); | |
93 | |
94 updateImageResourcesWithLoadPriority(); | |
95 } | |
96 | |
97 void ResourceLoadPriorityOptimizer::updateImageResourcesWithLoadPriority() | |
98 { | |
99 for (const auto& resource : m_imageResources) { | |
100 ResourceLoadPriority priority = resource.value->status == Visible ? | |
101 ResourceLoadPriorityLow : ResourceLoadPriorityVeryLow; | |
102 | |
103 if (resource.value->imageResource->loader() && resource.value->imageReso
urce->loader()->shouldUseIncreasedPriorities()) { | |
104 priority = resource.value->status == Visible ? | |
105 ResourceLoadPriorityHigh : ResourceLoadPriorityLow; | |
106 } | |
107 | |
108 if (priority != resource.value->imageResource->resourceRequest().priorit
y()) { | |
109 resource.value->imageResource->mutableResourceRequest().setPriority(
priority, resource.value->screenArea); | |
110 resource.value->imageResource->didChangePriority(priority, resource.
value->screenArea); | |
111 } | |
112 } | |
113 m_imageResources.clear(); | |
114 } | |
115 | |
116 void ResourceLoadPriorityOptimizer::notifyImageResourceVisibility(ImageResource*
img, VisibilityStatus status, const LayoutRect& screenRect) | |
117 { | |
118 if (!img || img->isLoaded()) | |
119 return; | |
120 | |
121 int screenArea = 0; | |
122 if (!screenRect.isEmpty() && status == Visible) | |
123 screenArea += static_cast<uint32_t>(screenRect.width() * screenRect.heig
ht()); | |
124 | |
125 ImageResourceMap::AddResult result = m_imageResources.add(img->identifier(),
adoptPtr(new ResourceAndVisibility(img, status, screenArea))); | |
126 if (!result.isNewEntry && status == Visible) { | |
127 result.storedValue->value->status = Visible; | |
128 result.storedValue->value->screenArea += screenArea; | |
129 } | |
130 } | |
131 | |
132 } | |
OLD | NEW |