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

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: Smaller patch still. 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 "base/atomicops.h" 11 #include "base/atomicops.h"
12 #include "base/numerics/safe_conversions.h" 12 #include "base/numerics/safe_conversions.h"
13 #include "gpu/command_buffer/client/gles2_cmd_helper.h" 13 #include "gpu/command_buffer/client/gles2_cmd_helper.h"
14 #include "gpu/command_buffer/client/gles2_implementation.h" 14 #include "gpu/command_buffer/client/gles2_implementation.h"
15 #include "gpu/command_buffer/client/mapped_memory.h" 15 #include "gpu/command_buffer/client/mapped_memory.h"
16 #include "gpu/command_buffer/common/time.h" 16 #include "gpu/command_buffer/common/time.h"
17 17
18 namespace gpu { 18 namespace gpu {
19 namespace gles2 { 19 namespace gles2 {
20 20
21 QuerySyncManager::Bucket::Bucket(QuerySync* sync_mem,
22 int32 shm_id,
23 unsigned int shm_offset)
24 : syncs(sync_mem),
25 used_query_count(0),
26 shm_id(shm_id),
27 base_shm_offset(shm_offset) {
28 }
29
30 QuerySyncManager::Bucket::~Bucket() = default;
reveman 2015/05/11 17:13:07 is "= default;" allowed/recommended now?
Daniel Bratell 2015/05/12 16:16:40 It is allowed. The differences between Foo::~Foo(
31
21 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager) 32 QuerySyncManager::QuerySyncManager(MappedMemoryManager* manager)
22 : mapped_memory_(manager) { 33 : mapped_memory_(manager) {
23 DCHECK(manager); 34 DCHECK(manager);
24 } 35 }
25 36
26 QuerySyncManager::~QuerySyncManager() { 37 QuerySyncManager::~QuerySyncManager() {
27 while (!buckets_.empty()) { 38 while (!buckets_.empty()) {
28 mapped_memory_->Free(buckets_.front()->syncs); 39 mapped_memory_->Free(buckets_.front()->syncs);
29 delete buckets_.front(); 40 delete buckets_.front();
30 buckets_.pop_front(); 41 buckets_.pop_front();
31 } 42 }
32 } 43 }
33 44
34 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) { 45 bool QuerySyncManager::Alloc(QuerySyncManager::QueryInfo* info) {
35 DCHECK(info); 46 DCHECK(info);
36 if (free_queries_.empty()) { 47 Bucket* bucket = nullptr;
48 for (Bucket* bucket_candidate : buckets_) {
49 if (bucket_candidate->free_queries.size() != 0) {
reveman 2015/05/11 17:13:07 s/free_queries.size() != 0/!free_queries.empty()/
Daniel Bratell 2015/05/12 16:16:40 Done.
50 bucket = bucket_candidate;
51 break;
52 }
53 }
54 if (!bucket) {
37 int32 shm_id; 55 int32 shm_id;
38 unsigned int shm_offset; 56 unsigned int shm_offset;
39 void* mem = mapped_memory_->Alloc( 57 void* mem = mapped_memory_->Alloc(
40 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset); 58 kSyncsPerBucket * sizeof(QuerySync), &shm_id, &shm_offset);
41 if (!mem) { 59 if (!mem) {
42 return false; 60 return false;
43 } 61 }
44 QuerySync* syncs = static_cast<QuerySync*>(mem); 62 QuerySync* syncs = static_cast<QuerySync*>(mem);
45 Bucket* bucket = new Bucket(syncs); 63 bucket = new Bucket(syncs, shm_id, shm_offset);
46 buckets_.push_back(bucket); 64 buckets_.push_back(bucket);
47 for (size_t ii = 0; ii < kSyncsPerBucket; ++ii) { 65 bucket->free_queries.reserve(kSyncsPerBucket);
reveman 2015/05/11 17:13:07 Please use kSyncsPerBucket when creating the vecto
Daniel Bratell 2015/05/12 16:16:40 Done.
48 free_queries_.push_back(QueryInfo(bucket, shm_id, shm_offset, syncs)); 66 for (size_t ii = 0; ii < kSyncsPerBucket; ++ii)
reveman 2015/05/11 17:13:07 maybe move this loop to the ctor too
Daniel Bratell 2015/05/12 16:16:40 Done.
49 ++syncs; 67 bucket->free_queries.push_back(ii);
50 shm_offset += sizeof(*syncs);
51 }
52 } 68 }
53 *info = free_queries_.front(); 69
54 ++(info->bucket->used_query_count); 70 unsigned short index_in_bucket = bucket->free_queries.back();
71 uint32 shm_offset =
72 bucket->base_shm_offset + index_in_bucket * sizeof(QuerySync);
73 QuerySync* sync = bucket->syncs + index_in_bucket;
74 *info = QueryInfo(bucket, bucket->shm_id, shm_offset, sync);
75 bucket->used_query_count++;
55 info->sync->Reset(); 76 info->sync->Reset();
56 free_queries_.pop_front(); 77 bucket->free_queries.pop_back();
57 return true; 78 return true;
58 } 79 }
59 80
60 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) { 81 void QuerySyncManager::Free(const QuerySyncManager::QueryInfo& info) {
61 DCHECK_GT(info.bucket->used_query_count, 0u); 82 DCHECK_GT(info.bucket->used_query_count, 0u);
62 --(info.bucket->used_query_count); 83 --(info.bucket->used_query_count);
63 free_queries_.push_back(info); 84 unsigned short index_in_bucket = info.sync - info.bucket->syncs;
85 info.bucket->free_queries.push_back(index_in_bucket);
64 } 86 }
65 87
66 void QuerySyncManager::Shrink() { 88 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; 89 std::deque<Bucket*> new_buckets;
76 while (!buckets_.empty()) { 90 while (!buckets_.empty()) {
77 Bucket* bucket = buckets_.front(); 91 Bucket* bucket = buckets_.front();
78 if (bucket->used_query_count) { 92 if (bucket->used_query_count) {
79 new_buckets.push_back(bucket); 93 new_buckets.push_back(bucket);
80 } else { 94 } else {
81 mapped_memory_->Free(bucket->syncs); 95 mapped_memory_->Free(bucket->syncs);
82 delete bucket; 96 delete bucket;
83 } 97 }
84 buckets_.pop_front(); 98 buckets_.pop_front();
(...skipping 167 matching lines...) Expand 10 before | Expand all | Expand 10 after
252 } 266 }
253 267
254 query_sync_manager_.Free(query->info_); 268 query_sync_manager_.Free(query->info_);
255 it = removed_queries_.erase(it); 269 it = removed_queries_.erase(it);
256 delete query; 270 delete query;
257 } 271 }
258 } 272 }
259 273
260 } // namespace gles2 274 } // namespace gles2
261 } // namespace gpu 275 } // namespace gpu
OLDNEW
« gpu/command_buffer/client/query_tracker.h ('K') | « gpu/command_buffer/client/query_tracker.h ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698