Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 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 "cc/base/invalidation_region.h" | 5 #include "cc/base/invalidation_region.h" |
| 6 | 6 |
| 7 #include "base/metrics/histogram.h" | 7 #include "base/metrics/histogram.h" |
| 8 | 8 |
| 9 namespace { | 9 namespace { |
| 10 | 10 |
| 11 const int kMaxInvalidationRectCount = 256; | 11 const int kMaxInvalidationRectCount = 256; |
| 12 | 12 |
| 13 } // namespace | 13 } // namespace |
| 14 | 14 |
| 15 namespace cc { | 15 namespace cc { |
| 16 | 16 |
| 17 InvalidationRegion::InvalidationRegion() {} | 17 InvalidationRegion::InvalidationRegion() {} |
| 18 | 18 |
| 19 InvalidationRegion::~InvalidationRegion() {} | 19 InvalidationRegion::~InvalidationRegion() {} |
| 20 | 20 |
| 21 void InvalidationRegion::Swap(Region* region) { | 21 void InvalidationRegion::Swap(Region* region) { |
| 22 FinalizePendingRects(); | |
| 22 region_.Swap(region); | 23 region_.Swap(region); |
| 23 } | 24 } |
| 24 | 25 |
| 25 void InvalidationRegion::Clear() { | 26 void InvalidationRegion::Clear() { |
| 27 pending_rects_.clear(); | |
| 26 region_.Clear(); | 28 region_.Clear(); |
| 27 } | 29 } |
| 28 | 30 |
| 29 void InvalidationRegion::Union(const gfx::Rect& rect) { | 31 void InvalidationRegion::Union(const gfx::Rect& rect) { |
| 30 region_.Union(rect); | 32 pending_rects_.push_back(rect); |
|
enne (OOO)
2016/06/08 19:05:14
I'm prematurely optimizing here, but what about ea
vmiura
2016/06/08 19:54:27
Done.
| |
| 31 SimplifyIfNeeded(); | |
| 32 } | 33 } |
| 33 | 34 |
| 34 void InvalidationRegion::SimplifyIfNeeded() { | 35 void InvalidationRegion::FinalizePendingRects() { |
| 35 if (region_.GetRegionComplexity() > kMaxInvalidationRectCount) | 36 if (pending_rects_.empty()) |
| 36 region_ = region_.bounds(); | 37 return; |
| 38 | |
| 39 if (region_.GetRegionComplexity() + pending_rects_.size() > | |
| 40 kMaxInvalidationRectCount) { | |
| 41 gfx::Rect pending_bounds = region_.bounds(); | |
| 42 for (auto& rect : pending_rects_) | |
| 43 pending_bounds.Union(rect); | |
| 44 region_ = pending_bounds; | |
| 45 } else { | |
| 46 for (auto& rect : pending_rects_) | |
| 47 region_.Union(rect); | |
| 48 } | |
| 49 | |
| 50 pending_rects_.clear(); | |
| 37 } | 51 } |
| 38 | 52 |
| 39 } // namespace cc | 53 } // namespace cc |
| OLD | NEW |