OLD | NEW |
---|---|
1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 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/resources/resource_pool.h" | 5 #include "cc/resources/resource_pool.h" |
6 | 6 |
7 #include "cc/resources/resource_provider.h" | 7 #include "cc/resources/resource_provider.h" |
8 #include "cc/resources/scoped_resource.h" | 8 #include "cc/resources/scoped_resource.h" |
9 | 9 |
10 namespace cc { | 10 namespace cc { |
11 | 11 |
12 ResourcePool::ResourcePool(ResourceProvider* resource_provider, GLenum target) | 12 ResourcePool::ResourcePool(ResourceProvider* resource_provider, GLenum target) |
13 : resource_provider_(resource_provider), | 13 : resource_provider_(resource_provider), |
14 target_(target), | 14 target_(target), |
15 max_memory_usage_bytes_(0), | 15 max_memory_usage_bytes_(0), |
16 max_unused_memory_usage_bytes_(0), | 16 max_unused_memory_usage_bytes_(0), |
17 max_resource_count_(0), | 17 max_resource_count_(0), |
18 memory_usage_bytes_(0), | 18 memory_usage_bytes_(0), |
19 unused_memory_usage_bytes_(0), | 19 unused_memory_usage_bytes_(0), |
20 resource_count_(0) {} | 20 resource_count_(0) {} |
21 | 21 |
22 ResourcePool::~ResourcePool() { | 22 ResourcePool::~ResourcePool() { |
23 while (!busy_resources_.empty()) { | 23 while (!busy_resources_.empty()) { |
24 DidFinishUsingResource(busy_resources_.front()); | 24 auto const& front = busy_resources_.front(); |
25 DidFinishUsingResource(front.resource, front.id); | |
25 busy_resources_.pop_front(); | 26 busy_resources_.pop_front(); |
26 } | 27 } |
27 | 28 |
28 SetResourceUsageLimits(0, 0, 0); | 29 SetResourceUsageLimits(0, 0, 0); |
29 DCHECK_EQ(0u, unused_resources_.size()); | 30 DCHECK_EQ(0u, unused_resources_.size()); |
30 DCHECK_EQ(0u, memory_usage_bytes_); | 31 DCHECK_EQ(0u, memory_usage_bytes_); |
31 DCHECK_EQ(0u, unused_memory_usage_bytes_); | 32 DCHECK_EQ(0u, unused_memory_usage_bytes_); |
32 DCHECK_EQ(0u, resource_count_); | 33 DCHECK_EQ(0u, resource_count_); |
33 } | 34 } |
34 | 35 |
35 scoped_ptr<ScopedResource> ResourcePool::AcquireResource( | 36 scoped_ptr<ScopedResource> ResourcePool::AcquireResource( |
36 const gfx::Size& size, ResourceFormat format) { | 37 const gfx::Size& size, ResourceFormat format) { |
37 for (ResourceList::iterator it = unused_resources_.begin(); | 38 for (ResourceList::iterator it = unused_resources_.begin(); |
38 it != unused_resources_.end(); | 39 it != unused_resources_.end(); |
39 ++it) { | 40 ++it) { |
40 ScopedResource* resource = *it; | 41 ScopedResource* resource = it->resource; |
41 DCHECK(resource_provider_->CanLockForWrite(resource->id())); | 42 DCHECK(resource_provider_->CanLockForWrite(resource->id())); |
42 | 43 |
43 if (resource->format() != format) | 44 if (resource->format() != format) |
44 continue; | 45 continue; |
45 if (resource->size() != size) | 46 if (resource->size() != size) |
46 continue; | 47 continue; |
47 | 48 |
48 unused_resources_.erase(it); | 49 unused_resources_.erase(it); |
49 unused_memory_usage_bytes_ -= resource->bytes(); | 50 unused_memory_usage_bytes_ -= resource->bytes(); |
50 return make_scoped_ptr(resource); | 51 return make_scoped_ptr(resource); |
51 } | 52 } |
52 | 53 |
53 scoped_ptr<ScopedResource> resource = | 54 scoped_ptr<ScopedResource> resource = |
54 ScopedResource::Create(resource_provider_); | 55 ScopedResource::Create(resource_provider_); |
55 resource->AllocateManaged(size, target_, format); | 56 resource->AllocateManaged(size, target_, format); |
56 | 57 |
57 memory_usage_bytes_ += resource->bytes(); | 58 memory_usage_bytes_ += resource->bytes(); |
58 ++resource_count_; | 59 ++resource_count_; |
59 return resource.Pass(); | 60 return resource.Pass(); |
60 } | 61 } |
61 | 62 |
62 void ResourcePool::ReleaseResource(scoped_ptr<ScopedResource> resource) { | 63 scoped_ptr<ScopedResource> ResourcePool::TryAcquireOldResource( |
63 busy_resources_.push_back(resource.release()); | 64 const gfx::Size& size, |
65 ResourceFormat format, | |
66 uint64_t id) { | |
67 if (!id) | |
reveman
2015/05/22 17:15:13
hm, doesn't it make more sense for the caller to c
danakj
2015/05/26 19:02:52
Sure, can do if you. It means if (id && TryBlah())
danakj
2015/05/26 23:37:34
Done.
| |
68 return nullptr; | |
69 | |
70 auto it = std::find_if(unused_resources_.begin(), unused_resources_.end(), | |
71 [id](const PoolResource& pr) { return pr.id == id; }); | |
72 if (it == unused_resources_.end()) | |
73 return nullptr; | |
74 | |
75 ScopedResource* resource = it->resource; | |
76 DCHECK(resource_provider_->CanLockForWrite(resource->id())); | |
77 if (resource->format() != format || resource->size() != size) | |
reveman
2015/05/22 17:15:13
how can a resource with the same ID have a differe
danakj
2015/05/26 19:02:52
I don't know. :) I guess that it can't. I'll DCHEC
danakj
2015/05/26 23:37:34
Done.
| |
78 return nullptr; | |
79 | |
80 unused_resources_.erase(it); | |
81 unused_memory_usage_bytes_ -= resource->bytes(); | |
82 return make_scoped_ptr(resource); | |
83 } | |
84 | |
85 void ResourcePool::ReleaseResource(scoped_ptr<ScopedResource> resource, | |
86 uint64_t id) { | |
87 busy_resources_.push_back(PoolResource(resource.release(), id)); | |
64 } | 88 } |
65 | 89 |
66 void ResourcePool::SetResourceUsageLimits(size_t max_memory_usage_bytes, | 90 void ResourcePool::SetResourceUsageLimits(size_t max_memory_usage_bytes, |
67 size_t max_unused_memory_usage_bytes, | 91 size_t max_unused_memory_usage_bytes, |
68 size_t max_resource_count) { | 92 size_t max_resource_count) { |
69 max_memory_usage_bytes_ = max_memory_usage_bytes; | 93 max_memory_usage_bytes_ = max_memory_usage_bytes; |
70 max_unused_memory_usage_bytes_ = max_unused_memory_usage_bytes; | 94 max_unused_memory_usage_bytes_ = max_unused_memory_usage_bytes; |
71 max_resource_count_ = max_resource_count; | 95 max_resource_count_ = max_resource_count; |
72 | 96 |
73 ReduceResourceUsage(); | 97 ReduceResourceUsage(); |
74 } | 98 } |
75 | 99 |
76 void ResourcePool::ReduceResourceUsage() { | 100 void ResourcePool::ReduceResourceUsage() { |
77 while (!unused_resources_.empty()) { | 101 while (!unused_resources_.empty()) { |
78 if (!ResourceUsageTooHigh()) | 102 if (!ResourceUsageTooHigh()) |
79 break; | 103 break; |
80 | 104 |
81 // LRU eviction pattern. Most recently used might be blocked by | 105 // LRU eviction pattern. Most recently used might be blocked by |
82 // a read lock fence but it's still better to evict the least | 106 // a read lock fence but it's still better to evict the least |
83 // recently used as it prevents a resource that is hard to reuse | 107 // recently used as it prevents a resource that is hard to reuse |
84 // because of unique size from being kept around. Resources that | 108 // because of unique size from being kept around. Resources that |
85 // can't be locked for write might also not be truly free-able. | 109 // can't be locked for write might also not be truly free-able. |
86 // We can free the resource here but it doesn't mean that the | 110 // We can free the resource here but it doesn't mean that the |
87 // memory is necessarily returned to the OS. | 111 // memory is necessarily returned to the OS. |
88 ScopedResource* resource = unused_resources_.front(); | 112 ScopedResource* resource = unused_resources_.front().resource; |
89 unused_resources_.pop_front(); | 113 unused_resources_.pop_front(); |
90 memory_usage_bytes_ -= resource->bytes(); | 114 memory_usage_bytes_ -= resource->bytes(); |
91 unused_memory_usage_bytes_ -= resource->bytes(); | 115 unused_memory_usage_bytes_ -= resource->bytes(); |
92 --resource_count_; | 116 --resource_count_; |
93 delete resource; | 117 delete resource; |
94 } | 118 } |
95 } | 119 } |
96 | 120 |
97 bool ResourcePool::ResourceUsageTooHigh() { | 121 bool ResourcePool::ResourceUsageTooHigh() { |
98 if (resource_count_ > max_resource_count_) | 122 if (resource_count_ > max_resource_count_) |
99 return true; | 123 return true; |
100 if (memory_usage_bytes_ > max_memory_usage_bytes_) | 124 if (memory_usage_bytes_ > max_memory_usage_bytes_) |
101 return true; | 125 return true; |
102 if (unused_memory_usage_bytes_ > max_unused_memory_usage_bytes_) | 126 if (unused_memory_usage_bytes_ > max_unused_memory_usage_bytes_) |
103 return true; | 127 return true; |
104 return false; | 128 return false; |
105 } | 129 } |
106 | 130 |
107 void ResourcePool::CheckBusyResources(bool wait_if_needed) { | 131 void ResourcePool::CheckBusyResources(bool wait_if_needed) { |
108 ResourceList::iterator it = busy_resources_.begin(); | 132 ResourceList::iterator it = busy_resources_.begin(); |
109 | 133 |
110 while (it != busy_resources_.end()) { | 134 while (it != busy_resources_.end()) { |
111 ScopedResource* resource = *it; | 135 ScopedResource* resource = it->resource; |
112 | 136 |
113 if (wait_if_needed) | 137 if (wait_if_needed) |
114 resource_provider_->WaitReadLockIfNeeded(resource->id()); | 138 resource_provider_->WaitReadLockIfNeeded(resource->id()); |
115 | 139 |
116 if (resource_provider_->CanLockForWrite(resource->id())) { | 140 if (resource_provider_->CanLockForWrite(resource->id())) { |
117 DidFinishUsingResource(resource); | 141 DidFinishUsingResource(resource, it->id); |
118 it = busy_resources_.erase(it); | 142 it = busy_resources_.erase(it); |
119 } else { | 143 } else { |
120 ++it; | 144 ++it; |
121 } | 145 } |
122 } | 146 } |
123 } | 147 } |
124 | 148 |
125 void ResourcePool::DidFinishUsingResource(ScopedResource* resource) { | 149 void ResourcePool::DidFinishUsingResource(ScopedResource* resource, |
150 uint64_t id) { | |
126 unused_memory_usage_bytes_ += resource->bytes(); | 151 unused_memory_usage_bytes_ += resource->bytes(); |
127 unused_resources_.push_back(resource); | 152 unused_resources_.push_back(PoolResource(resource, id)); |
128 } | 153 } |
129 | 154 |
130 } // namespace cc | 155 } // namespace cc |
OLD | NEW |