cc/tiles/picture_layer_tiling_set.cc

   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
   3 // found in the LICENSE file.
   4
   5 #include "cc/tiles/picture_layer_tiling_set.h"
   6
   7 #include <limits>
   8 #include <set>
   9 #include <vector>
  10
  11 #include "cc/playback/raster_source.h"
  12
  13 namespace cc {
  14
  15 namespace {
  16
  17 class LargestToSmallestScaleFunctor {
  18  public:
  19   bool operator() (PictureLayerTiling* left, PictureLayerTiling* right) {
  20     return left->contents_scale() > right->contents_scale();
  21   }
  22 };
  23
  24 inline float LargerRatio(float float1, float float2) {
  25   DCHECK_GT(float1, 0.f);
  26   DCHECK_GT(float2, 0.f);
  27   return float1 > float2 ? float1 / float2 : float2 / float1;
  28 }
  29
  30 }  // namespace
  31
  32 // static
  33 scoped_ptr<PictureLayerTilingSet> PictureLayerTilingSet::Create(
  34     WhichTree tree,
  35     PictureLayerTilingClient* client,
  36     size_t max_tiles_for_interest_area,
  37     float skewport_target_time_in_seconds,
  38     int skewport_extrapolation_limit_in_content_pixels) {
  39   return make_scoped_ptr(new PictureLayerTilingSet(
  40       tree, client, max_tiles_for_interest_area,
  41       skewport_target_time_in_seconds,
  42       skewport_extrapolation_limit_in_content_pixels));
  43 }
  44
  45 PictureLayerTilingSet::PictureLayerTilingSet(
  46     WhichTree tree,
  47     PictureLayerTilingClient* client,
  48     size_t max_tiles_for_interest_area,
  49     float skewport_target_time_in_seconds,
  50     int skewport_extrapolation_limit_in_content_pixels)
  51     : max_tiles_for_interest_area_(max_tiles_for_interest_area),
  52       skewport_target_time_in_seconds_(skewport_target_time_in_seconds),
  53       skewport_extrapolation_limit_in_content_pixels_(
  54           skewport_extrapolation_limit_in_content_pixels),
  55       tree_(tree),
  56       client_(client) {
  57 }
  58
  59 PictureLayerTilingSet::~PictureLayerTilingSet() {
  60 }
  61
  62 void PictureLayerTilingSet::CopyTilingsAndPropertiesFromPendingTwin(
  63     const PictureLayerTilingSet* pending_twin_set,
  64     const scoped_refptr<RasterSource>& raster_source,
  65     const Region& layer_invalidation) {
  66   if (pending_twin_set->tilings_.empty()) {
  67     // If the twin (pending) tiling set is empty, it was not updated for the
  68     // current frame. So we drop tilings from our set as well, instead of
  69     // leaving behind unshared tilings that are all non-ideal.
  70     RemoveAllTilings();
  71     return;
  72   }
  73
  74   bool tiling_sort_required = false;
  75   for (PictureLayerTiling* pending_twin_tiling : pending_twin_set->tilings_) {
  76     float contents_scale = pending_twin_tiling->contents_scale();
  77     PictureLayerTiling* this_tiling = FindTilingWithScale(contents_scale);
  78     if (!this_tiling) {
  79       scoped_ptr<PictureLayerTiling> new_tiling = PictureLayerTiling::Create(
  80           tree_, contents_scale, raster_source, client_,
  81           max_tiles_for_interest_area_, skewport_target_time_in_seconds_,
  82           skewport_extrapolation_limit_in_content_pixels_);
  83       tilings_.push_back(new_tiling.Pass());
  84       this_tiling = tilings_.back();
  85       tiling_sort_required = true;
  86     }
  87     this_tiling->TakeTilesAndPropertiesFrom(pending_twin_tiling,
  88                                             layer_invalidation);
  89   }
  90
  91   if (tiling_sort_required)
  92     tilings_.sort(LargestToSmallestScaleFunctor());
  93 }
  94
  95 void PictureLayerTilingSet::UpdateTilingsToCurrentRasterSourceForActivation(
  96     scoped_refptr<RasterSource> raster_source,
  97     const PictureLayerTilingSet* pending_twin_set,
  98     const Region& layer_invalidation,
  99     float minimum_contents_scale,
 100     float maximum_contents_scale) {
 101   RemoveTilingsBelowScale(minimum_contents_scale);
 102   RemoveTilingsAboveScale(maximum_contents_scale);
 103
 104   // Copy over tilings that are shared with the |pending_twin_set| tiling set.
 105   // Also, copy all of the properties from twin tilings.
 106   CopyTilingsAndPropertiesFromPendingTwin(pending_twin_set, raster_source,
 107                                           layer_invalidation);
 108
 109   // If the tiling is not shared (FindTilingWithScale returns nullptr), then
 110   // invalidate tiles and update them to the new raster source.
 111   for (PictureLayerTiling* tiling : tilings_) {
 112     if (pending_twin_set->FindTilingWithScale(tiling->contents_scale()))
 113       continue;
 114
 115     tiling->SetRasterSourceAndResize(raster_source);
 116     tiling->Invalidate(layer_invalidation);
 117     // This is needed for cases where the live tiles rect didn't change but
 118     // recordings exist in the raster source that did not exist on the last
 119     // raster source.
 120     tiling->CreateMissingTilesInLiveTilesRect();
 121
 122     // |this| is active set and |tiling| is not in the pending set, which means
 123     // it is now NON_IDEAL_RESOLUTION.
 124     tiling->set_resolution(NON_IDEAL_RESOLUTION);
 125   }
 126
 127   VerifyTilings(pending_twin_set);
 128 }
 129
 130 void PictureLayerTilingSet::UpdateTilingsToCurrentRasterSourceForCommit(
 131     scoped_refptr<RasterSource> raster_source,
 132     const Region& layer_invalidation,
 133     float minimum_contents_scale,
 134     float maximum_contents_scale) {
 135   RemoveTilingsBelowScale(minimum_contents_scale);
 136   RemoveTilingsAboveScale(maximum_contents_scale);
 137
 138   // Invalidate tiles and update them to the new raster source.
 139   for (PictureLayerTiling* tiling : tilings_) {
 140     DCHECK_IMPLIES(tree_ == PENDING_TREE, !tiling->has_tiles());
 141     tiling->SetRasterSourceAndResize(raster_source);
 142
 143     // We can commit on either active or pending trees, but only active one can
 144     // have tiles at this point.
 145     if (tree_ == ACTIVE_TREE)
 146       tiling->Invalidate(layer_invalidation);
 147
 148     // This is needed for cases where the live tiles rect didn't change but
 149     // recordings exist in the raster source that did not exist on the last
 150     // raster source.
 151     tiling->CreateMissingTilesInLiveTilesRect();
 152   }
 153   VerifyTilings(nullptr /* pending_twin_set */);
 154 }
 155
 156 void PictureLayerTilingSet::UpdateRasterSourceDueToLCDChange(
 157     const scoped_refptr<RasterSource>& raster_source,
 158     const Region& layer_invalidation) {
 159   for (PictureLayerTiling* tiling : tilings_) {
 160     tiling->SetRasterSourceAndResize(raster_source);
 161     tiling->Invalidate(layer_invalidation);
 162     // Since the invalidation changed, we need to create any missing tiles in
 163     // the live tiles rect again.
 164     tiling->CreateMissingTilesInLiveTilesRect();
 165   }
 166 }
 167
 168 void PictureLayerTilingSet::VerifyTilings(
 169     const PictureLayerTilingSet* pending_twin_set) const {
 170 #if DCHECK_IS_ON()
 171   for (PictureLayerTiling* tiling : tilings_) {
 172     DCHECK(tiling->tile_size() ==
 173            client_->CalculateTileSize(tiling->tiling_size()))
 174         << "tile_size: " << tiling->tile_size().ToString()
 175         << " tiling_size: " << tiling->tiling_size().ToString()
 176         << " CalculateTileSize: "
 177         << client_->CalculateTileSize(tiling->tiling_size()).ToString();
 178   }
 179
 180   if (!tilings_.empty()) {
 181     DCHECK_LE(NumHighResTilings(), 1);
 182     // When commiting from the main thread the high res tiling may get dropped,
 183     // but when cloning to the active tree, there should always be one.
 184     if (pending_twin_set) {
 185       DCHECK_EQ(1, NumHighResTilings())
 186           << " num tilings on active: " << tilings_.size()
 187           << " num tilings on pending: " << pending_twin_set->tilings_.size()
 188           << " num high res on pending: "
 189           << pending_twin_set->NumHighResTilings()
 190           << " are on active tree: " << (tree_ == ACTIVE_TREE);
 191     }
 192   }
 193 #endif
 194 }
 195
 196 void PictureLayerTilingSet::CleanUpTilings(
 197     float min_acceptable_high_res_scale,
 198     float max_acceptable_high_res_scale,
 199     const std::vector<PictureLayerTiling*>& needed_tilings,
 200     bool should_have_low_res,
 201     PictureLayerTilingSet* twin_set) {
 202   float twin_low_res_scale = 0.f;
 203   if (twin_set) {
 204     PictureLayerTiling* tiling =
 205         twin_set->FindTilingWithResolution(LOW_RESOLUTION);
 206     if (tiling)
 207       twin_low_res_scale = tiling->contents_scale();
 208   }
 209
 210   std::vector<PictureLayerTiling*> to_remove;
 211   for (auto* tiling : tilings_) {
 212     // Keep all tilings within the min/max scales.
 213     if (tiling->contents_scale() >= min_acceptable_high_res_scale &&
 214         tiling->contents_scale() <= max_acceptable_high_res_scale) {
 215       continue;
 216     }
 217
 218     // Keep low resolution tilings, if the tiling set should have them.
 219     if (should_have_low_res &&
 220         (tiling->resolution() == LOW_RESOLUTION ||
 221          tiling->contents_scale() == twin_low_res_scale)) {
 222       continue;
 223     }
 224
 225     // Don't remove tilings that are required.
 226     if (std::find(needed_tilings.begin(), needed_tilings.end(), tiling) !=
 227         needed_tilings.end()) {
 228       continue;
 229     }
 230
 231     to_remove.push_back(tiling);
 232   }
 233
 234   for (auto* tiling : to_remove) {
 235     DCHECK_NE(HIGH_RESOLUTION, tiling->resolution());
 236     Remove(tiling);
 237   }
 238 }
 239
 240 void PictureLayerTilingSet::RemoveNonIdealTilings() {
 241   auto to_remove = tilings_.remove_if([](PictureLayerTiling* t) {
 242     return t->resolution() == NON_IDEAL_RESOLUTION;
 243   });
 244   tilings_.erase(to_remove, tilings_.end());
 245 }
 246
 247 void PictureLayerTilingSet::MarkAllTilingsNonIdeal() {
 248   for (auto* tiling : tilings_)
 249     tiling->set_resolution(NON_IDEAL_RESOLUTION);
 250 }
 251
 252 PictureLayerTiling* PictureLayerTilingSet::AddTiling(
 253     float contents_scale,
 254     scoped_refptr<RasterSource> raster_source) {
 255   for (size_t i = 0; i < tilings_.size(); ++i) {
 256     DCHECK_NE(tilings_[i]->contents_scale(), contents_scale);
 257     DCHECK_EQ(tilings_[i]->raster_source(), raster_source.get());
 258   }
 259
 260   tilings_.push_back(PictureLayerTiling::Create(
 261       tree_, contents_scale, raster_source, client_,
 262       max_tiles_for_interest_area_, skewport_target_time_in_seconds_,
 263       skewport_extrapolation_limit_in_content_pixels_));
 264   PictureLayerTiling* appended = tilings_.back();
 265
 266   tilings_.sort(LargestToSmallestScaleFunctor());
 267   return appended;
 268 }
 269
 270 int PictureLayerTilingSet::NumHighResTilings() const {
 271   return std::count_if(tilings_.begin(), tilings_.end(),
 272                        [](PictureLayerTiling* tiling) {
 273     return tiling->resolution() == HIGH_RESOLUTION;
 274   });
 275 }
 276
 277 PictureLayerTiling* PictureLayerTilingSet::FindTilingWithScale(
 278     float scale) const {
 279   for (size_t i = 0; i < tilings_.size(); ++i) {
 280     if (tilings_[i]->contents_scale() == scale)
 281       return tilings_[i];
 282   }
 283   return NULL;
 284 }
 285
 286 PictureLayerTiling* PictureLayerTilingSet::FindTilingWithResolution(
 287     TileResolution resolution) const {
 288   auto iter = std::find_if(tilings_.begin(), tilings_.end(),
 289                            [resolution](const PictureLayerTiling* tiling) {
 290     return tiling->resolution() == resolution;
 291   });
 292   if (iter == tilings_.end())
 293     return NULL;
 294   return *iter;
 295 }
 296
 297 void PictureLayerTilingSet::RemoveTilingsBelowScale(float minimum_scale) {
 298   auto to_remove =
 299       tilings_.remove_if([minimum_scale](PictureLayerTiling* tiling) {
 300         return tiling->contents_scale() < minimum_scale;
 301       });
 302   tilings_.erase(to_remove, tilings_.end());
 303 }
 304
 305 void PictureLayerTilingSet::RemoveTilingsAboveScale(float maximum_scale) {
 306   auto to_remove =
 307       tilings_.remove_if([maximum_scale](PictureLayerTiling* tiling) {
 308         return tiling->contents_scale() > maximum_scale;
 309       });
 310   tilings_.erase(to_remove, tilings_.end());
 311 }
 312
 313 void PictureLayerTilingSet::RemoveAllTilings() {
 314   tilings_.clear();
 315 }
 316
 317 void PictureLayerTilingSet::Remove(PictureLayerTiling* tiling) {
 318   ScopedPtrVector<PictureLayerTiling>::iterator iter =
 319     std::find(tilings_.begin(), tilings_.end(), tiling);
 320   if (iter == tilings_.end())
 321     return;
 322   tilings_.erase(iter);
 323 }
 324
 325 void PictureLayerTilingSet::RemoveAllTiles() {
 326   for (size_t i = 0; i < tilings_.size(); ++i)
 327     tilings_[i]->Reset();
 328 }
 329
 330 float PictureLayerTilingSet::GetSnappedContentsScale(
 331     float start_scale,
 332     float snap_to_existing_tiling_ratio) const {
 333   // If a tiling exists within the max snapping ratio, snap to its scale.
 334   float snapped_contents_scale = start_scale;
 335   float snapped_ratio = snap_to_existing_tiling_ratio;
 336   for (const auto* tiling : tilings_) {
 337     float tiling_contents_scale = tiling->contents_scale();
 338     float ratio = LargerRatio(tiling_contents_scale, start_scale);
 339     if (ratio < snapped_ratio) {
 340       snapped_contents_scale = tiling_contents_scale;
 341       snapped_ratio = ratio;
 342     }
 343   }
 344   return snapped_contents_scale;
 345 }
 346
 347 float PictureLayerTilingSet::GetMaximumContentsScale() const {
 348   if (tilings_.empty())
 349     return 0.f;
 350   // The first tiling has the largest contents scale.
 351   return tilings_[0]->contents_scale();
 352 }
 353
 354 bool PictureLayerTilingSet::UpdateTilePriorities(
 355     const gfx::Rect& required_rect_in_layer_space,
 356     float ideal_contents_scale,
 357     double current_frame_time_in_seconds,
 358     const Occlusion& occlusion_in_layer_space,
 359     bool can_require_tiles_for_activation) {
 360   bool updated = false;
 361   for (auto* tiling : tilings_) {
 362     tiling->set_can_require_tiles_for_activation(
 363         can_require_tiles_for_activation);
 364     updated |= tiling->ComputeTilePriorityRects(
 365         required_rect_in_layer_space, ideal_contents_scale,
 366         current_frame_time_in_seconds, occlusion_in_layer_space);
 367   }
 368   return updated;
 369 }
 370
 371 void PictureLayerTilingSet::GetAllPrioritizedTilesForTracing(
 372     std::vector<PrioritizedTile>* prioritized_tiles) const {
 373   for (auto* tiling : tilings_)
 374     tiling->GetAllPrioritizedTilesForTracing(prioritized_tiles);
 375 }
 376
 377 PictureLayerTilingSet::CoverageIterator::CoverageIterator(
 378     const PictureLayerTilingSet* set,
 379     float contents_scale,
 380     const gfx::Rect& content_rect,
 381     float ideal_contents_scale)
 382     : set_(set),
 383       contents_scale_(contents_scale),
 384       ideal_contents_scale_(ideal_contents_scale),
 385       current_tiling_(std::numeric_limits<size_t>::max()) {
 386   missing_region_.Union(content_rect);
 387
 388   size_t tilings_size = set_->tilings_.size();
 389   for (ideal_tiling_ = 0; ideal_tiling_ < tilings_size; ++ideal_tiling_) {
 390     PictureLayerTiling* tiling = set_->tilings_[ideal_tiling_];
 391     if (tiling->contents_scale() < ideal_contents_scale_) {
 392       if (ideal_tiling_ > 0)
 393         ideal_tiling_--;
 394       break;
 395     }
 396   }
 397
 398   if (ideal_tiling_ == tilings_size && ideal_tiling_ > 0)
 399     ideal_tiling_--;
 400
 401   ++(*this);
 402 }
 403
 404 PictureLayerTilingSet::CoverageIterator::~CoverageIterator() {
 405 }
 406
 407 gfx::Rect PictureLayerTilingSet::CoverageIterator::geometry_rect() const {
 408   if (!tiling_iter_) {
 409     if (!region_iter_.has_rect())
 410       return gfx::Rect();
 411     return region_iter_.rect();
 412   }
 413   return tiling_iter_.geometry_rect();
 414 }
 415
 416 gfx::RectF PictureLayerTilingSet::CoverageIterator::texture_rect() const {
 417   if (!tiling_iter_)
 418     return gfx::RectF();
 419   return tiling_iter_.texture_rect();
 420 }
 421
 422 Tile* PictureLayerTilingSet::CoverageIterator::operator->() const {
 423   if (!tiling_iter_)
 424     return NULL;
 425   return *tiling_iter_;
 426 }
 427
 428 Tile* PictureLayerTilingSet::CoverageIterator::operator*() const {
 429   if (!tiling_iter_)
 430     return NULL;
 431   return *tiling_iter_;
 432 }
 433
 434 TileResolution PictureLayerTilingSet::CoverageIterator::resolution() const {
 435   const PictureLayerTiling* tiling = CurrentTiling();
 436   DCHECK(tiling);
 437   return tiling->resolution();
 438 }
 439
 440 PictureLayerTiling* PictureLayerTilingSet::CoverageIterator::CurrentTiling()
 441     const {
 442   if (current_tiling_ == std::numeric_limits<size_t>::max())
 443     return NULL;
 444   if (current_tiling_ >= set_->tilings_.size())
 445     return NULL;
 446   return set_->tilings_[current_tiling_];
 447 }
 448
 449 size_t PictureLayerTilingSet::CoverageIterator::NextTiling() const {
 450   // Order returned by this method is:
 451   // 1. Ideal tiling index
 452   // 2. Tiling index < Ideal in decreasing order (higher res than ideal)
 453   // 3. Tiling index > Ideal in increasing order (lower res than ideal)
 454   // 4. Tiling index > tilings.size() (invalid index)
 455   if (current_tiling_ == std::numeric_limits<size_t>::max())
 456     return ideal_tiling_;
 457   else if (current_tiling_ > ideal_tiling_)
 458     return current_tiling_ + 1;
 459   else if (current_tiling_)
 460     return current_tiling_ - 1;
 461   else
 462     return ideal_tiling_ + 1;
 463 }
 464
 465 PictureLayerTilingSet::CoverageIterator&
 466 PictureLayerTilingSet::CoverageIterator::operator++() {
 467   bool first_time = current_tiling_ == std::numeric_limits<size_t>::max();
 468
 469   if (!*this && !first_time)
 470     return *this;
 471
 472   if (tiling_iter_)
 473     ++tiling_iter_;
 474
 475   // Loop until we find a valid place to stop.
 476   while (true) {
 477     while (tiling_iter_ &&
 478            (!*tiling_iter_ || !tiling_iter_->draw_info().IsReadyToDraw())) {
 479       missing_region_.Union(tiling_iter_.geometry_rect());
 480       ++tiling_iter_;
 481     }
 482     if (tiling_iter_)
 483       return *this;
 484
 485     // If the set of current rects for this tiling is done, go to the next
 486     // tiling and set up to iterate through all of the remaining holes.
 487     // This will also happen the first time through the loop.
 488     if (!region_iter_.has_rect()) {
 489       current_tiling_ = NextTiling();
 490       current_region_.Swap(&missing_region_);
 491       missing_region_.Clear();
 492       region_iter_ = Region::Iterator(current_region_);
 493
 494       // All done and all filled.
 495       if (!region_iter_.has_rect()) {
 496         current_tiling_ = set_->tilings_.size();
 497         return *this;
 498       }
 499
 500       // No more valid tiles, return this checkerboard rect.
 501       if (current_tiling_ >= set_->tilings_.size())
 502         return *this;
 503     }
 504
 505     // Pop a rect off.  If there are no more tilings, then these will be
 506     // treated as geometry with null tiles that the caller can checkerboard.
 507     gfx::Rect last_rect = region_iter_.rect();
 508     region_iter_.next();
 509
 510     // Done, found next checkerboard rect to return.
 511     if (current_tiling_ >= set_->tilings_.size())
 512       return *this;
 513
 514     // Construct a new iterator for the next tiling, but we need to loop
 515     // again until we get to a valid one.
 516     tiling_iter_ = PictureLayerTiling::CoverageIterator(
 517         set_->tilings_[current_tiling_],
 518         contents_scale_,
 519         last_rect);
 520   }
 521
 522   return *this;
 523 }
 524
 525 PictureLayerTilingSet::CoverageIterator::operator bool() const {
 526   return current_tiling_ < set_->tilings_.size() || region_iter_.has_rect();
 527 }
 528
 529 void PictureLayerTilingSet::AsValueInto(
 530     base::trace_event::TracedValue* state) const {
 531   for (size_t i = 0; i < tilings_.size(); ++i) {
 532     state->BeginDictionary();
 533     tilings_[i]->AsValueInto(state);
 534     state->EndDictionary();
 535   }
 536 }
 537
 538 size_t PictureLayerTilingSet::GPUMemoryUsageInBytes() const {
 539   size_t amount = 0;
 540   for (size_t i = 0; i < tilings_.size(); ++i)
 541     amount += tilings_[i]->GPUMemoryUsageInBytes();
 542   return amount;
 543 }
 544
 545 PictureLayerTilingSet::TilingRange PictureLayerTilingSet::GetTilingRange(
 546     TilingRangeType type) const {
 547   // Doesn't seem to be the case right now but if it ever becomes a performance
 548   // problem to compute these ranges each time this function is called, we can
 549   // compute them only when the tiling set has changed instead.
 550   size_t tilings_size = tilings_.size();
 551   TilingRange high_res_range(0, 0);
 552   TilingRange low_res_range(tilings_.size(), tilings_.size());
 553   for (size_t i = 0; i < tilings_size; ++i) {
 554     const PictureLayerTiling* tiling = tilings_[i];
 555     if (tiling->resolution() == HIGH_RESOLUTION)
 556       high_res_range = TilingRange(i, i + 1);
 557     if (tiling->resolution() == LOW_RESOLUTION)
 558       low_res_range = TilingRange(i, i + 1);
 559   }
 560
 561   TilingRange range(0, 0);
 562   switch (type) {
 563     case HIGHER_THAN_HIGH_RES:
 564       range = TilingRange(0, high_res_range.start);
 565       break;
 566     case HIGH_RES:
 567       range = high_res_range;
 568       break;
 569     case BETWEEN_HIGH_AND_LOW_RES:
 570       // TODO(vmpstr): This code assumes that high res tiling will come before
 571       // low res tiling, however there are cases where this assumption is
 572       // violated. As a result, it's better to be safe in these situations,
 573       // since otherwise we can end up accessing a tiling that doesn't exist.
 574       // See crbug.com/429397 for high res tiling appearing after low res
 575       // tiling discussion/fixes.
 576       if (high_res_range.start <= low_res_range.start)
 577         range = TilingRange(high_res_range.end, low_res_range.start);
 578       else
 579         range = TilingRange(low_res_range.end, high_res_range.start);
 580       break;
 581     case LOW_RES:
 582       range = low_res_range;
 583       break;
 584     case LOWER_THAN_LOW_RES:
 585       range = TilingRange(low_res_range.end, tilings_size);
 586       break;
 587   }
 588
 589   DCHECK_LE(range.start, range.end);
 590   return range;
 591 }
 592
 593 }  // namespace cc