Home
last modified time | relevance | path

Searched refs:fTail (Results 1 – 19 of 19) sorted by relevance

/external/skia/src/gpu/
DGrMemoryPool.cpp31 fTail = fHead; in GrMemoryPool()
40 SkASSERT(fHead == fTail); in ~GrMemoryPool()
49 if (fTail->fFreeSize < size) { in allocate()
54 block->fPrev = fTail; in allocate()
56 SkASSERT(nullptr == fTail->fNext); in allocate()
57 fTail->fNext = block; in allocate()
58 fTail = block; in allocate()
62 SkASSERT(kAssignedMarker == fTail->fBlockSentinal); in allocate()
63 SkASSERT(fTail->fFreeSize >= size); in allocate()
64 intptr_t ptr = fTail->fCurrPtr; in allocate()
[all …]
DGrTessellator.cpp237 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList()
238 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList()
240 Vertex* fTail; member
242 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert()
245 insert(v, fTail, nullptr); in append()
251 if (fTail) { in append()
252 fTail->fNext = list.fHead; in append()
253 list.fHead->fPrev = fTail; in append()
257 fTail = list.fTail; in append()
263 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove()
[all …]
DGrMemoryPool.h51 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; } in isEmpty()
104 BlockHeader* fTail; variable
/external/skia/src/core/
DSkSinglyLinkedList.h17 SkSinglyLinkedList() : fHead(nullptr), fTail(nullptr) {} in SkSinglyLinkedList()
20 SkASSERT(fHead != nullptr || nullptr == fTail); in reset()
25 SkASSERT(next != nullptr || node == fTail); in reset()
30 fTail = nullptr; in reset()
32 T* back() { return fTail ? &fTail->fData : nullptr; } in back()
49 fTail = nullptr; in pop_front()
56 if (!fTail) { in emplace_front()
57 fTail = n; in emplace_front()
65 if (fTail) { in emplace_back()
66 fTail->fNext = n; in emplace_back()
[all …]
DSkTInternalLList.h45 , fTail(NULL) { in SkTInternalLList()
49 SkASSERT(fHead && fTail); in remove()
63 fTail = prev; in remove()
84 if (NULL == fTail) { in addToHead()
85 fTail = entry; in addToHead()
97 entry->fPrev = fTail; in addToTail()
99 if (fTail) { in addToTail()
100 fTail->fNext = entry; in addToTail()
102 fTail = entry; in addToTail()
160 SkASSERT(fTail == existingEntry); in addAfter()
[all …]
DSkRWBuffer.cpp126 : fHead(head), fAvailable(available), fTail(tail) in SkROBuffer()
173 if (fBuffer->fTail == fBlock) { in next()
186 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) { in SkRWBuffer()
189 fTail = &fHead->fBlock; in SkRWBuffer()
214 fTail = &fHead->fBlock; in append()
217 size_t written = fTail->append(src, length); in append()
224 fTail->fNext = block; in append()
225 fTail = block; in append()
226 written = fTail->append(src, length); in append()
235 fHead->validate(fTotalUsed, fTail); in validate()
[all …]
DSkStream.cpp459 : fHead(nullptr), fTail(nullptr), fBytesWrittenBeforeTail(0) in SkDynamicMemoryWStream()
473 fHead = fTail = nullptr; in reset()
480 if (fTail) { in bytesWritten()
481 return fBytesWrittenBeforeTail + fTail->written(); in bytesWritten()
490 if (fTail) { in write()
491 if (fTail->avail() > 0) { in write()
492 size = SkTMin(fTail->avail(), count); in write()
493 buffer = fTail->append(buffer, size); in write()
501 fBytesWrittenBeforeTail += fTail->written(); in write()
511 if (fTail != nullptr) in write()
[all …]
DSkResourceCache.cpp73 fTail = nullptr; in init()
319 Rec* rec = fTail; in purgeAsNeeded()
349 Rec* rec = fTail; in purgeSharedID()
375 Rec* rec = fTail; in visitAll()
418 fTail = prev; in release()
432 SkASSERT(fTail); in moveToHead()
454 if (!fTail) { in addToHead()
455 fTail = rec; in addToHead()
468 SkASSERT(nullptr == fTail); in validate()
473 if (fHead == fTail) { in validate()
[all …]
DSkResourceCache.h253 Rec* fTail; variable
/external/skia/src/effects/gradients/
DSkGradientBitmapCache.cpp39 fHead = fTail = nullptr; in SkGradientBitmapCache()
64 SkASSERT(fTail != entry); in release()
67 SkASSERT(fTail == entry); in release()
68 fTail = entry->fPrev; in release()
79 fTail = entry; in attachToHead()
107 SkASSERT(fTail); in add()
108 delete this->release(fTail); in add()
126 SkASSERT(nullptr == fTail->fNext); in validate()
129 SkASSERT(fHead == fTail); in validate()
131 SkASSERT(fHead != fTail); in validate()
[all …]
DSkGradientBitmapCache.h28 mutable Entry* fTail; variable
/external/skia/src/pathops/
DSkOpContour.h50 result->setPrev(fTail); in appendSegment()
51 if (fTail) { in appendSegment()
52 fTail->setNext(result); in appendSegment()
54 fTail = result; in appendSegment()
143 SkASSERT(prior == fTail); in debugValidate()
171 return fTail->pts()[SkPathOpsVerbToPoints(fTail->verb())]; in end()
280 fTail = nullptr; in reset()
356 const SkOpSegment* segment = fTail; in toPartialBackward()
376 SkOpSegment* fTail; variable
DSkOpSegment.h64 angle->set(&fTail, fTail.prev()); in addEndSpan()
65 fTail.setFromAngle(angle); in addEndSpan()
273 fTail.ptT()->addOpp(start->fHead.ptT(), start->fHead.ptT()); in joinEnds()
392 return &fTail; in tail()
396 return &fTail; in tail()
434 SkOpSpanBase fTail; // the tail span always has its t set to one variable
DSkOpContour.cpp26 const SkOpSegment* segment = fTail; in toReversePath()
DSkOpSegment.cpp270 FAIL_WITH_NULL_IF(spanBase == &fTail); in addT()
287 while (spanBase != &fTail) { in calcAngles()
307 if (activePrior && !fTail.simple()) { in calcAngles()
473 if (spanBase == &fTail) { in contains()
805 SkOpSpanBase* oneSpan = &fTail; in init()
DSkPathOpsDebug.cpp771 FAIL_WITH_NULL_IF(span != &fTail, span); in debugAddT()
/external/skia/include/core/
DSkRWBuffer.h60 SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* fTail);
65 const SkBufferBlock* fTail; variable
103 SkBufferBlock* fTail; variable
DSkStream.h406 Block* fTail; variable
/external/skia/tests/
DPathOpsAngleTest.cpp484 SkOpPtT* startPtT = startT == 0 ? fHead.ptT() : startT == 1 ? fTail.ptT() in debugAddAngle()
486 SkOpPtT* endPtT = endT == 0 ? fHead.ptT() : endT == 1 ? fTail.ptT() in debugAddAngle()