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

Side by Side Diff: src/core/SkRWBuffer.cpp

Issue 1872853002: Fix race condition in SkROBuffer. (Closed) Base URL: https://skia.googlesource.com/skia.git@master
Patch Set: Created 4 years, 8 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
« no previous file with comments | « include/core/SkRWBuffer.h ('k') | tests/DataRefTest.cpp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 /* 1 /*
2 * Copyright 2015 Google Inc. 2 * Copyright 2015 Google Inc.
3 * 3 *
4 * Use of this source code is governed by a BSD-style license that can be 4 * Use of this source code is governed by a BSD-style license that can be
5 * found in the LICENSE file. 5 * found in the LICENSE file.
6 */ 6 */
7 7
8 #include "SkRWBuffer.h" 8 #include "SkRWBuffer.h"
9 #include "SkStream.h" 9 #include "SkStream.h"
10 10
11 // Force small chunks to be a page's worth 11 // Force small chunks to be a page's worth
12 static const size_t kMinAllocSize = 4096; 12 static const size_t kMinAllocSize = 4096;
13 13
14 struct SkBufferBlock { 14 struct SkBufferBlock {
15 SkBufferBlock* fNext; 15 SkBufferBlock* fNext; // updated by the writer
16 size_t fUsed; 16 size_t fUsed; // updated by the writer
17 size_t fCapacity; 17 size_t fCapacity; // never changes after the block is created
scroggo 2016/04/08 18:18:52 const? I guess we need a constructor to do that...
bungeman-skia 2016/04/08 18:39:29 It would actually be nice to write a private const
reed1 2016/04/08 19:18:11 Done.
18 18
19 const void* startData() const { return this + 1; }; 19 const void* startData() const { return this + 1; };
20 20
21 size_t avail() const { return fCapacity - fUsed; } 21 size_t avail() const { return fCapacity - fUsed; }
22 void* availData() { return (char*)this->startData() + fUsed; } 22 void* availData() { return (char*)this->startData() + fUsed; }
23 23
24 static SkBufferBlock* Alloc(size_t length) { 24 static SkBufferBlock* Alloc(size_t length) {
25 size_t capacity = LengthToCapacity(length); 25 size_t capacity = LengthToCapacity(length);
26 SkBufferBlock* block = (SkBufferBlock*)sk_malloc_throw(sizeof(SkBufferBl ock) + capacity); 26 SkBufferBlock* block = (SkBufferBlock*)sk_malloc_throw(sizeof(SkBufferBl ock) + capacity);
27 block->fNext = nullptr; 27 block->fNext = nullptr;
28 block->fUsed = 0; 28 block->fUsed = 0;
29 block->fCapacity = capacity; 29 block->fCapacity = capacity;
30 return block; 30 return block;
31 } 31 }
32 32
33 // Return number of bytes actually appended 33 // Return number of bytes actually appended. Important that we always comple tely this block
34 // before spilling into the next, since the reader uses fCapacity to know ho w many it can read.
35 //
34 size_t append(const void* src, size_t length) { 36 size_t append(const void* src, size_t length) {
35 this->validate(); 37 this->validate();
36 size_t amount = SkTMin(this->avail(), length); 38 size_t amount = SkTMin(this->avail(), length);
37 memcpy(this->availData(), src, amount); 39 memcpy(this->availData(), src, amount);
38 fUsed += amount; 40 fUsed += amount;
39 this->validate(); 41 this->validate();
40 return amount; 42 return amount;
41 } 43 }
42 44
43 void validate() const { 45 void validate() const {
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after
107 block = block->fNext; 109 block = block->fNext;
108 } 110 }
109 SkASSERT(minUsed <= totalUsed); 111 SkASSERT(minUsed <= totalUsed);
110 if (tail) { 112 if (tail) {
111 SkASSERT(tail == lastBlock); 113 SkASSERT(tail == lastBlock);
112 } 114 }
113 #endif 115 #endif
114 } 116 }
115 }; 117 };
116 118
117 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t used) : fHead(head), fUs ed(used) { 119 //////////////////////////////////////////////////////////////////////////////// ///////////////////
120 // The reader can only access block.fCapacity (which never changes), and cannot access
121 // block.fUsed, which may be updated by the writer.
122 //
123 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t available)
124 : fHead(head), fAvailable(available)
125 {
118 if (head) { 126 if (head) {
119 fHead->ref(); 127 fHead->ref();
120 SkASSERT(used > 0); 128 SkASSERT(available > 0);
121 head->validate(used); 129 head->validate(available);
122 } else { 130 } else {
123 SkASSERT(0 == used); 131 SkASSERT(0 == available);
124 } 132 }
125 } 133 }
126 134
127 SkROBuffer::~SkROBuffer() { 135 SkROBuffer::~SkROBuffer() {
128 if (fHead) { 136 if (fHead) {
129 fHead->validate(fUsed); 137 fHead->validate(fAvailable);
130 fHead->unref(); 138 fHead->unref();
131 } 139 }
132 } 140 }
133 141
134 SkROBuffer::Iter::Iter(const SkROBuffer* buffer) { 142 SkROBuffer::Iter::Iter(const SkROBuffer* buffer) {
135 this->reset(buffer); 143 this->reset(buffer);
136 } 144 }
137 145
138 void SkROBuffer::Iter::reset(const SkROBuffer* buffer) { 146 void SkROBuffer::Iter::reset(const SkROBuffer* buffer) {
139 if (buffer) { 147 if (buffer) {
140 fBlock = &buffer->fHead->fBlock; 148 fBlock = &buffer->fHead->fBlock;
141 fRemaining = buffer->fUsed; 149 fRemaining = buffer->fAvailable;
142 } else { 150 } else {
143 fBlock = nullptr; 151 fBlock = nullptr;
144 fRemaining = 0; 152 fRemaining = 0;
145 } 153 }
146 } 154 }
147 155
148 const void* SkROBuffer::Iter::data() const { 156 const void* SkROBuffer::Iter::data() const {
149 return fRemaining ? fBlock->startData() : nullptr; 157 return fRemaining ? fBlock->startData() : nullptr;
150 } 158 }
151 159
152 size_t SkROBuffer::Iter::size() const { 160 size_t SkROBuffer::Iter::size() const {
153 if (!fBlock) { 161 if (!fBlock) {
154 return 0; 162 return 0;
155 } 163 }
156 return SkTMin(fBlock->fUsed, fRemaining); 164 return SkTMin(fBlock->fCapacity, fRemaining);
157 } 165 }
158 166
159 bool SkROBuffer::Iter::next() { 167 bool SkROBuffer::Iter::next() {
160 if (fRemaining) { 168 if (fRemaining) {
161 fRemaining -= this->size(); 169 fRemaining -= this->size();
162 fBlock = fBlock->fNext; 170 fBlock = fBlock->fNext;
163 } 171 }
164 return fRemaining != 0; 172 return fRemaining != 0;
165 } 173 }
166 174
175 //////////////////////////////////////////////////////////////////////////////// ///////////////////
176
167 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {} 177 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {}
168 178
169 SkRWBuffer::~SkRWBuffer() { 179 SkRWBuffer::~SkRWBuffer() {
170 this->validate(); 180 this->validate();
171 if (fHead) { 181 if (fHead) {
172 fHead->unref(); 182 fHead->unref();
173 } 183 }
174 } 184 }
175 185
186 // It is important that we always completely fill the current block before spill ing over to the
187 // next, since our reader will be using fCapacity (min'd against its total avail able) to know how
188 // many bytes to read from a given block.
189 //
176 void SkRWBuffer::append(const void* src, size_t length) { 190 void SkRWBuffer::append(const void* src, size_t length) {
177 this->validate(); 191 this->validate();
178 if (0 == length) { 192 if (0 == length) {
179 return; 193 return;
180 } 194 }
181 195
182 fTotalUsed += length; 196 fTotalUsed += length;
183 197
184 if (nullptr == fHead) { 198 if (nullptr == fHead) {
185 fHead = SkBufferHead::Alloc(length); 199 fHead = SkBufferHead::Alloc(length);
186 fTail = &fHead->fBlock; 200 fTail = &fHead->fBlock;
187 } 201 }
188 202
189 size_t written = fTail->append(src, length); 203 size_t written = fTail->append(src, length);
190 SkASSERT(written <= length); 204 SkASSERT(written <= length);
191 src = (const char*)src + written; 205 src = (const char*)src + written;
192 length -= written; 206 length -= written;
193 207
194 if (length) { 208 if (length) {
195 SkBufferBlock* block = SkBufferBlock::Alloc(length); 209 SkBufferBlock* block = SkBufferBlock::Alloc(length);
196 fTail->fNext = block; 210 fTail->fNext = block;
197 fTail = block; 211 fTail = block;
198 written = fTail->append(src, length); 212 written = fTail->append(src, length);
199 SkASSERT(written == length); 213 SkASSERT(written == length);
200 } 214 }
201 this->validate(); 215 this->validate();
202 } 216 }
203 217
204 void* SkRWBuffer::append(size_t length) {
205 this->validate();
206 if (0 == length) {
207 return nullptr;
208 }
209
210 fTotalUsed += length;
211
212 if (nullptr == fHead) {
213 fHead = SkBufferHead::Alloc(length);
214 fTail = &fHead->fBlock;
215 } else if (fTail->avail() < length) {
216 SkBufferBlock* block = SkBufferBlock::Alloc(length);
217 fTail->fNext = block;
218 fTail = block;
219 }
220
221 fTail->fUsed += length;
222 this->validate();
223 return (char*)fTail->availData() - length;
224 }
225
226 #ifdef SK_DEBUG 218 #ifdef SK_DEBUG
227 void SkRWBuffer::validate() const { 219 void SkRWBuffer::validate() const {
228 if (fHead) { 220 if (fHead) {
229 fHead->validate(fTotalUsed, fTail); 221 fHead->validate(fTotalUsed, fTail);
230 } else { 222 } else {
231 SkASSERT(nullptr == fTail); 223 SkASSERT(nullptr == fTail);
232 SkASSERT(0 == fTotalUsed); 224 SkASSERT(0 == fTotalUsed);
233 } 225 }
234 } 226 }
235 #endif 227 #endif
(...skipping 109 matching lines...) Expand 10 before | Expand all | Expand 10 after
345 const SkROBuffer* fBuffer; 337 const SkROBuffer* fBuffer;
346 SkROBuffer::Iter fIter; 338 SkROBuffer::Iter fIter;
347 size_t fLocalOffset; 339 size_t fLocalOffset;
348 size_t fGlobalOffset; 340 size_t fGlobalOffset;
349 }; 341 };
350 342
351 SkStreamAsset* SkRWBuffer::newStreamSnapshot() const { 343 SkStreamAsset* SkRWBuffer::newStreamSnapshot() const {
352 SkAutoTUnref<SkROBuffer> buffer(this->newRBufferSnapshot()); 344 SkAutoTUnref<SkROBuffer> buffer(this->newRBufferSnapshot());
353 return new SkROBufferStreamAsset(buffer); 345 return new SkROBufferStreamAsset(buffer);
354 } 346 }
OLDNEW
« no previous file with comments | « include/core/SkRWBuffer.h ('k') | tests/DataRefTest.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698