Searched refs:GetRegionComplexity (Results 1 - 9 of 9) sorted by relevance
/external/chromium_org/cc/base/ |
H A D | invalidation_region.cc | 35 if (region_.GetRegionComplexity() > kMaxInvalidationRectCount)
|
H A D | region.cc | 49 int Region::GetRegionComplexity() const { function in class:cc::Region 86 for (size_t i = 0; i < region.GetRegionComplexity(); ++i) {
|
H A D | simple_enclosed_region.h | 42 size_t GetRegionComplexity() const { return rect_.IsEmpty() ? 0 : 1; } function in class:cc::SimpleEnclosedRegion 77 // The value of |i| must be less than GetRegionComplexity().
|
H A D | region.h | 39 int GetRegionComplexity() const;
|
H A D | simple_enclosed_region.cc | 132 DCHECK_LT(i, GetRegionComplexity());
|
H A D | simple_enclosed_region_unittest.cc | 24 for (size_t i = 0; i < region.GetRegionComplexity(); ++i) 92 TEST(SimpleEnclosedRegionTest, GetRegionComplexity) { 94 EXPECT_EQ(0u, empty.GetRegionComplexity()); 98 EXPECT_EQ(1u, stuff.GetRegionComplexity()); 102 EXPECT_EQ(1u, stuff.GetRegionComplexity()); 348 EXPECT_EQ(1u, r.GetRegionComplexity());
|
/external/chromium_org/cc/trees/ |
H A D | occlusion.cc | 69 DCHECK_LE(occlusion_from_inside_target_.GetRegionComplexity(), 1u); 70 DCHECK_LE(occlusion_from_outside_target_.GetRegionComplexity(), 1u);
|
H A D | occlusion_tracker.cc | 96 for (size_t i = 0; i < region.GetRegionComplexity(); ++i) { 279 for (size_t i = 0; i < affected_occlusion.GetRegionComplexity(); ++i) { 441 for (size_t i = 0; i < opaque_contents.GetRegionComplexity(); ++i) { 522 DCHECK_LE(second_last.occlusion_from_inside_target.GetRegionComplexity(), 1u); 523 DCHECK_LE(second_last.occlusion_from_outside_target.GetRegionComplexity(), 548 for (size_t i = 0; i < occluded.GetRegionComplexity(); ++i)
|
H A D | occlusion_tracker_unittest.cc | 2657 for (size_t i = 0; i < expected_occlusion.GetRegionComplexity(); ++i) { 2658 ASSERT_LT(i, actual_occlusion.GetRegionComplexity());
|
Completed in 2658 milliseconds