Chromium Code Reviews| 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 namespace WebCore { | |
| 35 | |
| 36 ResourceLoadPriorityOptimizer::ResourceAndVisibility::ResourceAndVisibility(Imag eResource* img, VisibilityStatus v) | |
| 37 : imageResource(img) | |
| 38 , status(v) | |
| 39 { | |
| 40 } | |
| 41 | |
| 42 ResourceLoadPriorityOptimizer::ResourceAndVisibility::ResourceAndVisibility() | |
| 43 : imageResource(0) | |
| 44 , status(NotVisible) | |
| 45 { | |
| 46 } | |
| 47 | |
| 48 ResourceLoadPriorityOptimizer::ResourceAndVisibility::~ResourceAndVisibility() | |
| 49 { | |
| 50 } | |
| 51 | |
| 52 ResourceLoadPriorityOptimizer::ResourceLoadPriorityOptimizer() | |
| 53 { | |
| 54 } | |
| 55 | |
| 56 ResourceLoadPriorityOptimizer::~ResourceLoadPriorityOptimizer() | |
| 57 { | |
| 58 updateImageResourcesWithLoadPriority(); | |
| 59 } | |
| 60 | |
| 61 void ResourceLoadPriorityOptimizer::updateImageResourcesWithLoadPriority() | |
| 62 { | |
| 63 for (ImageResourceMap::iterator it = m_imageResources.begin(); it != m_image Resources.end(); ++it) { | |
| 64 ResourceLoadPriority priority = it->value.status == Visible ? | |
| 65 ResourceLoadPriorityLow : ResourceLoadPriorityVeryLow; | |
| 66 | |
| 67 if (priority != it->value.imageResource->resourceRequest().priority()) { | |
| 68 it->value.imageResource->resourceRequest().setPriority(priority); | |
| 69 it->value.imageResource->didChangePriority(priority); | |
| 70 } | |
| 71 } | |
| 72 m_imageResources.clear(); | |
| 73 } | |
| 74 | |
| 75 void ResourceLoadPriorityOptimizer::notifyImageResourceVisibility(ImageResource* img, VisibilityStatus status) | |
|
abarth-chromium
2013/12/02 19:34:56
img -> image
(Please use complete words in variab
shatch
2013/12/02 22:32:46
Done.
| |
| 76 { | |
| 77 if (!img || img->isLoaded()) | |
|
eseidel
2013/11/27 20:58:35
Yes! Sorry, missed this in my first pass.
| |
| 78 return; | |
| 79 | |
| 80 if (status == Visible) { | |
| 81 m_imageResources.set(img->identifier(), ResourceAndVisibility(img, statu s)); | |
| 82 } else { | |
| 83 // If the resource exists in the map, don't overwrite since it might hav e been visible from | |
|
eseidel
2013/11/27 20:58:35
Shouldn't we just always call add? I guess you wa
shatch
2013/12/02 22:32:46
Reworked it a little bit to be less confusing.
| |
| 84 // some other RenderObject. HashMap::add will only add the value if the key doesn't exist in | |
| 85 // the table. | |
| 86 m_imageResources.add(img->identifier(), ResourceAndVisibility(img, statu s)); | |
| 87 } | |
| 88 } | |
| 89 | |
| 90 } | |
| OLD | NEW |