| OLD | NEW | 
|    1 // Copyright 2014 The Chromium Authors. All rights reserved. |    1 // Copyright 2014 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 #include <utility> |    5 #include <utility> | 
|    6  |    6  | 
|    7 #include "cc/resources/tiling_set_eviction_queue.h" |    7 #include "cc/resources/tiling_set_eviction_queue.h" | 
|    8  |    8  | 
|    9 namespace cc { |    9 namespace cc { | 
|   10  |   10  | 
| (...skipping 312 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  323  |  323  | 
|  324   switch (tree_priority_) { |  324   switch (tree_priority_) { | 
|  325     case SMOOTHNESS_TAKES_PRIORITY: |  325     case SMOOTHNESS_TAKES_PRIORITY: | 
|  326       DCHECK_EQ(ACTIVE_TREE, tree_); |  326       DCHECK_EQ(ACTIVE_TREE, tree_); | 
|  327       return false; |  327       return false; | 
|  328     case NEW_CONTENT_TAKES_PRIORITY: |  328     case NEW_CONTENT_TAKES_PRIORITY: | 
|  329       DCHECK_EQ(PENDING_TREE, tree_); |  329       DCHECK_EQ(PENDING_TREE, tree_); | 
|  330       return false; |  330       return false; | 
|  331     case SAME_PRIORITY_FOR_BOTH_TREES: |  331     case SAME_PRIORITY_FOR_BOTH_TREES: | 
|  332       break; |  332       break; | 
 |  333     case NUM_TREE_PRIORITIES: | 
 |  334       NOTREACHED(); | 
 |  335       break; | 
|  333   } |  336   } | 
|  334  |  337  | 
|  335   // The priority for tile priority of a shared tile will be a combined |  338   // The priority for tile priority of a shared tile will be a combined | 
|  336   // priority thus return shared tiles from a higher priority tree as |  339   // priority thus return shared tiles from a higher priority tree as | 
|  337   // it is out of order for a lower priority tree. |  340   // it is out of order for a lower priority tree. | 
|  338   WhichTree twin_tree = tree_ == ACTIVE_TREE ? PENDING_TREE : ACTIVE_TREE; |  341   WhichTree twin_tree = tree_ == ACTIVE_TREE ? PENDING_TREE : ACTIVE_TREE; | 
|  339   const TilePriority& priority = tile->priority(tree_); |  342   const TilePriority& priority = tile->priority(tree_); | 
|  340   const TilePriority& twin_priority = tile->priority(twin_tree); |  343   const TilePriority& twin_priority = tile->priority(twin_tree); | 
|  341   if (priority.priority_bin != twin_priority.priority_bin) |  344   if (priority.priority_bin != twin_priority.priority_bin) | 
|  342     return priority.priority_bin > twin_priority.priority_bin; |  345     return priority.priority_bin > twin_priority.priority_bin; | 
| (...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  381           tiling_set_->client()->GetPendingOrActiveTwinTiling(tiling); |  384           tiling_set_->client()->GetPendingOrActiveTwinTiling(tiling); | 
|  382       if (pending_tiling && pending_tiling->resolution() == HIGH_RESOLUTION) |  385       if (pending_tiling && pending_tiling->resolution() == HIGH_RESOLUTION) | 
|  383         return i; |  386         return i; | 
|  384     } |  387     } | 
|  385   } |  388   } | 
|  386  |  389  | 
|  387   return num_tilings; |  390   return num_tilings; | 
|  388 } |  391 } | 
|  389  |  392  | 
|  390 }  // namespace cc |  393 }  // namespace cc | 
| OLD | NEW |