blob: d8ca8237a1e52ce8e8ea8294c4d561f3421514e3 [file] [log] [blame]
[email protected]c4488402012-01-11 01:05:491// Copyright (c) 2012 The Chromium Authors. All rights reserved.
[email protected]1bee3982009-12-17 23:15:282// Use of this source code is governed by a BSD-style license that can be
3// found in the LICENSE file.
[email protected]96449d2c2009-11-25 00:01:324
5// This file contains the implementation of the command buffer helper class.
6
[email protected]1df19862013-05-24 11:26:297#include "gpu/command_buffer/client/cmd_buffer_helper.h"
[email protected]cf1aa982013-11-05 21:49:378
9#include "base/logging.h"
[email protected]1df19862013-05-24 11:26:2910#include "gpu/command_buffer/common/command_buffer.h"
11#include "gpu/command_buffer/common/trace_event.h"
[email protected]96449d2c2009-11-25 00:01:3212
[email protected]a7a27ace2009-12-12 00:11:2513namespace gpu {
[email protected]96449d2c2009-11-25 00:01:3214
[email protected]96449d2c2009-11-25 00:01:3215CommandBufferHelper::CommandBufferHelper(CommandBuffer* command_buffer)
16 : command_buffer_(command_buffer),
[email protected]503b3a22011-12-12 23:29:4017 ring_buffer_id_(-1),
18 ring_buffer_size_(0),
[email protected]96449d2c2009-11-25 00:01:3219 entries_(NULL),
[email protected]9310b262010-06-03 16:15:4720 total_entry_count_(0),
[email protected]15691b42014-02-12 00:56:0021 immediate_entry_count_(0),
[email protected]96449d2c2009-11-25 00:01:3222 token_(0),
[email protected]7d5b8d12011-01-14 23:43:1523 put_(0),
[email protected]b36897c12011-07-12 18:04:1024 last_put_sent_(0),
[email protected]15691b42014-02-12 00:56:0025#if defined(CMD_HELPER_PERIODIC_FLUSH_CHECK)
[email protected]b36897c12011-07-12 18:04:1026 commands_issued_(0),
[email protected]15691b42014-02-12 00:56:0027#endif
[email protected]c4488402012-01-11 01:05:4928 usable_(true),
[email protected]d35e6a72012-08-25 01:51:1329 context_lost_(false),
[email protected]362e6d602012-10-17 16:55:0630 flush_automatically_(true),
[email protected]3d668fb2014-02-22 00:49:3831 last_flush_time_(0),
32 flush_generation_(0) {
[email protected]96449d2c2009-11-25 00:01:3233}
34
[email protected]362e6d602012-10-17 16:55:0635void CommandBufferHelper::SetAutomaticFlushes(bool enabled) {
36 flush_automatically_ = enabled;
[email protected]15691b42014-02-12 00:56:0037 CalcImmediateEntries(0);
[email protected]362e6d602012-10-17 16:55:0638}
39
[email protected]d35e6a72012-08-25 01:51:1340bool CommandBufferHelper::IsContextLost() {
41 if (!context_lost_) {
42 context_lost_ = error::IsError(command_buffer()->GetLastError());
43 }
44 return context_lost_;
45}
46
[email protected]15691b42014-02-12 00:56:0047void CommandBufferHelper::CalcImmediateEntries(int waiting_count) {
48 DCHECK_GE(waiting_count, 0);
49
50 // Check if usable & allocated.
51 if (!usable() || !HaveRingBuffer()) {
52 immediate_entry_count_ = 0;
53 return;
54 }
55
56 // Get maximum safe contiguous entries.
57 const int32 curr_get = get_offset();
58 if (curr_get > put_) {
59 immediate_entry_count_ = curr_get - put_ - 1;
60 } else {
61 immediate_entry_count_ =
62 total_entry_count_ - put_ - (curr_get == 0 ? 1 : 0);
63 }
64
65 // Limit entry count to force early flushing.
66 if (flush_automatically_) {
67 int32 limit =
68 total_entry_count_ /
69 ((curr_get == last_put_sent_) ? kAutoFlushSmall : kAutoFlushBig);
70
71 int32 pending =
72 (put_ + total_entry_count_ - last_put_sent_) % total_entry_count_;
73
74 if (pending > 0 && pending >= limit) {
75 // Time to force flush.
76 immediate_entry_count_ = 0;
77 } else {
78 // Limit remaining entries, but not lower than waiting_count entries to
79 // prevent deadlock when command size is greater than the flush limit.
80 limit -= pending;
81 limit = limit < waiting_count ? waiting_count : limit;
82 immediate_entry_count_ =
83 immediate_entry_count_ > limit ? limit : immediate_entry_count_;
84 }
85 }
86}
87
[email protected]503b3a22011-12-12 23:29:4088bool CommandBufferHelper::AllocateRingBuffer() {
[email protected]c4488402012-01-11 01:05:4989 if (!usable()) {
90 return false;
91 }
92
[email protected]617296e2011-12-15 05:37:5793 if (HaveRingBuffer()) {
94 return true;
95 }
96
[email protected]67c80782012-12-21 01:16:5297 int32 id = -1;
[email protected]44096602014-03-26 04:53:5898 scoped_refptr<Buffer> buffer =
99 command_buffer_->CreateTransferBuffer(ring_buffer_size_, &id);
[email protected]503b3a22011-12-12 23:29:40100 if (id < 0) {
[email protected]c4488402012-01-11 01:05:49101 ClearUsable();
[email protected]503b3a22011-12-12 23:29:40102 return false;
103 }
104
[email protected]67c80782012-12-21 01:16:52105 ring_buffer_ = buffer;
[email protected]503b3a22011-12-12 23:29:40106 ring_buffer_id_ = id;
107 command_buffer_->SetGetBuffer(id);
108
109 // TODO(gman): Do we really need to call GetState here? We know get & put = 0
110 // Also do we need to check state.num_entries?
[email protected]c77ea362010-01-29 22:02:36111 CommandBuffer::State state = command_buffer_->GetState();
[email protected]44096602014-03-26 04:53:58112 entries_ = static_cast<CommandBufferEntry*>(ring_buffer_->memory());
[email protected]503b3a22011-12-12 23:29:40113 int32 num_ring_buffer_entries =
114 ring_buffer_size_ / sizeof(CommandBufferEntry);
[email protected]b21265f2010-05-12 17:05:13115 if (num_ring_buffer_entries > state.num_entries) {
[email protected]c4488402012-01-11 01:05:49116 ClearUsable();
[email protected]b21265f2010-05-12 17:05:13117 return false;
118 }
[email protected]9310b262010-06-03 16:15:47119
[email protected]9310b262010-06-03 16:15:47120 total_entry_count_ = num_ring_buffer_entries;
[email protected]c77ea362010-01-29 22:02:36121 put_ = state.put_offset;
[email protected]15691b42014-02-12 00:56:00122 CalcImmediateEntries(0);
[email protected]96449d2c2009-11-25 00:01:32123 return true;
124}
125
[email protected]a5cf3cb2012-08-23 01:08:42126void CommandBufferHelper::FreeResources() {
[email protected]617296e2011-12-15 05:37:57127 if (HaveRingBuffer()) {
128 command_buffer_->DestroyTransferBuffer(ring_buffer_id_);
129 ring_buffer_id_ = -1;
[email protected]15691b42014-02-12 00:56:00130 CalcImmediateEntries(0);
[email protected]617296e2011-12-15 05:37:57131 }
132}
133
[email protected]a5cf3cb2012-08-23 01:08:42134void CommandBufferHelper::FreeRingBuffer() {
[email protected]cf1aa982013-11-05 21:49:37135 CHECK((put_ == get_offset()) ||
[email protected]ea51dbd2013-01-18 10:03:53136 error::IsError(command_buffer_->GetLastState().error));
[email protected]a5cf3cb2012-08-23 01:08:42137 FreeResources();
138}
139
[email protected]503b3a22011-12-12 23:29:40140bool CommandBufferHelper::Initialize(int32 ring_buffer_size) {
141 ring_buffer_size_ = ring_buffer_size;
142 return AllocateRingBuffer();
143}
144
[email protected]96449d2c2009-11-25 00:01:32145CommandBufferHelper::~CommandBufferHelper() {
[email protected]a5cf3cb2012-08-23 01:08:42146 FreeResources();
[email protected]96449d2c2009-11-25 00:01:32147}
148
[email protected]7fe4198b2014-03-18 21:52:36149bool CommandBufferHelper::WaitForGetOffsetInRange(int32 start, int32 end) {
[email protected]c4488402012-01-11 01:05:49150 if (!usable()) {
151 return false;
152 }
[email protected]7fe4198b2014-03-18 21:52:36153 command_buffer_->WaitForGetOffsetInRange(start, end);
154 return command_buffer_->GetLastError() == gpu::error::kNoError;
[email protected]96449d2c2009-11-25 00:01:32155}
156
[email protected]7d5b8d12011-01-14 23:43:15157void CommandBufferHelper::Flush() {
[email protected]15691b42014-02-12 00:56:00158 // Wrap put_ before flush.
159 if (put_ == total_entry_count_)
160 put_ = 0;
161
[email protected]9f5ab392013-01-30 12:47:13162 if (usable() && last_put_sent_ != put_) {
[email protected]c4488402012-01-11 01:05:49163 last_flush_time_ = clock();
164 last_put_sent_ = put_;
165 command_buffer_->Flush(put_);
[email protected]cbe0ded2014-02-21 20:42:52166 ++flush_generation_;
[email protected]15691b42014-02-12 00:56:00167 CalcImmediateEntries(0);
[email protected]c4488402012-01-11 01:05:49168 }
[email protected]7d5b8d12011-01-14 23:43:15169}
170
[email protected]15691b42014-02-12 00:56:00171#if defined(CMD_HELPER_PERIODIC_FLUSH_CHECK)
172void CommandBufferHelper::PeriodicFlushCheck() {
173 clock_t current_time = clock();
174 if (current_time - last_flush_time_ > kPeriodicFlushDelay * CLOCKS_PER_SEC)
175 Flush();
176}
177#endif
178
[email protected]96449d2c2009-11-25 00:01:32179// Calls Flush() and then waits until the buffer is empty. Break early if the
180// error is set.
181bool CommandBufferHelper::Finish() {
[email protected]366ae242011-05-10 02:23:58182 TRACE_EVENT0("gpu", "CommandBufferHelper::Finish");
[email protected]c4488402012-01-11 01:05:49183 if (!usable()) {
184 return false;
185 }
[email protected]a24e7582012-02-15 23:21:32186 // If there is no work just exit.
187 if (put_ == get_offset()) {
188 return true;
189 }
[email protected]cf1aa982013-11-05 21:49:37190 DCHECK(HaveRingBuffer());
[email protected]7fe4198b2014-03-18 21:52:36191 Flush();
192 if (!WaitForGetOffsetInRange(put_, put_))
193 return false;
194 DCHECK_EQ(get_offset(), put_);
195
196 CalcImmediateEntries(0);
[email protected]96449d2c2009-11-25 00:01:32197
198 return true;
199}
200
201// Inserts a new token into the command stream. It uses an increasing value
202// scheme so that we don't lose tokens (a token has passed if the current token
203// value is higher than that token). Calls Finish() if the token value wraps,
204// which will be rare.
205int32 CommandBufferHelper::InsertToken() {
[email protected]617296e2011-12-15 05:37:57206 AllocateRingBuffer();
[email protected]c4488402012-01-11 01:05:49207 if (!usable()) {
208 return token_;
209 }
[email protected]cf1aa982013-11-05 21:49:37210 DCHECK(HaveRingBuffer());
[email protected]96449d2c2009-11-25 00:01:32211 // Increment token as 31-bit integer. Negative values are used to signal an
212 // error.
213 token_ = (token_ + 1) & 0x7FFFFFFF;
[email protected]c4488402012-01-11 01:05:49214 cmd::SetToken* cmd = GetCmdSpace<cmd::SetToken>();
215 if (cmd) {
216 cmd->Init(token_);
217 if (token_ == 0) {
218 TRACE_EVENT0("gpu", "CommandBufferHelper::InsertToken(wrapped)");
219 // we wrapped
220 Finish();
[email protected]cf1aa982013-11-05 21:49:37221 DCHECK_EQ(token_, last_token_read());
[email protected]c4488402012-01-11 01:05:49222 }
[email protected]96449d2c2009-11-25 00:01:32223 }
224 return token_;
225}
226
227// Waits until the current token value is greater or equal to the value passed
228// in argument.
229void CommandBufferHelper::WaitForToken(int32 token) {
[email protected]ea51dbd2013-01-18 10:03:53230 if (!usable() || !HaveRingBuffer()) {
[email protected]c4488402012-01-11 01:05:49231 return;
232 }
[email protected]96449d2c2009-11-25 00:01:32233 // Return immediately if corresponding InsertToken failed.
234 if (token < 0)
235 return;
[email protected]96449d2c2009-11-25 00:01:32236 if (token > token_) return; // we wrapped
[email protected]7fe4198b2014-03-18 21:52:36237 if (last_token_read() > token)
238 return;
239 Flush();
240 command_buffer_->WaitForTokenInRange(token, token_);
[email protected]96449d2c2009-11-25 00:01:32241}
242
243// Waits for available entries, basically waiting until get >= put + count + 1.
244// It actually waits for contiguous entries, so it may need to wrap the buffer
[email protected]47257372013-01-04 18:37:48245// around, adding a noops. Thus this function may change the value of put_. The
[email protected]9310b262010-06-03 16:15:47246// function will return early if an error occurs, in which case the available
247// space may not be available.
[email protected]3110b122013-11-19 23:25:54248void CommandBufferHelper::WaitForAvailableEntries(int32 count) {
249 AllocateRingBuffer();
250 if (!usable()) {
251 return;
252 }
253 DCHECK(HaveRingBuffer());
[email protected]cf1aa982013-11-05 21:49:37254 DCHECK(count < total_entry_count_);
[email protected]47257372013-01-04 18:37:48255 if (put_ + count > total_entry_count_) {
[email protected]96449d2c2009-11-25 00:01:32256 // There's not enough room between the current put and the end of the
[email protected]47257372013-01-04 18:37:48257 // buffer, so we need to wrap. We will add noops all the way to the end,
258 // but we need to make sure get wraps first, actually that get is 1 or
259 // more (since put will wrap to 0 after we add the noops).
[email protected]cf1aa982013-11-05 21:49:37260 DCHECK_LE(1, put_);
[email protected]15691b42014-02-12 00:56:00261 int32 curr_get = get_offset();
262 if (curr_get > put_ || curr_get == 0) {
[email protected]366ae242011-05-10 02:23:58263 TRACE_EVENT0("gpu", "CommandBufferHelper::WaitForAvailableEntries");
[email protected]7fe4198b2014-03-18 21:52:36264 Flush();
265 if (!WaitForGetOffsetInRange(1, put_))
266 return;
267 curr_get = get_offset();
268 DCHECK_LE(curr_get, put_);
269 DCHECK_NE(0, curr_get);
[email protected]96449d2c2009-11-25 00:01:32270 }
[email protected]47257372013-01-04 18:37:48271 // Insert Noops to fill out the buffer.
272 int32 num_entries = total_entry_count_ - put_;
273 while (num_entries > 0) {
274 int32 num_to_skip = std::min(CommandHeader::kMaxSize, num_entries);
275 cmd::Noop::Set(&entries_[put_], num_to_skip);
276 put_ += num_to_skip;
277 num_entries -= num_to_skip;
278 }
[email protected]96449d2c2009-11-25 00:01:32279 put_ = 0;
280 }
[email protected]15691b42014-02-12 00:56:00281
282 // Try to get 'count' entries without flushing.
283 CalcImmediateEntries(count);
284 if (immediate_entry_count_ < count) {
285 // Try again with a shallow Flush().
[email protected]3110b122013-11-19 23:25:54286 Flush();
[email protected]15691b42014-02-12 00:56:00287 CalcImmediateEntries(count);
288 if (immediate_entry_count_ < count) {
289 // Buffer is full. Need to wait for entries.
290 TRACE_EVENT0("gpu", "CommandBufferHelper::WaitForAvailableEntries1");
[email protected]7fe4198b2014-03-18 21:52:36291 if (!WaitForGetOffsetInRange(put_ + count + 1, put_))
292 return;
293 CalcImmediateEntries(count);
294 DCHECK_GE(immediate_entry_count_, count);
[email protected]15691b42014-02-12 00:56:00295 }
[email protected]3110b122013-11-19 23:25:54296 }
[email protected]96449d2c2009-11-25 00:01:32297}
298
[email protected]96449d2c2009-11-25 00:01:32299
[email protected]a7a27ace2009-12-12 00:11:25300} // namespace gpu