Home
last modified time | relevance | path

Searched refs:TilePriority (Results 1 – 15 of 15) sorted by relevance

/external/chromium_org/cc/resources/
Dtile_manager_unittest.cc77 TilePriority active_priority, in CreateTilesWithSize()
78 TilePriority pending_priority, in CreateTilesWithSize()
98 TilePriority active_priority, in CreateTiles()
99 TilePriority pending_priority) { in CreateTiles()
152 CreateTiles(3, TilePriorityForNowBin(), TilePriority()); in TEST_P()
154 CreateTiles(3, TilePriority(), TilePriorityForNowBin()); in TEST_P()
157 TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); in TEST_P()
173 CreateTiles(3, TilePriorityForNowBin(), TilePriority()); in TEST_P()
175 CreateTiles(3, TilePriority(), TilePriorityForNowBin()); in TEST_P()
178 TileVector never_bin = CreateTiles(1, TilePriority(), TilePriority()); in TEST_P()
[all …]
Dtile_priority_unittest.cc16 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
18 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
20 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
24 EXPECT_EQ(inf, TilePriority::TimeForBoundsToIntersect( in TEST()
26 EXPECT_EQ(inf, TilePriority::TimeForBoundsToIntersect( in TEST()
28 EXPECT_EQ(2, TilePriority::TimeForBoundsToIntersect( in TEST()
36 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
38 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
40 EXPECT_EQ(0, TilePriority::TimeForBoundsToIntersect( in TEST()
44 EXPECT_EQ(inf, TilePriority::TimeForBoundsToIntersect( in TEST()
[all …]
Dtile_priority.h43 struct CC_EXPORT TilePriority { struct
44 TilePriority() in TilePriority() argument
50 TilePriority(TileResolution resolution, in TilePriority() argument
58 TilePriority(const TilePriority& active, const TilePriority& pending) { in TilePriority() function
89 bool operator ==(const TilePriority& other) const {
96 bool operator !=(const TilePriority& other) const {
Dprioritized_tile_set_unittest.cc117 TilePriority priorities[4] = { in TEST_F()
120 TilePriority(), in TEST_F()
149 TilePriority priorities[4] = { in TEST_F()
152 TilePriority(), in TEST_F()
183 TilePriority priorities[4] = { in TEST_F()
186 TilePriority(), in TEST_F()
218 TilePriority priorities[4] = { in TEST_F()
221 TilePriority(), in TEST_F()
249 TilePriority priorities[4] = { in TEST_F()
252 TilePriority(), in TEST_F()
[all …]
Dtile.h43 const TilePriority& priority(WhichTree tree) const { in priority()
47 TilePriority combined_priority() const { in combined_priority()
48 return TilePriority(priority_[ACTIVE_TREE], in combined_priority()
52 void SetPriority(WhichTree tree, const TilePriority& priority);
157 TilePriority priority_[NUM_TREES];
Dtile_manager_perftest.cc69 TilePriority GetTilePriorityFromBin(ManagedTileBin bin) { in GetTilePriorityFromBin()
82 return TilePriority(); in GetTilePriorityFromBin()
85 return TilePriority(); in GetTilePriorityFromBin()
Dpicture_layer_tiling_unittest.cc780 TilePriority priority = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
845 TilePriority priority = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
867 TilePriority left = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
868 TilePriority right = tiling->TileAt(1, 0)->priority(ACTIVE_TREE); in TEST()
926 TilePriority priority = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
998 TilePriority priority = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
1019 TilePriority top_left = tiling->TileAt(0, 0)->priority(ACTIVE_TREE); in TEST()
1020 TilePriority top_right = tiling->TileAt(1, 0)->priority(ACTIVE_TREE); in TEST()
1021 TilePriority bottom_left = tiling->TileAt(0, 1)->priority(ACTIVE_TREE); in TEST()
1022 TilePriority bottom_right = tiling->TileAt(1, 1)->priority(ACTIVE_TREE); in TEST()
[all …]
Dpicture_layer_tiling.cc440 TilePriority::TimeForBoundsToIntersect( in UpdateTilePriorities()
442 TilePriority priority( in UpdateTilePriorities()
521 TilePriority::TimeForBoundsToIntersect( in UpdateTilePriorities()
523 TilePriority priority( in UpdateTilePriorities()
557 TilePriority::TimeForBoundsToIntersect( in UpdateTilePriorities()
560 TilePriority priority( in UpdateTilePriorities()
613 it->second->SetPriority(ACTIVE_TREE, TilePriority()); in DidBecomeRecycled()
620 it->second->SetPriority(PENDING_TREE, TilePriority()); in DidBecomeActive()
Dtile_priority.cc88 scoped_ptr<base::Value> TilePriority::AsValue() const { in AsValue()
98 float TilePriority::TimeForBoundsToIntersect(const gfx::RectF& previous_bounds, in TimeForBoundsToIntersect()
Dtile.cc44 void Tile::SetPriority(WhichTree tree, const TilePriority& priority) { in SetPriority()
Dtile_manager.cc115 inline ManagedTileBin BinFromTilePriority(const TilePriority& prio) { in BinFromTilePriority()
373 TilePriority active_priority = tile->priority(ACTIVE_TREE); in GetTilesWithAssignedBins()
377 TilePriority pending_priority = tile->priority(PENDING_TREE); in GetTilesWithAssignedBins()
419 TilePriority tile_priority; in GetTilesWithAssignedBins()
/external/chromium_org/cc/test/
Dtest_tile_priorities.cc10 : TilePriority(HIGH_RESOLUTION, 0.5, 300.0) {} in TilePriorityForSoonBin()
13 : TilePriority(HIGH_RESOLUTION, 2.0, 315.0) {} in TilePriorityForEventualBin()
16 : TilePriority(HIGH_RESOLUTION, 0, 0) {} in TilePriorityForNowBin()
19 : TilePriority(HIGH_RESOLUTION, 0, 0) { in TilePriorityRequiredForActivation()
Dtest_tile_priorities.h12 class TilePriorityForSoonBin : public TilePriority {
17 class TilePriorityForEventualBin : public TilePriority {
22 class TilePriorityForNowBin : public TilePriority {
27 class TilePriorityRequiredForActivation : public TilePriority {
Dfake_picture_layer_impl.cc83 TilePriority priority; in SetAllTilesVisible()
/external/chromium_org/cc/layers/
Dpicture_layer_impl_unittest.cc1219 TilePriority priority; in TEST_F()