Chromium Code Reviews| OLD | NEW | 
|---|---|
| 1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 The Chromium Authors. All rights reserved. | 
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be | 
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. | 
| 4 | 4 | 
| 5 #ifndef CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 5 #ifndef CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 
| 6 #define CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 6 #define CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 
| 7 | 7 | 
| 8 #include <utility> | 8 #include <utility> | 
| 9 #include <vector> | 9 #include <vector> | 
| 10 | 10 | 
| 11 #include "base/basictypes.h" | 11 #include "base/basictypes.h" | 
| 12 #include "base/containers/hash_tables.h" | 12 #include "base/containers/hash_tables.h" | 
| 13 #include "base/memory/scoped_ptr.h" | 13 #include "base/memory/scoped_ptr.h" | 
| 14 #include "cc/base/cc_export.h" | 14 #include "cc/base/cc_export.h" | 
| 15 #include "cc/base/region.h" | 15 #include "cc/base/region.h" | 
| 16 #include "cc/base/tiling_data.h" | 16 #include "cc/base/tiling_data.h" | 
| 17 #include "cc/resources/tile.h" | 17 #include "cc/resources/tile.h" | 
| 18 #include "cc/resources/tile_bundle.h" | |
| 18 #include "cc/resources/tile_priority.h" | 19 #include "cc/resources/tile_priority.h" | 
| 19 #include "ui/gfx/rect.h" | 20 #include "ui/gfx/rect.h" | 
| 20 | 21 | 
| 21 namespace cc { | 22 namespace cc { | 
| 22 | 23 | 
| 23 class PictureLayerTiling; | 24 class PictureLayerTiling; | 
| 24 | 25 | 
| 25 class CC_EXPORT PictureLayerTilingClient { | 26 class CC_EXPORT PictureLayerTilingClient { | 
| 26 public: | 27 public: | 
| 27 // Create a tile at the given content_rect (in the contents scale of the | 28 // Create a tile at the given content_rect (in the contents scale of the | 
| 28 // tiling) This might return null if the client cannot create such a tile. | 29 // tiling) This might return null if the client cannot create such a tile. | 
| 29 virtual scoped_refptr<Tile> CreateTile( | 30 virtual scoped_refptr<Tile> CreateTile( | 
| 30 PictureLayerTiling* tiling, | 31 PictureLayerTiling* tiling, | 
| 31 gfx::Rect content_rect) = 0; | 32 gfx::Rect content_rect) = 0; | 
| 33 virtual scoped_refptr<TileBundle> CreateTileBundle(int offset_x, | |
| 34 int offset_y, | |
| 35 int width, | |
| 36 int height) = 0; | |
| 32 virtual void UpdatePile(Tile* tile) = 0; | 37 virtual void UpdatePile(Tile* tile) = 0; | 
| 33 virtual gfx::Size CalculateTileSize( | 38 virtual gfx::Size CalculateTileSize( | 
| 34 gfx::Size content_bounds) const = 0; | 39 gfx::Size content_bounds) const = 0; | 
| 35 virtual const Region* GetInvalidation() = 0; | 40 virtual const Region* GetInvalidation() = 0; | 
| 36 virtual const PictureLayerTiling* GetTwinTiling( | 41 virtual const PictureLayerTiling* GetTwinTiling( | 
| 37 const PictureLayerTiling* tiling) const = 0; | 42 const PictureLayerTiling* tiling) const = 0; | 
| 43 virtual bool IsActive() const = 0; | |
| 44 virtual bool IsPending() const = 0; | |
| 38 | 45 | 
| 39 protected: | 46 protected: | 
| 40 virtual ~PictureLayerTilingClient() {} | 47 virtual ~PictureLayerTilingClient() {} | 
| 41 }; | 48 }; | 
| 42 | 49 | 
| 43 class CC_EXPORT PictureLayerTiling { | 50 class CC_EXPORT PictureLayerTiling { | 
| 44 public: | 51 public: | 
| 45 ~PictureLayerTiling(); | 52 ~PictureLayerTiling(); | 
| 46 | 53 | 
| 47 // Create a tiling with no tiles. CreateTiles must be called to add some. | 54 // Create a tiling with no tiles. CreateTiles must be called to add some. | 
| (...skipping 11 matching lines...) Expand all Loading... | |
| 59 void SetClient(PictureLayerTilingClient* client); | 66 void SetClient(PictureLayerTilingClient* client); | 
| 60 void set_resolution(TileResolution resolution) { resolution_ = resolution; } | 67 void set_resolution(TileResolution resolution) { resolution_ = resolution; } | 
| 61 TileResolution resolution() const { return resolution_; } | 68 TileResolution resolution() const { return resolution_; } | 
| 62 | 69 | 
| 63 gfx::Rect ContentRect() const; | 70 gfx::Rect ContentRect() const; | 
| 64 gfx::SizeF ContentSizeF() const; | 71 gfx::SizeF ContentSizeF() const; | 
| 65 gfx::Rect live_tiles_rect() const { return live_tiles_rect_; } | 72 gfx::Rect live_tiles_rect() const { return live_tiles_rect_; } | 
| 66 gfx::Size tile_size() const { return tiling_data_.max_texture_size(); } | 73 gfx::Size tile_size() const { return tiling_data_.max_texture_size(); } | 
| 67 float contents_scale() const { return contents_scale_; } | 74 float contents_scale() const { return contents_scale_; } | 
| 68 | 75 | 
| 76 Tile* TileAt(WhichTree tree, int, int) const; | |
| 77 | |
| 69 void CreateAllTilesForTesting() { | 78 void CreateAllTilesForTesting() { | 
| 70 SetLiveTilesRect(gfx::Rect(tiling_data_.total_size())); | 79 SetLiveTilesRect(ACTIVE_TREE, gfx::Rect(tiling_data_.total_size())); | 
| 80 live_tiles_rect_ = gfx::Rect(); | |
| 81 SetLiveTilesRect(PENDING_TREE, gfx::Rect(tiling_data_.total_size())); | |
| 82 } | |
| 83 | |
| 84 void CreateAllPendingTilesForTesting() { | |
| 85 SetLiveTilesRect(PENDING_TREE, gfx::Rect(tiling_data_.total_size())); | |
| 86 } | |
| 87 void CreateAllActiveTilesForTesting() { | |
| 88 SetLiveTilesRect(ACTIVE_TREE, gfx::Rect(tiling_data_.total_size())); | |
| 71 } | 89 } | 
| 72 | 90 | 
| 73 std::vector<Tile*> AllTilesForTesting() const { | 91 std::vector<Tile*> AllTilesForTesting() const { | 
| 74 std::vector<Tile*> all_tiles; | 92 std::vector<Tile*> all_tiles; | 
| 75 for (TileMap::const_iterator it = tiles_.begin(); | 93 for (TileBundleMap::const_iterator it = tile_bundles_.begin(); | 
| 76 it != tiles_.end(); ++it) | 94 it != tile_bundles_.end(); ++it) { | 
| 77 all_tiles.push_back(it->second.get()); | 95 for (TileBundle::Iterator tile_it(it->second.get()); tile_it; ++tile_it) | 
| 96 all_tiles.push_back(*tile_it); | |
| 97 } | |
| 78 return all_tiles; | 98 return all_tiles; | 
| 79 } | 99 } | 
| 80 | 100 | 
| 81 Tile* TileAt(int i, int j) const; | 101 std::vector<TileBundle*> AllTileBundlesForTesting() const { | 
| 102 std::vector<TileBundle*> all_bundles; | |
| 103 for (TileBundleMap::const_iterator it = tile_bundles_.begin(); | |
| 104 it != tile_bundles_.end(); ++it) { | |
| 105 all_bundles.push_back(it->second.get()); | |
| 106 } | |
| 107 return all_bundles; | |
| 108 } | |
| 109 | |
| 110 std::vector<Tile*> AllPendingTilesForTesting() const { | |
| 111 std::vector<Tile*> all_tiles; | |
| 112 for (TileBundleMap::const_iterator it = tile_bundles_.begin(); | |
| 113 it != tile_bundles_.end(); ++it) { | |
| 114 for (TileBundle::Iterator tile_it(it->second.get(), PENDING_TREE); | |
| 115 tile_it; | |
| 116 ++tile_it) { | |
| 117 all_tiles.push_back(*tile_it); | |
| 118 } | |
| 119 } | |
| 120 return all_tiles; | |
| 121 } | |
| 122 | |
| 123 std::vector<Tile*> AllActiveTilesForTesting() const { | |
| 124 std::vector<Tile*> all_tiles; | |
| 125 for (TileBundleMap::const_iterator it = tile_bundles_.begin(); | |
| 126 it != tile_bundles_.end(); ++it) { | |
| 127 for (TileBundle::Iterator tile_it(it->second.get(), ACTIVE_TREE); | |
| 128 tile_it; | |
| 129 ++tile_it) { | |
| 130 all_tiles.push_back(*tile_it); | |
| 131 } | |
| 132 } | |
| 133 return all_tiles; | |
| 134 } | |
| 82 | 135 | 
| 83 // Iterate over all tiles to fill content_rect. Even if tiles are invalid | 136 // Iterate over all tiles to fill content_rect. Even if tiles are invalid | 
| 84 // (i.e. no valid resource) this tiling should still iterate over them. | 137 // (i.e. no valid resource) this tiling should still iterate over them. | 
| 85 // The union of all geometry_rect calls for each element iterated over should | 138 // The union of all geometry_rect calls for each element iterated over should | 
| 86 // exactly equal content_rect and no two geometry_rects should intersect. | 139 // exactly equal content_rect and no two geometry_rects should intersect. | 
| 87 class CC_EXPORT CoverageIterator { | 140 class CC_EXPORT CoverageIterator { | 
| 88 public: | 141 public: | 
| 89 CoverageIterator(); | 142 CoverageIterator(); | 
| 90 CoverageIterator(const PictureLayerTiling* tiling, | 143 CoverageIterator(const PictureLayerTiling* tiling, | 
| 91 float dest_scale, | 144 float dest_scale, | 
| 92 gfx::Rect rect); | 145 gfx::Rect rect); | 
| 93 ~CoverageIterator(); | 146 ~CoverageIterator(); | 
| 94 | 147 | 
| 95 // Visible rect (no borders), always in the space of content_rect, | 148 // Visible rect (no borders), always in the space of content_rect, | 
| 96 // regardless of the contents scale of the tiling. | 149 // regardless of the contents scale of the tiling. | 
| 97 gfx::Rect geometry_rect() const; | 150 gfx::Rect geometry_rect() const; | 
| 98 // Texture rect (in texels) for geometry_rect | 151 // Texture rect (in texels) for geometry_rect | 
| 99 gfx::RectF texture_rect() const; | 152 gfx::RectF texture_rect() const; | 
| 100 gfx::Size texture_size() const; | 153 gfx::Size texture_size() const; | 
| 101 | 154 | 
| 102 // Full rect (including borders) of the current tile, always in the space | 155 // Full rect (including borders) of the current tile, always in the space | 
| 103 // of content_rect, regardless of the contents scale of the tiling. | 156 // of content_rect, regardless of the contents scale of the tiling. | 
| 104 gfx::Rect full_tile_geometry_rect() const; | 157 gfx::Rect full_tile_geometry_rect() const; | 
| 105 | 158 | 
| 106 Tile* operator->() const { return current_tile_; } | 159 Tile* operator->() const { return current_tile_; } | 
| 107 Tile* operator*() const { return current_tile_; } | 160 Tile* operator*() const { return current_tile_; } | 
| 108 | 161 | 
| 162 TilePriority priority(); | |
| 163 void SetPriorityForTesting(const TilePriority& priority); | |
| 164 | |
| 109 CoverageIterator& operator++(); | 165 CoverageIterator& operator++(); | 
| 110 operator bool() const { return tile_j_ <= bottom_; } | 166 operator bool() const { return tile_j_ <= bottom_; } | 
| 111 | 167 | 
| 112 int i() const { return tile_i_; } | 168 int i() const { return tile_i_; } | 
| 113 int j() const { return tile_j_; } | 169 int j() const { return tile_j_; } | 
| 114 | 170 | 
| 115 private: | 171 private: | 
| 116 const PictureLayerTiling* tiling_; | 172 const PictureLayerTiling* tiling_; | 
| 117 gfx::Rect dest_rect_; | 173 gfx::Rect dest_rect_; | 
| 118 float dest_to_content_scale_; | 174 float dest_to_content_scale_; | 
| 119 | 175 | 
| 120 Tile* current_tile_; | 176 Tile* current_tile_; | 
| 121 gfx::Rect current_geometry_rect_; | 177 gfx::Rect current_geometry_rect_; | 
| 122 int tile_i_; | 178 int tile_i_; | 
| 123 int tile_j_; | 179 int tile_j_; | 
| 124 int left_; | 180 int left_; | 
| 125 int top_; | 181 int top_; | 
| 126 int right_; | 182 int right_; | 
| 127 int bottom_; | 183 int bottom_; | 
| 184 WhichTree tree_; | |
| 128 | 185 | 
| 129 friend class PictureLayerTiling; | 186 friend class PictureLayerTiling; | 
| 130 }; | 187 }; | 
| 131 | 188 | 
| 132 Region OpaqueRegionInContentRect(gfx::Rect content_rect) const; | 189 Region OpaqueRegionInContentRect(gfx::Rect content_rect) const; | 
| 133 | 190 | 
| 134 void Reset(); | 191 void Reset(); | 
| 135 | 192 | 
| 136 void UpdateTilePriorities( | 193 void UpdateTilePriorities( | 
| 137 WhichTree tree, | 194 WhichTree tree, | 
| (...skipping 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 182 gfx::Rect starting_rect, | 239 gfx::Rect starting_rect, | 
| 183 int64 target_area, | 240 int64 target_area, | 
| 184 gfx::Rect bounding_rect, | 241 gfx::Rect bounding_rect, | 
| 185 RectExpansionCache* cache); | 242 RectExpansionCache* cache); | 
| 186 | 243 | 
| 187 bool has_ever_been_updated() const { | 244 bool has_ever_been_updated() const { | 
| 188 return last_impl_frame_time_in_seconds_ != 0.0; | 245 return last_impl_frame_time_in_seconds_ != 0.0; | 
| 189 } | 246 } | 
| 190 | 247 | 
| 191 protected: | 248 protected: | 
| 192 typedef std::pair<int, int> TileMapKey; | 249 friend class TileBundle; | 
| 193 typedef base::hash_map<TileMapKey, scoped_refptr<Tile> > TileMap; | 250 | 
| 251 typedef std::pair<int, int> TileBundleMapKey; | |
| 252 typedef base::hash_map<TileBundleMapKey, scoped_refptr<TileBundle> > | |
| 253 TileBundleMap; | |
| 194 | 254 | 
| 195 PictureLayerTiling(float contents_scale, | 255 PictureLayerTiling(float contents_scale, | 
| 196 gfx::Size layer_bounds, | 256 gfx::Size layer_bounds, | 
| 197 PictureLayerTilingClient* client); | 257 PictureLayerTilingClient* client); | 
| 198 void SetLiveTilesRect(gfx::Rect live_tiles_rect); | 258 void SetLiveTilesRect(WhichTree tree, gfx::Rect live_tiles_rect); | 
| 199 void CreateTile(int i, int j, const PictureLayerTiling* twin_tiling); | 259 void CreateTile(WhichTree tree, | 
| 260 int i, | |
| 261 int j, | |
| 262 const PictureLayerTiling* twin_tiling); | |
| 263 bool RemoveTile(WhichTree tree, int i, int j); | |
| 264 void RemoveBundleIfEmptyContainingTileAt(int i, int j); | |
| 265 TileBundle* TileBundleContainingTileAt(int, int) const; | |
| 266 TileBundle* CreateBundleForTileAt(int, | |
| 267 int, | |
| 268 const PictureLayerTiling* twin_tiling); | |
| 269 TileBundle* TileBundleAt(int, int) const; | |
| 200 | 270 | 
| 201 // Given properties. | 271 // Given properties. | 
| 202 float contents_scale_; | 272 float contents_scale_; | 
| 203 gfx::Size layer_bounds_; | 273 gfx::Size layer_bounds_; | 
| 204 TileResolution resolution_; | 274 TileResolution resolution_; | 
| 205 PictureLayerTilingClient* client_; | 275 PictureLayerTilingClient* client_; | 
| 206 | 276 | 
| 207 // Internal data. | 277 // Internal data. | 
| 208 TilingData tiling_data_; | 278 TilingData tiling_data_; | 
| 209 TileMap tiles_; // It is not legal to have a NULL tile in the tiles_ map. | 279 TilingData bundle_tiling_data_; | 
| 280 TileBundleMap tile_bundles_; // It is not legal to have a NULL tile in the | |
| 
 
enne (OOO)
2013/11/27 22:21:15
Comment is wrong.  Also, can you put this on its o
 
vmpstr
2013/11/27 23:31:57
Done.
 
 | |
| 281 // tiles_ map. | |
| 210 gfx::Rect live_tiles_rect_; | 282 gfx::Rect live_tiles_rect_; | 
| 211 | 283 | 
| 212 // State saved for computing velocities based upon finite differences. | 284 // State saved for computing velocities based upon finite differences. | 
| 213 double last_impl_frame_time_in_seconds_; | 285 double last_impl_frame_time_in_seconds_; | 
| 214 | 286 | 
| 215 friend class CoverageIterator; | 287 friend class CoverageIterator; | 
| 216 | 288 | 
| 217 private: | 289 private: | 
| 218 DISALLOW_ASSIGN(PictureLayerTiling); | 290 DISALLOW_ASSIGN(PictureLayerTiling); | 
| 219 | 291 | 
| 220 RectExpansionCache expansion_cache_; | 292 RectExpansionCache expansion_cache_; | 
| 221 }; | 293 }; | 
| 222 | 294 | 
| 223 } // namespace cc | 295 } // namespace cc | 
| 224 | 296 | 
| 225 #endif // CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 297 #endif // CC_RESOURCES_PICTURE_LAYER_TILING_H_ | 
| OLD | NEW |