1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
|
/*
* Copyright 2010 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#ifndef GrAllocator_DEFINED
#define GrAllocator_DEFINED
#include "GrConfig.h"
#include "GrTypes.h"
#include "SkTArray.h"
#include "SkTypes.h"
class GrAllocator : SkNoncopyable {
public:
~GrAllocator() { this->reset(); }
/**
* Create an allocator
*
* @param itemSize the size of each item to allocate
* @param itemsPerBlock the number of items to allocate at once
* @param initialBlock optional memory to use for the first block.
* Must be at least itemSize*itemsPerBlock sized.
* Caller is responsible for freeing this memory.
*/
GrAllocator(size_t itemSize, int itemsPerBlock, void* initialBlock)
: fItemSize(itemSize)
, fItemsPerBlock(itemsPerBlock)
, fOwnFirstBlock(nullptr == initialBlock)
, fCount(0)
, fInsertionIndexInBlock(0) {
SkASSERT(itemsPerBlock > 0);
fBlockSize = fItemSize * fItemsPerBlock;
if (fOwnFirstBlock) {
// This force us to allocate a new block on push_back().
fInsertionIndexInBlock = fItemsPerBlock;
} else {
fBlocks.push_back() = initialBlock;
fInsertionIndexInBlock = 0;
}
}
/**
* Adds an item and returns pointer to it.
*
* @return pointer to the added item.
*/
void* push_back() {
// we always have at least one block
if (fItemsPerBlock == fInsertionIndexInBlock) {
fBlocks.push_back() = sk_malloc_throw(fBlockSize);
fInsertionIndexInBlock = 0;
}
void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
++fCount;
++fInsertionIndexInBlock;
return ret;
}
/**
* Remove the last item, only call if count() != 0
*/
void pop_back() {
SkASSERT(fCount);
SkASSERT(fInsertionIndexInBlock > 0);
--fInsertionIndexInBlock;
--fCount;
if (0 == fInsertionIndexInBlock) {
// Never delete the first block
if (fBlocks.count() > 1) {
sk_free(fBlocks.back());
fBlocks.pop_back();
fInsertionIndexInBlock = fItemsPerBlock;
}
}
}
/**
* Removes all added items.
*/
void reset() {
int firstBlockToFree = fOwnFirstBlock ? 0 : 1;
for (int i = firstBlockToFree; i < fBlocks.count(); ++i) {
sk_free(fBlocks[i]);
}
if (fOwnFirstBlock) {
fBlocks.reset();
// This force us to allocate a new block on push_back().
fInsertionIndexInBlock = fItemsPerBlock;
} else {
fBlocks.pop_back_n(fBlocks.count() - 1);
fInsertionIndexInBlock = 0;
}
fCount = 0;
}
/**
* Returns the item count.
*/
int count() const {
return fCount;
}
/**
* Is the count 0?
*/
bool empty() const { return 0 == fCount; }
/**
* Access last item, only call if count() != 0
*/
void* back() {
SkASSERT(fCount);
SkASSERT(fInsertionIndexInBlock > 0);
return (char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
}
/**
* Access last item, only call if count() != 0
*/
const void* back() const {
SkASSERT(fCount);
SkASSERT(fInsertionIndexInBlock > 0);
return (const char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
}
/**
* Iterates through the allocator. This is faster than using operator[] when walking linearly
* through the allocator.
*/
class Iter {
public:
/**
* Initializes the iterator. next() must be called before get().
*/
Iter(const GrAllocator* allocator)
: fAllocator(allocator)
, fBlockIndex(-1)
, fIndexInBlock(allocator->fItemsPerBlock - 1)
, fItemIndex(-1) {}
/**
* Advances the iterator. Iteration is finished when next() returns false.
*/
bool next() {
++fIndexInBlock;
++fItemIndex;
if (fIndexInBlock == fAllocator->fItemsPerBlock) {
++fBlockIndex;
fIndexInBlock = 0;
}
return fItemIndex < fAllocator->fCount;
}
/**
* Gets the current iterator value. Call next() at least once before calling. Don't call
* after next() returns false.
*/
void* get() const {
SkASSERT(fItemIndex >= 0 && fItemIndex < fAllocator->fCount);
return (char*) fAllocator->fBlocks[fBlockIndex] + fIndexInBlock * fAllocator->fItemSize;
}
private:
const GrAllocator* fAllocator;
int fBlockIndex;
int fIndexInBlock;
int fItemIndex;
};
/**
* Access item by index.
*/
void* operator[] (int i) {
SkASSERT(i >= 0 && i < fCount);
return (char*)fBlocks[i / fItemsPerBlock] +
fItemSize * (i % fItemsPerBlock);
}
/**
* Access item by index.
*/
const void* operator[] (int i) const {
SkASSERT(i >= 0 && i < fCount);
return (const char*)fBlocks[i / fItemsPerBlock] +
fItemSize * (i % fItemsPerBlock);
}
protected:
/**
* Set first block of memory to write into. Must be called before any other methods.
* This requires that you have passed nullptr in the constructor.
*
* @param initialBlock optional memory to use for the first block.
* Must be at least itemSize*itemsPerBlock sized.
* Caller is responsible for freeing this memory.
*/
void setInitialBlock(void* initialBlock) {
SkASSERT(0 == fCount);
SkASSERT(0 == fBlocks.count());
SkASSERT(fItemsPerBlock == fInsertionIndexInBlock);
fOwnFirstBlock = false;
fBlocks.push_back() = initialBlock;
fInsertionIndexInBlock = 0;
}
// For access to above function.
template <typename T> friend class GrTAllocator;
private:
static const int NUM_INIT_BLOCK_PTRS = 8;
SkSTArray<NUM_INIT_BLOCK_PTRS, void*, true> fBlocks;
size_t fBlockSize;
size_t fItemSize;
int fItemsPerBlock;
bool fOwnFirstBlock;
int fCount;
int fInsertionIndexInBlock;
typedef SkNoncopyable INHERITED;
};
template <typename T> class GrTAllocator;
template <typename T> void* operator new(size_t, GrTAllocator<T>*);
template <typename T> class GrTAllocator : SkNoncopyable {
public:
virtual ~GrTAllocator() { this->reset(); }
/**
* Create an allocator
*
* @param itemsPerBlock the number of items to allocate at once
*/
explicit GrTAllocator(int itemsPerBlock)
: fAllocator(sizeof(T), itemsPerBlock, nullptr) {}
/**
* Adds an item and returns it.
*
* @return the added item.
*/
T& push_back() {
void* item = fAllocator.push_back();
SkASSERT(item);
new (item) T;
return *(T*)item;
}
T& push_back(const T& t) {
void* item = fAllocator.push_back();
SkASSERT(item);
new (item) T(t);
return *(T*)item;
}
/**
* Remove the last item, only call if count() != 0
*/
void pop_back() {
this->back().~T();
fAllocator.pop_back();
}
/**
* Removes all added items.
*/
void reset() {
int c = fAllocator.count();
for (int i = 0; i < c; ++i) {
((T*)fAllocator[i])->~T();
}
fAllocator.reset();
}
/**
* Returns the item count.
*/
int count() const {
return fAllocator.count();
}
/**
* Is the count 0?
*/
bool empty() const { return fAllocator.empty(); }
/**
* Access last item, only call if count() != 0
*/
T& back() {
return *(T*)fAllocator.back();
}
/**
* Access last item, only call if count() != 0
*/
const T& back() const {
return *(const T*)fAllocator.back();
}
/**
* Iterates through the allocator. This is faster than using operator[] when walking linearly
* through the allocator.
*/
class Iter {
public:
/**
* Initializes the iterator. next() must be called before get() or ops * and ->.
*/
Iter(const GrTAllocator* allocator) : fImpl(&allocator->fAllocator) {}
/**
* Advances the iterator. Iteration is finished when next() returns false.
*/
bool next() { return fImpl.next(); }
/**
* Gets the current iterator value. Call next() at least once before calling. Don't call
* after next() returns false.
*/
T* get() const { return (T*) fImpl.get(); }
/**
* Convenience operators. Same rules for calling apply as get().
*/
T& operator*() const { return *this->get(); }
T* operator->() const { return this->get(); }
private:
GrAllocator::Iter fImpl;
};
/**
* Access item by index.
*/
T& operator[] (int i) {
return *(T*)(fAllocator[i]);
}
/**
* Access item by index.
*/
const T& operator[] (int i) const {
return *(const T*)(fAllocator[i]);
}
protected:
/*
* Set first block of memory to write into. Must be called before any other methods.
*
* @param initialBlock optional memory to use for the first block.
* Must be at least size(T)*itemsPerBlock sized.
* Caller is responsible for freeing this memory.
*/
void setInitialBlock(void* initialBlock) {
fAllocator.setInitialBlock(initialBlock);
}
private:
friend void* operator new<T>(size_t, GrTAllocator*);
GrAllocator fAllocator;
typedef SkNoncopyable INHERITED;
};
template <int N, typename T> class GrSTAllocator : public GrTAllocator<T> {
private:
typedef GrTAllocator<T> INHERITED;
public:
GrSTAllocator() : INHERITED(N) {
this->setInitialBlock(fStorage.get());
}
private:
SkAlignedSTStorage<N, T> fStorage;
};
template <typename T> void* operator new(size_t size, GrTAllocator<T>* allocator) {
return allocator->fAllocator.push_back();
}
// Skia doesn't use C++ exceptions but it may be compiled with them enabled. Having an op delete
// to match the op new silences warnings about missing op delete when a constructor throws an
// exception.
template <typename T> void operator delete(void*, GrTAllocator<T>*) {
SK_ABORT("Invalid Operation");
}
#define GrNEW_APPEND_TO_ALLOCATOR(allocator_ptr, type_name, args) \
new (allocator_ptr) type_name args
#endif
|