Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(142)

Side by Side Diff: gpu/command_buffer/client/query_tracker.cc

Issue 1131913004: More compact representation of the GL Query cache (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: And unittest Created 5 years, 7 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
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>
12
11 #include "base/atomicops.h" 13 #include "base/atomicops.h"
12 #include "base/numerics/safe_conversions.h" 14 #include "base/numerics/safe_conversions.h"
13 #include "gpu/command_buffer/client/gles2_cmd_helper.h" 15 #include "gpu/command_buffer/client/gles2_cmd_helper.h"
14 #include "gpu/command_buffer/client/gles2_implementation.h" 16 #include "gpu/command_buffer/client/gles2_implementation.h"
15 #include "gpu/command_buffer/client/mapped_memory.h" 17 #include "gpu/command_buffer/client/mapped_memory.h"
16 #include "gpu/command_buffer/common/time.h" 18 #include "gpu/command_buffer/common/time.h"
17 19
18 namespace gpu { 20 namespace gpu {
19 namespace gles2 { 21 namespace gles2 {
20 22
23 QuerySyncManager::Bucket::Bucket(QuerySync* sync_mem,
24 int32 shm_id,
25 unsigned int shm_offset)
26 : syncs(sync_mem),
27 shm_id(shm_id),
28 base_shm_offset(shm_offset),
29 free_queries(kSyncsPerBucket) {
30 static_assert(kSyncsPerBucket <= USHRT_MAX,
31 "Can't fit kSyncsPerBucket in unsigned short");
32 for (size_t ii = 0; ii < kSyncsPerBucket; ++ii)
33 free_queries[ii] = ii;
34 }
35
36 QuerySyncManager::Bucket::~Bucket() = default;
37
21 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager) 38 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager)
22 : mapped_memory_(manager) { 39 : mapped_memory_(manager) {
23 DCHECK(manager); 40 DCHECK(manager);
24 } 41 }
25 42
26 QuerySyncManager::~QuerySyncManager() { 43 QuerySyncManager::~QuerySyncManager() {
27 while (!buckets_.empty()) { 44 while (!buckets_.empty()) {
28 mapped_memory_->Free(buckets_.front()->syncs); 45 mapped_memory_->Free(buckets_.front()->syncs);
29 delete buckets_.front(); 46 delete buckets_.front();
30 buckets_.pop_front(); 47 buckets_.pop_front();
31 } 48 }
32 } 49 }
33 50
34 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) { 51 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) {
35 DCHECK(info); 52 DCHECK(info);
36 if (free_queries_.empty()) { 53 Bucket* bucket = nullptr;
54 for (Bucket* bucket_candidate : buckets_) {
55 if (!bucket_candidate->free_queries.empty()) {
56 bucket = bucket_candidate;
57 break;
58 }
59 }
60 if (!bucket) {
37 int32 shm_id; 61 int32 shm_id;
38 unsigned int shm_offset; 62 unsigned int shm_offset;
39 void* mem = mapped_memory_->Alloc( 63 void* mem = mapped_memory_->Alloc(
40 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset); 64 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset);
41 if (!mem) { 65 if (!mem) {
42 return false; 66 return false;
43 } 67 }
44 QuerySync* syncs = static_cast<QuerySync*>(mem); 68 QuerySync* syncs = static_cast<QuerySync*>(mem);
45 Bucket* bucket = new Bucket(syncs); 69 bucket = new Bucket(syncs, shm_id, shm_offset);
46 buckets_.push_back(bucket); 70 buckets_.push_back(bucket);
47 for (size_t ii = 0; ii < kSyncsPerBucket; ++ii) {
48 free_queries_.push_back(QueryInfo(bucket, shm_id, shm_offset, syncs));
49 ++syncs;
50 shm_offset += sizeof(*syncs);
51 }
52 } 71 }
53 *info = free_queries_.front(); 72
54 ++(info->bucket->used_query_count); 73 unsigned short index_in_bucket = bucket->free_queries.back();
74 uint32 shm_offset =
75 bucket->base_shm_offset + index_in_bucket * sizeof(QuerySync);
76 QuerySync* sync = bucket->syncs + index_in_bucket;
77 *info = QueryInfo(bucket, bucket->shm_id, shm_offset, sync);
55 info->sync->Reset(); 78 info->sync->Reset();
56 free_queries_.pop_front(); 79 bucket->free_queries.pop_back();
57 return true; 80 return true;
58 } 81 }
59 82
60 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) { 83 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) {
61 DCHECK_GT(info.bucket->used_query_count, 0u); 84 DCHECK(info.bucket->free_queries.size() < kSyncsPerBucket);
62 --(info.bucket->used_query_count); 85 unsigned short index_in_bucket = info.sync - info.bucket->syncs;
63 free_queries_.push_back(info); 86 info.bucket->free_queries.push_back(index_in_bucket);
64 } 87 }
65 88
66 void QuerySyncManager::Shrink() { 89 void QuerySyncManager::Shrink() {
67 std::deque<QueryInfo> new_queue;
68 while (!free_queries_.empty()) {
69 if (free_queries_.front().bucket->used_query_count)
70 new_queue.push_back(free_queries_.front());
71 free_queries_.pop_front();
72 }
73 free_queries_.swap(new_queue);
74
75 std::deque<Bucket*> new_buckets; 90 std::deque<Bucket*> new_buckets;
76 while (!buckets_.empty()) { 91 while (!buckets_.empty()) {
77 Bucket* bucket = buckets_.front(); 92 Bucket* bucket = buckets_.front();
78 if (bucket->used_query_count) { 93 if (bucket->free_queries.size() < kSyncsPerBucket) {
79 new_buckets.push_back(bucket); 94 new_buckets.push_back(bucket);
80 } else { 95 } else {
81 mapped_memory_->Free(bucket->syncs); 96 mapped_memory_->Free(bucket->syncs);
82 delete bucket; 97 delete bucket;
83 } 98 }
84 buckets_.pop_front(); 99 buckets_.pop_front();
85 } 100 }
86 buckets_.swap(new_buckets); 101 buckets_.swap(new_buckets);
87 } 102 }
88 103
(...skipping 163 matching lines...) Expand 10 before | Expand all | Expand 10 after
252 } 267 }
253 268
254 query_sync_manager_.Free(query->info_); 269 query_sync_manager_.Free(query->info_);
255 it = removed_queries_.erase(it); 270 it = removed_queries_.erase(it);
256 delete query; 271 delete query;
257 } 272 }
258 } 273 }
259 274
260 } // namespace gles2 275 } // namespace gles2
261 } // namespace gpu 276 } // namespace gpu
OLDNEW
« no previous file with comments | « gpu/command_buffer/client/query_tracker.h ('k') | gpu/command_buffer/client/query_tracker_unittest.cc » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698