Searched refs:fTail (Results 1 - 25 of 40) sorted by relevance

12

/external/skia/src/core/
H A DSkSinglyLinkedList.h17 SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {}
20 SkASSERT(fHead != nullptr || nullptr == fTail);
25 SkASSERT(next != nullptr || node == fTail);
30 fTail = nullptr;
32 T* back() { return fTail ? &fTail->fData : nullptr; }
49 fTail = nullptr;
56 if (!fTail) {
57 fTail = n;
65 if (fTail) {
93 Node* fTail; member in class:SkSinglyLinkedList
[all...]
H A DSkArenaAllocList.h25 void reset() { fHead = fTail = nullptr; }
47 Iter tail() { return Iter(fTail); }
57 Node* fTail = nullptr; member in class:SkArenaAllocList
63 SkASSERT(!fHead == !fTail);
65 if (!fTail) {
66 fHead = fTail = n;
68 fTail = fTail->fNext = n;
70 return fTail->fT;
H A DSkTInternalLList.h45 , fTail(nullptr) {
50 fTail = nullptr;
54 SkASSERT(fHead && fTail);
68 fTail = prev;
89 if (nullptr == fTail) {
90 fTail = entry;
102 entry->fPrev = fTail;
104 if (fTail) {
105 fTail->fNext = entry;
107 fTail
298 T* fTail; member in class:SkTInternalLList
[all...]
H A DSkRWBuffer.cpp129 : fHead(head), fAvailable(available), fTail(tail)
180 if (fBuffer->fTail == fBlock) {
193 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {
196 fTail = &fHead->fBlock;
221 fTail = &fHead->fBlock;
224 size_t written = fTail->append(src, length);
231 fTail->fNext = block;
232 fTail = block;
233 written = fTail->append(src, length);
242 fHead->validate(fTotalUsed, fTail);
[all...]
H A DSkResourceCache.cpp73 fTail = nullptr;
204 Rec* rec = fTail;
236 Rec* rec = fTail;
265 Rec* rec = fTail;
308 fTail = prev;
322 SkASSERT(fTail);
344 if (!fTail) {
345 fTail = rec;
358 SkASSERT(nullptr == fTail);
363 if (fHead == fTail) {
[all...]
H A DSkStream.cpp485 : fHead(nullptr), fTail(nullptr), fBytesWrittenBeforeTail(0)
499 fHead = fTail = nullptr;
506 if (fTail) {
507 return fBytesWrittenBeforeTail + fTail->written();
516 if (fTail) {
517 if (fTail->avail() > 0) {
518 size = SkTMin(fTail->avail(), count);
519 buffer = fTail->append(buffer, size);
526 // If we get here, we've just exhausted fTail, so update our tracker
527 fBytesWrittenBeforeTail += fTail
[all...]
/external/skqp/src/core/
H A DSkSinglyLinkedList.h17 SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {}
20 SkASSERT(fHead != nullptr || nullptr == fTail);
25 SkASSERT(next != nullptr || node == fTail);
30 fTail = nullptr;
32 T* back() { return fTail ? &fTail->fData : nullptr; }
49 fTail = nullptr;
56 if (!fTail) {
57 fTail = n;
65 if (fTail) {
93 Node* fTail; member in class:SkSinglyLinkedList
[all...]
H A DSkArenaAllocList.h25 void reset() { fHead = fTail = nullptr; }
47 Iter tail() { return Iter(fTail); }
57 Node* fTail = nullptr; member in class:SkArenaAllocList
63 SkASSERT(!fHead == !fTail);
65 if (!fTail) {
66 fHead = fTail = n;
68 fTail = fTail->fNext = n;
70 return fTail->fT;
H A DSkTInternalLList.h45 , fTail(nullptr) {
50 fTail = nullptr;
54 SkASSERT(fHead && fTail);
68 fTail = prev;
89 if (nullptr == fTail) {
90 fTail = entry;
102 entry->fPrev = fTail;
104 if (fTail) {
105 fTail->fNext = entry;
107 fTail
298 T* fTail; member in class:SkTInternalLList
[all...]
H A DSkRWBuffer.cpp129 : fHead(head), fAvailable(available), fTail(tail)
180 if (fBuffer->fTail == fBlock) {
193 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {
196 fTail = &fHead->fBlock;
221 fTail = &fHead->fBlock;
224 size_t written = fTail->append(src, length);
231 fTail->fNext = block;
232 fTail = block;
233 written = fTail->append(src, length);
242 fHead->validate(fTotalUsed, fTail);
[all...]
H A DSkResourceCache.cpp73 fTail = nullptr;
204 Rec* rec = fTail;
236 Rec* rec = fTail;
265 Rec* rec = fTail;
308 fTail = prev;
322 SkASSERT(fTail);
344 if (!fTail) {
345 fTail = rec;
358 SkASSERT(nullptr == fTail);
363 if (fHead == fTail) {
[all...]
H A DSkStream.cpp467 : fHead(nullptr), fTail(nullptr), fBytesWrittenBeforeTail(0)
481 fHead = fTail = nullptr;
488 if (fTail) {
489 return fBytesWrittenBeforeTail + fTail->written();
498 if (fTail) {
499 if (fTail->avail() > 0) {
500 size = SkTMin(fTail->avail(), count);
501 buffer = fTail->append(buffer, size);
508 // If we get here, we've just exhausted fTail, so update our tracker
509 fBytesWrittenBeforeTail += fTail
[all...]
/external/skia/src/gpu/
H A DGrMemoryPool.cpp33 fTail = fHead;
55 SkASSERT(fHead == fTail);
64 if (fTail->fFreeSize < size) {
69 block->fPrev = fTail;
71 SkASSERT(nullptr == fTail->fNext);
72 fTail->fNext = block;
73 fTail = block;
77 SkASSERT(kAssignedMarker == fTail->fBlockSentinal);
78 SkASSERT(fTail->fFreeSize >= size);
79 intptr_t ptr = fTail
[all...]
H A DGrMemoryPool.h54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
108 BlockHeader* fTail; member in class:GrMemoryPool
H A DGrTessellator.cpp243 VertexList() : fHead(nullptr), fTail(nullptr) {}
244 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {}
246 Vertex* fTail; member in struct:__anon20750::VertexList
248 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);
251 insert(v, fTail, nullptr);
257 if (fTail) {
258 fTail->fNext = list.fHead;
259 list.fHead->fPrev = fTail;
263 fTail = list.fTail;
457 Edge* fTail; member in struct:__anon20750::EdgeList
664 MonotonePoly* fTail; member in struct:__anon20750::Poly
[all...]
/external/skqp/src/gpu/
H A DGrMemoryPool.cpp33 fTail = fHead;
55 SkASSERT(fHead == fTail);
64 if (fTail->fFreeSize < size) {
69 block->fPrev = fTail;
71 SkASSERT(nullptr == fTail->fNext);
72 fTail->fNext = block;
73 fTail = block;
77 SkASSERT(kAssignedMarker == fTail->fBlockSentinal);
78 SkASSERT(fTail->fFreeSize >= size);
79 intptr_t ptr = fTail
[all...]
H A DGrMemoryPool.h54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
108 BlockHeader* fTail; member in class:GrMemoryPool
/external/skia/src/shaders/gradients/
H A DSkGradientBitmapCache.cpp39 fHead = fTail = nullptr;
64 SkASSERT(fTail != entry);
67 SkASSERT(fTail == entry);
68 fTail = entry->fPrev;
79 fTail = entry;
107 SkASSERT(fTail);
108 delete this->release(fTail);
126 SkASSERT(nullptr == fTail->fNext);
129 SkASSERT(fHead == fTail);
131 SkASSERT(fHead != fTail);
[all...]
H A DSkGradientBitmapCache.h28 mutable Entry* fTail; member in class:SkGradientBitmapCache
/external/skqp/src/shaders/gradients/
H A DSkGradientBitmapCache.cpp39 fHead = fTail = nullptr;
64 SkASSERT(fTail != entry);
67 SkASSERT(fTail == entry);
68 fTail = entry->fPrev;
79 fTail = entry;
107 SkASSERT(fTail);
108 delete this->release(fTail);
126 SkASSERT(nullptr == fTail->fNext);
129 SkASSERT(fHead == fTail);
131 SkASSERT(fHead != fTail);
[all...]
H A DSkGradientBitmapCache.h28 mutable Entry* fTail; member in class:SkGradientBitmapCache
/external/skia/include/core/
H A DSkRWBuffer.h61 SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* fTail);
66 const SkBufferBlock* fTail; member in class:SkROBuffer
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
107 SkBufferBlock* fTail; member in class:SkRWBuffer
/external/skqp/include/core/
H A DSkRWBuffer.h61 SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* fTail);
66 const SkBufferBlock* fTail; member in class:SkROBuffer
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
107 SkBufferBlock* fTail; member in class:SkRWBuffer
/external/skia/src/pathops/
H A DSkOpContour.h50 result->setPrev(fTail);
51 if (fTail) {
52 fTail->setNext(result);
54 fTail = result;
143 SkASSERT(prior == fTail);
171 return fTail->pts()[SkPathOpsVerbToPoints(fTail->verb())];
280 fTail = nullptr;
356 const SkOpSegment* segment = fTail;
376 SkOpSegment* fTail; member in class:SkOpContour
[all...]
/external/skqp/src/pathops/
H A DSkOpContour.h50 result->setPrev(fTail);
51 if (fTail) {
52 fTail->setNext(result);
54 fTail = result;
143 SkASSERT(prior == fTail);
171 return fTail->pts()[SkPathOpsVerbToPoints(fTail->verb())];
280 fTail = nullptr;
356 const SkOpSegment* segment = fTail;
376 SkOpSegment* fTail; member in class:SkOpContour
[all...]

Completed in 341 milliseconds

12