OLD | NEW |
---|---|
(Empty) | |
1 /* | |
2 * Copyright 2015 Google Inc. | |
3 * | |
4 * Use of this source code is governed by a BSD-style license that can be | |
5 * found in the LICENSE file. | |
6 */ | |
7 | |
8 #include "SkRWBuffer.h" | |
9 #include "SkStream.h" | |
10 | |
11 // Force small chunks to be a page's worth | |
12 static const size_t kMinAllocSize = 4096; | |
13 | |
14 struct SkBufferBlock { | |
15 SkBufferBlock* fNext; | |
16 size_t fUsed; | |
17 size_t fCapacity; | |
18 | |
19 const void* startData() const { return this + 1; }; | |
20 | |
21 size_t avail() const { return fCapacity - fUsed; } | |
22 void* availData() { return (char*)this->startData() + fUsed; } | |
23 | |
24 static SkBufferBlock* Alloc(size_t length) { | |
25 size_t capacity = LengthToCapacity(length); | |
26 SkBufferBlock* block = (SkBufferBlock*)sk_malloc_throw(sizeof(SkBufferBl ock) + capacity); | |
27 block->fNext = NULL; | |
28 block->fUsed = 0; | |
29 block->fCapacity = capacity; | |
30 return block; | |
31 } | |
32 | |
33 // Return number of bytes actually appended | |
34 size_t append(const void* src, size_t length) { | |
35 this->validate(); | |
36 size_t amount = SkTMin(this->avail(), length); | |
37 memcpy(this->availData(), src, amount); | |
38 fUsed += amount; | |
39 this->validate(); | |
40 return amount; | |
41 } | |
42 | |
43 void validate() const { | |
44 #ifdef SK_DEBUG | |
45 SkASSERT(fCapacity > 0); | |
46 SkASSERT(fUsed <= fCapacity); | |
47 #endif | |
48 } | |
49 | |
50 private: | |
51 static size_t LengthToCapacity(size_t length) { | |
52 const size_t minSize = kMinAllocSize - sizeof(SkBufferBlock); | |
53 return SkTMax(length, minSize); | |
54 } | |
55 }; | |
56 | |
57 struct SkBufferHead { | |
58 mutable int32_t fRefCnt; | |
59 SkBufferBlock fBlock; | |
60 | |
61 static size_t LengthToCapacity(size_t length) { | |
scroggo
2015/04/28 17:27:39
Could be private?
reed2
2015/04/29 00:43:49
Possibly, tho this struct is private just to this
| |
62 const size_t minSize = kMinAllocSize - sizeof(SkBufferHead); | |
63 return SkTMax(length, minSize); | |
64 } | |
65 | |
66 static SkBufferHead* Alloc(size_t length) { | |
67 size_t capacity = LengthToCapacity(length); | |
68 size_t size = sizeof(SkBufferHead) + capacity; | |
69 SkBufferHead* head = (SkBufferHead*)sk_malloc_throw(size); | |
70 head->fRefCnt = 1; | |
71 head->fBlock.fNext = NULL; | |
72 head->fBlock.fUsed = 0; | |
73 head->fBlock.fCapacity = capacity; | |
74 return head; | |
75 } | |
76 | |
77 void ref() const { | |
78 SkASSERT(fRefCnt > 0); | |
79 sk_atomic_inc(&fRefCnt); | |
80 } | |
81 | |
82 void unref() const { | |
83 SkASSERT(fRefCnt > 0); | |
84 // A release here acts in place of all releases we "should" have been do ing in ref(). | |
85 if (1 == sk_atomic_fetch_add(&fRefCnt, -1, sk_memory_order_acq_rel)) { | |
scroggo
2015/04/28 17:27:39
It would be nice to share this code with the other
reed2
2015/04/29 00:43:49
Agreed, but I haven't seen how to do that sharing
| |
86 // Like unique(), the acquire is only needed on success. | |
87 SkBufferBlock* block = fBlock.fNext; | |
88 sk_free((void*)this); | |
89 while (block) { | |
90 SkBufferBlock* next = block->fNext; | |
91 sk_free(block); | |
92 block = next; | |
93 } | |
94 SkDebugf("done\n"); | |
scroggo
2015/04/28 17:27:39
Do you want to check this in?
reed2
2015/04/29 00:43:49
Doh! Removed.
| |
95 } | |
96 } | |
97 | |
98 void validate(size_t minUsed, SkBufferBlock* tail = NULL) const { | |
99 #ifdef SK_DEBUG | |
100 SkASSERT(fRefCnt > 0); | |
101 size_t totalUsed = 0; | |
102 const SkBufferBlock* block = &fBlock; | |
103 const SkBufferBlock* lastBlock = block; | |
104 while (block) { | |
105 block->validate(); | |
106 totalUsed += block->fUsed; | |
107 lastBlock = block; | |
108 block = block->fNext; | |
109 } | |
110 SkASSERT(minUsed <= totalUsed); | |
111 if (tail) { | |
112 SkASSERT(tail == lastBlock); | |
113 } | |
114 #endif | |
115 } | |
116 }; | |
117 | |
118 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t used) : fHead(SkRef(head )), fUsed(used) { | |
scroggo
2015/04/28 17:27:39
This should be SkSafeRef(head), since head may be
reed2
2015/04/29 00:43:49
Done.
| |
119 if (head) { | |
120 SkASSERT(used > 0); | |
121 head->validate(used); | |
122 } else { | |
123 SkASSERT(0 == used); | |
124 } | |
125 } | |
126 | |
127 SkROBuffer::~SkROBuffer() { | |
128 if (fHead) { | |
129 fHead->validate(fUsed); | |
130 fHead->unref(); | |
131 } | |
132 } | |
133 | |
134 SkROBuffer::Iter::Iter(const SkROBuffer* buffer) { | |
135 this->reset(buffer); | |
136 } | |
137 | |
138 void SkROBuffer::Iter::reset(const SkROBuffer* buffer) { | |
139 if (buffer) { | |
140 fBlock = &buffer->fHead->fBlock; | |
141 fRemaining = buffer->fUsed; | |
142 } else { | |
143 fBlock = NULL; | |
144 fRemaining = 0; | |
145 } | |
146 } | |
147 | |
148 const void* SkROBuffer::Iter::data() const { | |
149 return fRemaining ? fBlock->startData() : NULL; | |
150 } | |
151 | |
152 size_t SkROBuffer::Iter::size() const { | |
153 return SkTMin(fBlock->fUsed, fRemaining); | |
154 } | |
155 | |
156 bool SkROBuffer::Iter::next() { | |
157 if (fRemaining) { | |
158 fRemaining -= this->size(); | |
159 fBlock = fBlock->fNext; | |
160 } | |
161 return fRemaining != 0; | |
162 } | |
163 | |
164 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(NULL), fTail(NULL), fTota lUsed(0) {} | |
165 | |
166 SkRWBuffer::~SkRWBuffer() { | |
167 this->validate(); | |
168 fHead->unref(); | |
169 } | |
170 | |
171 void SkRWBuffer::append(const void* src, size_t length) { | |
172 this->validate(); | |
173 if (0 == length) { | |
174 return; | |
175 } | |
176 | |
177 fTotalUsed += length; | |
178 | |
179 if (NULL == fHead) { | |
180 fHead = SkBufferHead::Alloc(length); | |
181 fTail = &fHead->fBlock; | |
182 } | |
183 | |
184 size_t written = fTail->append(src, length); | |
185 SkASSERT(written <= length); | |
186 src = (const char*)src + written; | |
187 length -= written; | |
188 | |
189 if (length) { | |
190 SkBufferBlock* block = SkBufferBlock::Alloc(length); | |
191 fTail->fNext = block; | |
192 fTail = block; | |
193 written = fTail->append(src, length); | |
194 SkASSERT(written == length); | |
195 } | |
196 this->validate(); | |
197 } | |
198 | |
199 void* SkRWBuffer::append(size_t length) { | |
200 this->validate(); | |
201 if (0 == length) { | |
202 return NULL; | |
203 } | |
204 | |
205 fTotalUsed += length; | |
206 | |
207 if (NULL == fHead) { | |
208 fHead = SkBufferHead::Alloc(length); | |
209 fTail = &fHead->fBlock; | |
210 } else if (fTail->avail() < length) { | |
211 SkBufferBlock* block = SkBufferBlock::Alloc(length); | |
212 fTail->fNext = block; | |
213 fTail = block; | |
214 } | |
215 | |
216 fTail->fUsed += length; | |
217 this->validate(); | |
218 return (char*)fTail->availData() - length; | |
219 } | |
220 | |
221 #ifdef SK_DEBUG | |
222 void SkRWBuffer::validate() const { | |
223 if (fHead) { | |
224 fHead->validate(fTotalUsed, fTail); | |
225 } else { | |
226 SkASSERT(NULL == fTail); | |
227 SkASSERT(0 == fTotalUsed); | |
228 } | |
229 } | |
230 #endif | |
231 | |
232 SkROBuffer* SkRWBuffer::newRBufferSnapshot() const { | |
233 return SkNEW_ARGS(SkROBuffer, (fHead, fTotalUsed)); | |
234 } | |
235 | |
236 //////////////////////////////////////////////////////////////////////////////// /////////////////// | |
237 | |
238 class SkROBufferStreamAsset : public SkStreamAsset { | |
239 void validate() const { | |
240 #ifdef SK_DEBUG | |
241 SkASSERT(fGlobalOffset <= fBuffer->size()); | |
242 SkASSERT(fLocalOffset <= fIter.size()); | |
243 SkASSERT(fLocalOffset <= fGlobalOffset); | |
244 #endif | |
245 } | |
246 | |
247 class AutoValidate { | |
scroggo
2015/04/28 17:27:39
Only needed in SK_DEBUG?
reed2
2015/04/29 00:43:49
Done.
| |
248 SkROBufferStreamAsset* fStream; | |
249 public: | |
250 AutoValidate(SkROBufferStreamAsset* stream) : fStream(stream) { stream-> validate(); } | |
251 ~AutoValidate() { fStream->validate(); } | |
252 }; | |
253 | |
254 #ifdef SK_DEBUG | |
255 #define AUTO_VALIDATE AutoValidate av(this); | |
256 #else | |
257 #define AUTO_VALIDATE | |
258 #endif | |
259 | |
260 public: | |
261 SkROBufferStreamAsset(const SkROBuffer* buffer) : fBuffer(SkRef(buffer)), fI ter(buffer) { | |
262 fGlobalOffset = fLocalOffset = 0; | |
263 } | |
264 | |
265 virtual ~SkROBufferStreamAsset() { fBuffer->unref(); } | |
266 | |
267 size_t getLength() const override { return fBuffer->size(); } | |
268 | |
269 bool rewind() override { | |
270 AUTO_VALIDATE | |
271 fIter.reset(fBuffer); | |
272 fGlobalOffset = fLocalOffset = 0; | |
273 return true; | |
274 } | |
275 | |
276 size_t read(void* dst, size_t request) override { | |
277 AUTO_VALIDATE | |
278 size_t bytesRead = 0; | |
279 for (;;) { | |
280 size_t size = fIter.size(); | |
scroggo
2015/04/28 17:27:39
const?
| |
281 SkASSERT(fLocalOffset <= size); | |
282 size_t avail = SkTMin(size - fLocalOffset, request - bytesRead); | |
scroggo
2015/04/28 17:27:39
const?
| |
283 if (dst) { | |
284 memcpy(dst, (const char*)fIter.data() + fLocalOffset, avail); | |
285 dst = (char*)dst + avail; | |
286 } | |
287 bytesRead += avail; | |
288 fLocalOffset += avail; | |
289 SkASSERT(bytesRead <= request); | |
290 if (bytesRead == request) { | |
291 break; | |
292 } | |
293 // If we get here, we've exhausted the current iter | |
294 SkASSERT(fLocalOffset == size); | |
295 fLocalOffset = 0; | |
296 if (!fIter.next()) { | |
297 break; // ran out of data | |
298 } | |
299 } | |
300 fGlobalOffset += bytesRead; | |
301 SkASSERT(fGlobalOffset <= fBuffer->size()); | |
302 return bytesRead; | |
303 } | |
304 | |
305 bool isAtEnd() const override { | |
306 return fBuffer->size() == fGlobalOffset; | |
307 } | |
308 | |
309 SkStreamAsset* duplicate() const override { | |
310 return SkNEW_ARGS(SkROBufferStreamAsset, (fBuffer)); | |
311 } | |
312 | |
313 size_t getPosition() const { | |
314 return fGlobalOffset; | |
315 } | |
316 | |
317 bool seek(size_t position) { | |
318 AUTO_VALIDATE | |
319 if (position < fGlobalOffset) { | |
320 this->rewind(); | |
321 } | |
322 (void)this->skip(position - fGlobalOffset); | |
323 return true; | |
324 } | |
325 | |
326 bool move(long offset) { | |
327 AUTO_VALIDATE | |
328 offset += fGlobalOffset; | |
329 if (offset <= 0) { | |
330 this->rewind(); | |
331 } else { | |
332 (void)this->seek(SkToSizeT(offset)); | |
333 } | |
334 return true; | |
335 } | |
336 | |
337 SkStreamAsset* fork() const override { | |
338 SkStreamAsset* clone = this->duplicate(); | |
339 clone->seek(this->getPosition()); | |
340 return clone; | |
341 } | |
342 | |
343 | |
344 private: | |
345 const SkROBuffer* fBuffer; | |
346 SkROBuffer::Iter fIter; | |
347 size_t fLocalOffset; | |
348 size_t fGlobalOffset; | |
349 }; | |
350 | |
351 SkStreamAsset* SkRWBuffer::newStreamSnapshot() const { | |
352 SkAutoTUnref<SkROBuffer> buffer(this->newRBufferSnapshot()); | |
353 return SkNEW_ARGS(SkROBufferStreamAsset, (buffer)); | |
354 } | |
OLD | NEW |