cc: Refactored Tile::GetResourceId

cc/picture_layer_tiling.cc

 // Copyright 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "cc/picture_layer_tiling.h"
 
 #include <cmath>
 
 #include "base/debug/trace_event.h"
 #include "cc/math_util.h"
@@ skipping 369 matching lines @@
                                            prioritized_rect);
        iter;
        ++iter) {
     TileMap::iterator find = tiles_.find(iter.index());
     if (find == tiles_.end())
       continue;
 
     TilePriority priority;
     DCHECK(!priority.is_live);
     Tile* tile = find->second.get();
-    tile->set_priority(tree, priority);
+    tile->SetPriority(tree, priority);
   }
   last_prioritized_rect_ = prioritized_rect;
 
   gfx::Rect view_rect(device_viewport);
   float current_scale = current_layer_contents_scale / contents_scale_;
   float last_scale = last_layer_contents_scale / contents_scale_;
 
   // Fast path tile priority calculation when both transforms are translations.
   if (last_screen_transform.IsIdentityOrTranslation() &&
       current_screen_transform.IsIdentityOrTranslation())
@@ skipping 28 matching lines @@
 
       float time_to_visible_in_seconds =
           TilePriority::TimeForBoundsToIntersect(
               last_screen_rect, current_screen_rect, time_delta, view_rect);
       TilePriority priority(
           resolution_,
           time_to_visible_in_seconds,
           distance_to_visible_in_pixels);
       if (store_screen_space_quads_on_tiles)
         priority.set_current_screen_quad(gfx::QuadF(current_screen_rect));
-      tile->set_priority(tree, priority);
+      tile->SetPriority(tree, priority);
     }
   } else {
     for (TilingData::Iterator iter(&tiling_data_, prioritized_rect);
          iter; ++iter) {
       TileMap::iterator find = tiles_.find(iter.index());
       if (find == tiles_.end())
         continue;
       Tile* tile = find->second.get();
 
       gfx::Rect tile_bounds =
@@ skipping 22 matching lines @@
           resolution_,
           time_to_visible_in_seconds,
           distance_to_visible_in_pixels);
       if (store_screen_space_quads_on_tiles) {
           bool clipped;
           priority.set_current_screen_quad(
             MathUtil::mapQuad(current_screen_transform,
                               gfx::QuadF(current_layer_content_rect),
                               clipped));
       }
-      tile->set_priority(tree, priority);
+      tile->SetPriority(tree, priority);
     }
   }
 
   last_source_frame_number_ = current_source_frame_number;
   last_impl_frame_time_ = current_frame_time;
 }
 
 void PictureLayerTiling::DidBecomeActive() {
   for (TileMap::const_iterator it = tiles_.begin(); it != tiles_.end(); ++it) {
-    it->second->set_priority(ACTIVE_TREE, it->second->priority(PENDING_TREE));
-    it->second->set_priority(PENDING_TREE, TilePriority());
+    it->second->SetPriority(ACTIVE_TREE, it->second->priority(PENDING_TREE));
+    it->second->SetPriority(PENDING_TREE, TilePriority());
 
     // Tile holds a ref onto a picture pile. If the tile never gets invalidated
     // and recreated, then that picture pile ref could exist indefinitely.  To
     // prevent this, ask the client to update the pile to its own ref.  This
     // will cause PicturePileImpls and their clones to get deleted once the
     // corresponding PictureLayerImpl and any in flight raster jobs go out of
     // scope.
     client_->UpdatePile(it->second);
   }
 }
@@ skipping 210 matching lines @@
                          (bottom_complete ? 1 : 0);
     if (num_edges_complete == 4)
       return working_rect;
   }
 
   NOTREACHED();
   return starting_rect;
 }
 
 }  // namespace cc