OLD | NEW |
---|---|
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 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 "gpu/command_buffer/client/query_tracker.h" | 5 #include "gpu/command_buffer/client/query_tracker.h" |
6 | 6 |
7 #include <GLES2/gl2.h> | 7 #include <GLES2/gl2.h> |
8 #include <GLES2/gl2ext.h> | 8 #include <GLES2/gl2ext.h> |
9 #include <GLES2/gl2extchromium.h> | 9 #include <GLES2/gl2extchromium.h> |
10 | 10 |
11 #include <limits.h> | 11 #include <limits.h> |
12 | 12 |
13 #include "base/atomicops.h" | 13 #include "base/atomicops.h" |
14 #include "base/numerics/safe_conversions.h" | 14 #include "base/numerics/safe_conversions.h" |
15 #include "gpu/command_buffer/client/gles2_cmd_helper.h" | 15 #include "gpu/command_buffer/client/gles2_cmd_helper.h" |
16 #include "gpu/command_buffer/client/gles2_implementation.h" | 16 #include "gpu/command_buffer/client/gles2_implementation.h" |
17 #include "gpu/command_buffer/client/mapped_memory.h" | 17 #include "gpu/command_buffer/client/mapped_memory.h" |
18 #include "gpu/command_buffer/common/time.h" | 18 #include "gpu/command_buffer/common/time.h" |
19 | 19 |
20 namespace gpu { | 20 namespace gpu { |
21 namespace gles2 { | 21 namespace gles2 { |
22 | 22 |
23 QuerySyncManager::Bucket::Bucket(QuerySync* sync_mem, | 23 QuerySyncManager::Bucket::Bucket(QuerySync* sync_mem, |
24 int32 shm_id, | 24 int32 shm_id, |
25 unsigned int shm_offset) | 25 unsigned int shm_offset) |
26 : syncs(sync_mem), | 26 : syncs(sync_mem), |
27 shm_id(shm_id), | 27 shm_id(shm_id), |
28 base_shm_offset(shm_offset), | 28 base_shm_offset(shm_offset), |
29 free_queries(kSyncsPerBucket) { | 29 in_use_query_count(0), |
30 static_assert(kSyncsPerBucket <= USHRT_MAX, | 30 next_query_scan_pos(0) { |
31 "Can't fit kSyncsPerBucket in unsigned short"); | |
32 for (size_t ii = 0; ii < kSyncsPerBucket; ++ii) | |
33 free_queries[ii] = ii; | |
34 } | 31 } |
35 | 32 |
36 QuerySyncManager::Bucket::~Bucket() = default; | 33 QuerySyncManager::Bucket::~Bucket() = default; |
37 | 34 |
38 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager) | 35 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager) |
39 : mapped_memory_(manager) { | 36 : mapped_memory_(manager) { |
40 DCHECK(manager); | 37 DCHECK(manager); |
41 } | 38 } |
42 | 39 |
43 QuerySyncManager::~QuerySyncManager() { | 40 QuerySyncManager::~QuerySyncManager() { |
44 while (!buckets_.empty()) { | 41 while (!buckets_.empty()) { |
45 mapped_memory_->Free(buckets_.front()->syncs); | 42 mapped_memory_->Free(buckets_.front()->syncs); |
46 delete buckets_.front(); | 43 delete buckets_.front(); |
47 buckets_.pop_front(); | 44 buckets_.pop_front(); |
48 } | 45 } |
49 } | 46 } |
50 | 47 |
51 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) { | 48 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) { |
52 DCHECK(info); | 49 DCHECK(info); |
53 Bucket* bucket = nullptr; | 50 Bucket* bucket = nullptr; |
54 for (Bucket* bucket_candidate : buckets_) { | 51 for (Bucket* bucket_candidate : buckets_) { |
55 if (!bucket_candidate->free_queries.empty()) { | 52 if (bucket_candidate->in_use_query_count != kSyncsPerBucket) { |
56 bucket = bucket_candidate; | 53 bucket = bucket_candidate; |
57 break; | 54 break; |
58 } | 55 } |
59 } | 56 } |
60 if (!bucket) { | 57 if (!bucket) { |
61 int32 shm_id; | 58 int32 shm_id; |
62 unsigned int shm_offset; | 59 unsigned int shm_offset; |
63 void* mem = mapped_memory_->Alloc( | 60 void* mem = mapped_memory_->Alloc( |
64 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset); | 61 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset); |
65 if (!mem) { | 62 if (!mem) { |
66 return false; | 63 return false; |
67 } | 64 } |
68 QuerySync* syncs = static_cast<QuerySync*>(mem); | 65 QuerySync* syncs = static_cast<QuerySync*>(mem); |
69 bucket = new Bucket(syncs, shm_id, shm_offset); | 66 bucket = new Bucket(syncs, shm_id, shm_offset); |
70 buckets_.push_back(bucket); | 67 buckets_.push_back(bucket); |
71 } | 68 } |
72 | 69 |
73 unsigned short index_in_bucket = bucket->free_queries.back(); | 70 unsigned short index_in_bucket = 0; |
71 size_t start_and_end_i = bucket->next_query_scan_pos; | |
72 | |
73 // Find a free Query in the bucket by scanning the bitset of free | |
74 // flags. Resume the search where we ended last time to avoid | |
75 // O(n^2) for the common scenario. | |
reveman
2015/05/18 19:58:42
is this really worthwhile? i would prefer if we ke
| |
76 size_t i = start_and_end_i; | |
77 do { | |
78 if (!bucket->in_use_queries[i]) { | |
79 index_in_bucket = i; | |
80 bucket->next_query_scan_pos = i; | |
81 break; | |
82 } | |
83 i = (i + 1) % kSyncsPerBucket; | |
84 } while (i != start_and_end_i); | |
85 | |
74 uint32 shm_offset = | 86 uint32 shm_offset = |
75 bucket->base_shm_offset + index_in_bucket * sizeof(QuerySync); | 87 bucket->base_shm_offset + index_in_bucket * sizeof(QuerySync); |
76 QuerySync* sync = bucket->syncs + index_in_bucket; | 88 QuerySync* sync = bucket->syncs + index_in_bucket; |
77 *info = QueryInfo(bucket, bucket->shm_id, shm_offset, sync); | 89 *info = QueryInfo(bucket, bucket->shm_id, shm_offset, sync); |
78 info->sync->Reset(); | 90 info->sync->Reset(); |
79 bucket->free_queries.pop_back(); | 91 bucket->in_use_queries[index_in_bucket] = true; |
92 bucket->in_use_query_count++; | |
80 return true; | 93 return true; |
81 } | 94 } |
82 | 95 |
83 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) { | 96 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) { |
84 DCHECK(info.bucket->free_queries.size() < kSyncsPerBucket); | 97 DCHECK(info.bucket->in_use_query_count > 0); |
85 unsigned short index_in_bucket = info.sync - info.bucket->syncs; | 98 unsigned short index_in_bucket = info.sync - info.bucket->syncs; |
86 info.bucket->free_queries.push_back(index_in_bucket); | 99 DCHECK(info.bucket->in_use_queries[index_in_bucket] == true); |
100 info.bucket->in_use_queries[index_in_bucket] = false; | |
101 info.bucket->in_use_query_count--; | |
87 } | 102 } |
88 | 103 |
89 void QuerySyncManager::Shrink() { | 104 void QuerySyncManager::Shrink() { |
90 std::deque<Bucket*> new_buckets; | 105 std::deque<Bucket*> new_buckets; |
91 while (!buckets_.empty()) { | 106 while (!buckets_.empty()) { |
92 Bucket* bucket = buckets_.front(); | 107 Bucket* bucket = buckets_.front(); |
93 if (bucket->free_queries.size() < kSyncsPerBucket) { | 108 if (bucket->in_use_query_count > 0) { |
94 new_buckets.push_back(bucket); | 109 new_buckets.push_back(bucket); |
95 } else { | 110 } else { |
96 mapped_memory_->Free(bucket->syncs); | 111 mapped_memory_->Free(bucket->syncs); |
97 delete bucket; | 112 delete bucket; |
98 } | 113 } |
99 buckets_.pop_front(); | 114 buckets_.pop_front(); |
100 } | 115 } |
101 buckets_.swap(new_buckets); | 116 buckets_.swap(new_buckets); |
102 } | 117 } |
103 | 118 |
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
267 } | 282 } |
268 | 283 |
269 query_sync_manager_.Free(query->info_); | 284 query_sync_manager_.Free(query->info_); |
270 it = removed_queries_.erase(it); | 285 it = removed_queries_.erase(it); |
271 delete query; | 286 delete query; |
272 } | 287 } |
273 } | 288 } |
274 | 289 |
275 } // namespace gles2 | 290 } // namespace gles2 |
276 } // namespace gpu | 291 } // namespace gpu |
OLD | NEW |