Home | History | Annotate | Download | only in fetch 
      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(ImageResource* image, VisibilityStatus v)
     37     : imageResource(image)
     38     , status(v)
     39 {
     40 }
     41 
     42 ResourceLoadPriorityOptimizer::ResourceAndVisibility::~ResourceAndVisibility()
     43 {
     44 }
     45 
     46 ResourceLoadPriorityOptimizer::ResourceLoadPriorityOptimizer()
     47 {
     48 }
     49 
     50 ResourceLoadPriorityOptimizer::~ResourceLoadPriorityOptimizer()
     51 {
     52     updateImageResourcesWithLoadPriority();
     53 }
     54 
     55 void ResourceLoadPriorityOptimizer::updateImageResourcesWithLoadPriority()
     56 {
     57     for (ImageResourceMap::iterator it = m_imageResources.begin(); it != m_imageResources.end(); ++it) {
     58         ResourceLoadPriority priority = it->value->status == Visible ?
     59             ResourceLoadPriorityLow : ResourceLoadPriorityVeryLow;
     60 
     61         if (priority != it->value->imageResource->resourceRequest().priority()) {
     62             it->value->imageResource->resourceRequest().setPriority(priority);
     63             it->value->imageResource->didChangePriority(priority);
     64         }
     65     }
     66     m_imageResources.clear();
     67 }
     68 
     69 void ResourceLoadPriorityOptimizer::notifyImageResourceVisibility(ImageResource* img, VisibilityStatus status)
     70 {
     71     if (!img || img->isLoaded())
     72         return;
     73 
     74     ImageResourceMap::AddResult result = m_imageResources.add(img->identifier(), adoptPtr(new ResourceAndVisibility(img, status)));
     75     if (!result.isNewEntry && status == Visible)
     76         result.iterator->value->status = status;
     77 }
     78 
     79 }
     80