cc/layer_tiling_data.cc

   1 // Copyright 2011 The Chromium Authors. All rights reserved.
   2 // Use of this source code is governed by a BSD-style license that can be
   3 // found in the LICENSE file.
   4
   5 #include "cc/layer_tiling_data.h"
   6
   7 #include "base/logging.h"
   8
   9 namespace cc {
  10
  11 scoped_ptr<LayerTilingData> LayerTilingData::create(const gfx::Size& tileSize, BorderTexelOption border)
  12 {
  13     return make_scoped_ptr(new LayerTilingData(tileSize, border));
  14 }
  15
  16 LayerTilingData::LayerTilingData(const gfx::Size& tileSize, BorderTexelOption border)
  17     : m_tilingData(tileSize, gfx::Size(), border == HasBorderTexels)
  18 {
  19     setTileSize(tileSize);
  20 }
  21
  22 LayerTilingData::~LayerTilingData()
  23 {
  24 }
  25
  26 void LayerTilingData::setTileSize(const gfx::Size& size)
  27 {
  28     if (tileSize() == size)
  29         return;
  30
  31     reset();
  32
  33     m_tilingData.SetMaxTextureSize(size);
  34 }
  35
  36 gfx::Size LayerTilingData::tileSize() const
  37 {
  38     return m_tilingData.max_texture_size();
  39 }
  40
  41 void LayerTilingData::setBorderTexelOption(BorderTexelOption borderTexelOption)
  42 {
  43     bool borderTexels = borderTexelOption == HasBorderTexels;
  44     if (hasBorderTexels() == borderTexels)
  45         return;
  46
  47     reset();
  48     m_tilingData.SetHasBorderTexels(borderTexels);
  49 }
  50
  51 const LayerTilingData& LayerTilingData::operator=(const LayerTilingData& tiler)
  52 {
  53     m_tilingData = tiler.m_tilingData;
  54
  55     return *this;
  56 }
  57
  58 void LayerTilingData::addTile(scoped_ptr<Tile> tile, int i, int j)
  59 {
  60     DCHECK(!tileAt(i, j));
  61     tile->moveTo(i, j);
  62     m_tiles.add(std::make_pair(i, j), tile.Pass());
  63 }
  64
  65 scoped_ptr<LayerTilingData::Tile> LayerTilingData::takeTile(int i, int j)
  66 {
  67     return m_tiles.take_and_erase(std::make_pair(i, j));
  68 }
  69
  70 LayerTilingData::Tile* LayerTilingData::tileAt(int i, int j) const
  71 {
  72     return m_tiles.get(std::make_pair(i, j));
  73 }
  74
  75 void LayerTilingData::reset()
  76 {
  77     m_tiles.clear();
  78 }
  79
  80 void LayerTilingData::contentRectToTileIndices(const gfx::Rect& contentRect, int& left, int& top, int& right, int& bottom) const
  81 {
  82     // An empty rect doesn't result in an empty set of tiles, so don't pass an empty rect.
  83     // FIXME: Possibly we should fill a vector of tiles instead,
  84     //        since the normal use of this function is to enumerate some tiles.
  85     DCHECK(!contentRect.IsEmpty());
  86
  87     left = m_tilingData.TileXIndexFromSrcCoord(contentRect.x());
  88     top = m_tilingData.TileYIndexFromSrcCoord(contentRect.y());
  89     right = m_tilingData.TileXIndexFromSrcCoord(contentRect.right() - 1);
  90     bottom = m_tilingData.TileYIndexFromSrcCoord(contentRect.bottom() - 1);
  91 }
  92
  93 gfx::Rect LayerTilingData::tileRect(const Tile* tile) const
  94 {
  95     gfx::Rect tileRect = m_tilingData.TileBoundsWithBorder(tile->i(), tile->j());
  96     tileRect.set_size(tileSize());
  97     return tileRect;
  98 }
  99
 100 Region LayerTilingData::opaqueRegionInContentRect(const gfx::Rect& contentRect) const
 101 {
 102     if (contentRect.IsEmpty())
 103         return Region();
 104
 105     Region opaqueRegion;
 106     int left, top, right, bottom;
 107     contentRectToTileIndices(contentRect, left, top, right, bottom);
 108     for (int j = top; j <= bottom; ++j) {
 109         for (int i = left; i <= right; ++i) {
 110             Tile* tile = tileAt(i, j);
 111             if (!tile)
 112                 continue;
 113
 114             gfx::Rect tileOpaqueRect = gfx::IntersectRects(contentRect, tile->opaqueRect());
 115             opaqueRegion.Union(tileOpaqueRect);
 116         }
 117     }
 118     return opaqueRegion;
 119 }
 120
 121 void LayerTilingData::setBounds(const gfx::Size& size)
 122 {
 123     m_tilingData.SetTotalSize(size);
 124     if (size.IsEmpty()) {
 125         m_tiles.clear();
 126         return;
 127     }
 128
 129     // Any tiles completely outside our new bounds are invalid and should be dropped.
 130     int left, top, right, bottom;
 131     contentRectToTileIndices(gfx::Rect(gfx::Point(), size), left, top, right, bottom);
 132     std::vector<TileMapKey> invalidTileKeys;
 133     for (TileMap::const_iterator it = m_tiles.begin(); it != m_tiles.end(); ++it) {
 134         if (it->first.first > right || it->first.second > bottom)
 135             invalidTileKeys.push_back(it->first);
 136     }
 137     for (size_t i = 0; i < invalidTileKeys.size(); ++i)
 138         m_tiles.erase(invalidTileKeys[i]);
 139 }
 140
 141 gfx::Size LayerTilingData::bounds() const
 142 {
 143     return m_tilingData.total_size();
 144 }
 145
 146 }  // namespace cc