| /external/skia/src/core/ |
| SkSinglyLinkedList.h | 17 SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {}
20 SkASSERT(fHead != nullptr || nullptr == fTail);
22 Node* node = fHead;
29 fHead = nullptr;
33 T* front() { return fHead ? &fHead->fData : nullptr; }
34 bool empty() const { return fHead == nullptr; }
38 for (Node* node = fHead; node; node = node->fNext) {
45 if (Node* node = fHead) {
46 fHead = node->fNext
[all...] |
| SkTInternalLList.h | 44 : fHead(nullptr)
49 fHead = nullptr;
54 SkASSERT(fHead && fTail);
63 fHead = next;
84 entry->fNext = fHead;
85 if (fHead) {
86 fHead->fPrev = entry;
88 fHead = entry;
108 if (nullptr == fHead) {
109 fHead = entry
[all...] |
| SkGlyphCache_Globals.h | 33 fHead = nullptr;
42 SkGlyphCache* cache = fHead;
52 SkGlyphCache* internalGetHead() const { return fHead; }
83 SkGlyphCache* fHead;
|
| SkArenaAllocList.h | 25 void reset() { fHead = fTail = nullptr; }
45 Iter begin() { return Iter(fHead); }
56 Node* fHead = nullptr;
63 SkASSERT(!fHead == !fTail);
66 fHead = fTail = n;
|
| SkRWBuffer.cpp | 129 : fHead(head), fAvailable(available), fTail(tail)
132 fHead->ref();
142 if (fHead) {
143 fHead->unref();
157 if (buffer && buffer->fHead) {
158 fBlock = &buffer->fHead->fBlock;
193 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {
195 fHead = SkBufferHead::Alloc(initialCapacity);
196 fTail = &fHead->fBlock;
202 if (fHead) {
[all...] |
| SkResourceCache.cpp | 72 fHead = nullptr;
95 Rec* rec = fHead;
301 SkASSERT(fHead == rec);
302 fHead = next;
317 if (fHead == rec) {
321 SkASSERT(fHead);
328 fHead->fPrev = rec;
329 rec->fNext = fHead;
330 fHead = rec;
339 rec->fNext = fHead;
[all...] |
| /external/skqp/src/core/ |
| SkSinglyLinkedList.h | 17 SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {}
20 SkASSERT(fHead != nullptr || nullptr == fTail);
22 Node* node = fHead;
29 fHead = nullptr;
33 T* front() { return fHead ? &fHead->fData : nullptr; }
34 bool empty() const { return fHead == nullptr; }
38 for (Node* node = fHead; node; node = node->fNext) {
45 if (Node* node = fHead) {
46 fHead = node->fNext
[all...] |
| SkTInternalLList.h | 44 : fHead(nullptr)
49 fHead = nullptr;
54 SkASSERT(fHead && fTail);
63 fHead = next;
84 entry->fNext = fHead;
85 if (fHead) {
86 fHead->fPrev = entry;
88 fHead = entry;
108 if (nullptr == fHead) {
109 fHead = entry
[all...] |
| SkGlyphCache_Globals.h | 33 fHead = nullptr;
42 SkGlyphCache* cache = fHead;
52 SkGlyphCache* internalGetHead() const { return fHead; }
83 SkGlyphCache* fHead;
|
| SkArenaAllocList.h | 25 void reset() { fHead = fTail = nullptr; }
45 Iter begin() { return Iter(fHead); }
56 Node* fHead = nullptr;
63 SkASSERT(!fHead == !fTail);
66 fHead = fTail = n;
|
| SkRWBuffer.cpp | 129 : fHead(head), fAvailable(available), fTail(tail)
132 fHead->ref();
142 if (fHead) {
143 fHead->unref();
157 if (buffer && buffer->fHead) {
158 fBlock = &buffer->fHead->fBlock;
193 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {
195 fHead = SkBufferHead::Alloc(initialCapacity);
196 fTail = &fHead->fBlock;
202 if (fHead) {
[all...] |
| SkResourceCache.cpp | 72 fHead = nullptr;
95 Rec* rec = fHead;
301 SkASSERT(fHead == rec);
302 fHead = next;
317 if (fHead == rec) {
321 SkASSERT(fHead);
328 fHead->fPrev = rec;
329 rec->fNext = fHead;
330 fHead = rec;
339 rec->fNext = fHead;
[all...] |
| /external/skia/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 39 fHead = fTail = nullptr;
47 Entry* entry = fHead;
57 SkASSERT(fHead != entry);
60 SkASSERT(fHead == entry);
61 fHead = entry->fNext;
75 entry->fNext = fHead;
76 if (fHead) {
77 fHead->fPrev = entry;
81 fHead = entry;
87 Entry* entry = fHead;
[all...] |
| SkGradientBitmapCache.h | 27 mutable Entry* fHead;
|
| /external/skqp/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 39 fHead = fTail = nullptr;
47 Entry* entry = fHead;
57 SkASSERT(fHead != entry);
60 SkASSERT(fHead == entry);
61 fHead = entry->fNext;
75 entry->fNext = fHead;
76 if (fHead) {
77 fHead->fPrev = entry;
81 fHead = entry;
87 Entry* entry = fHead;
[all...] |
| /external/skia/src/gpu/ |
| GrResourceAllocator.cpp | 89 Interval* temp = fHead;
91 fHead = temp->next();
98 if (!fHead) {
100 fHead = intvl;
101 } else if (intvl->start() <= fHead->start()) {
102 intvl->setNext(fHead);
103 fHead = intvl;
105 Interval* prev = fHead;
116 if (!fHead) {
118 fHead = intvl
[all...] |
| GrMemoryPool.cpp | 32 fHead = CreateBlock(preallocSize);
33 fTail = fHead;
34 fHead->fNext = nullptr;
35 fHead->fPrev = nullptr;
55 SkASSERT(fHead == fTail);
56 SkASSERT(0 == fHead->fLiveCount);
57 DeleteBlock(fHead);
109 if (fHead == block) {
110 fHead->fCurrPtr = reinterpret_cast<intptr_t>(fHead) + kHeaderSize
[all...] |
| GrMemoryPool.h | 54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
64 size_t preallocSize() const { return fHead->fSize; }
107 BlockHeader* fHead;
|
| /external/skqp/src/gpu/ |
| GrMemoryPool.cpp | 32 fHead = CreateBlock(preallocSize);
33 fTail = fHead;
34 fHead->fNext = nullptr;
35 fHead->fPrev = nullptr;
55 SkASSERT(fHead == fTail);
56 SkASSERT(0 == fHead->fLiveCount);
57 DeleteBlock(fHead);
109 if (fHead == block) {
110 fHead->fCurrPtr = reinterpret_cast<intptr_t>(fHead) + kHeaderSize
[all...] |
| GrResourceAllocator.cpp | 91 Interval* temp = fHead;
93 fHead = temp->next();
100 if (!fHead) {
102 fHead = intvl;
103 } else if (intvl->start() <= fHead->start()) {
104 intvl->setNext(fHead);
105 fHead = intvl;
107 Interval* prev = fHead;
118 if (!fHead) {
120 fHead = intvl
[all...] |
| GrMemoryPool.h | 54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
64 size_t preallocSize() const { return fHead->fSize; }
107 BlockHeader* fHead;
|
| /external/skia/src/pathops/ |
| SkOpContour.h | 49 : &fHead;
64 SkOpSegment* segment = &fHead;
119 SkOpSegment* segment = &fHead;
136 const SkOpSegment* segment = &fHead;
178 return &fHead;
183 return &fHead;
206 SkOpSegment* segment = &fHead;
210 segment->joinEnds(next ? next : &fHead);
215 SkOpSegment* segment = &fHead;
224 SkOpSegment* segment = &fHead;
[all...] |
| /external/skqp/src/pathops/ |
| SkOpContour.h | 49 : &fHead;
64 SkOpSegment* segment = &fHead;
119 SkOpSegment* segment = &fHead;
136 const SkOpSegment* segment = &fHead;
178 return &fHead;
183 return &fHead;
206 SkOpSegment* segment = &fHead;
210 segment->joinEnds(next ? next : &fHead);
215 SkOpSegment* segment = &fHead;
224 SkOpSegment* segment = &fHead;
[all...] |
| /external/skia/include/core/ |
| SkRWBuffer.h | 64 const SkBufferHead* fHead;
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
106 SkBufferHead* fHead;
|
| /external/skqp/include/core/ |
| SkRWBuffer.h | 64 const SkBufferHead* fHead;
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
106 SkBufferHead* fHead;
|
