cc: Do not ignore layers without valid priorities during eviction.

cc/resources/picture_layer_tiling_perftest.cc

 // Copyright 2013 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/debug/lap_timer.h"
 #include "cc/resources/picture_layer_tiling.h"
 #include "cc/resources/resource_provider.h"
 #include "cc/resources/scoped_resource.h"
 #include "cc/test/fake_output_surface.h"
 #include "cc/test/fake_output_surface_client.h"
@@ skipping 179 matching lines @@
 
     timer_.Reset();
     TreePriority priorities[] = {SAME_PRIORITY_FOR_BOTH_TREES,
                                  SMOOTHNESS_TAKES_PRIORITY,
                                  NEW_CONTENT_TAKES_PRIORITY};
     int priority_count = 0;
     do {
       PictureLayerTiling::TilingEvictionTileIterator it(
           picture_layer_tiling_.get(),
           priorities[priority_count],
-          PictureLayerTiling::NOW);
+          PictureLayerTiling::NOW,
+          true,
+          true);
       priority_count = (priority_count + 1) % arraysize(priorities);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     perf_test::PrintResult("tiling_eviction_tile_iterator_construct",
                            "",
                            test_name,
                            timer_.LapsPerSecond(),
                            "runs/s",
                            true);
@@ skipping 24 matching lines @@
           ScopedResource::Create(resource_provider_.get()).Pass());
     }
 
     int priority_count = 0;
     timer_.Reset();
     do {
       int count = num_tiles;
       PictureLayerTiling::TilingEvictionTileIterator it(
           picture_layer_tiling_.get(),
           priorities[priority_count],
-          PictureLayerTiling::EVENTUALLY);
+          PictureLayerTiling::EVENTUALLY,
+          true,
+          true);
       while (count--) {
         ASSERT_TRUE(it) << "count: " << count;
         ASSERT_TRUE(*it != NULL) << "count: " << count;
         ++it;
       }
       priority_count = (priority_count + 1) % arraysize(priorities);
       timer_.NextLap();
     } while (!timer_.HasTimeLimitExpired());
 
     // Remove all resources from tiles to make sure the tile version destructor
@@ skipping 95 matching lines @@
       "32_500x500", 32, gfx::Rect(0, 0, 500, 500));
   RunEvictionIteratorConstructAndIterateTest(
       "64_100x100", 64, gfx::Rect(0, 0, 100, 100));
   RunEvictionIteratorConstructAndIterateTest(
       "64_500x500", 64, gfx::Rect(0, 0, 500, 500));
 }
 
 }  // namespace
 
 }  // namespace cc