| /external/skia/src/core/ |
| H A D | SkSinglyLinkedList.h | 17 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 D | SkTInternalLList.h | 45 , fTail(NULL) {
49 SkASSERT(fHead && fTail);
63 fTail = prev;
84 if (NULL == fTail) {
85 fTail = entry;
97 entry->fPrev = fTail;
99 if (fTail) {
100 fTail->fNext = entry;
102 fTail = entry;
160 SkASSERT(fTail
267 T* fTail; member in class:SkTInternalLList
[all...] |
| H A D | SkRWBuffer.cpp | 126 : fHead(head), fAvailable(available), fTail(tail)
173 if (fBuffer->fTail == fBlock) {
186 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) {
189 fTail = &fHead->fBlock;
214 fTail = &fHead->fBlock;
217 size_t written = fTail->append(src, length);
224 fTail->fNext = block;
225 fTail = block;
226 written = fTail->append(src, length);
235 fHead->validate(fTotalUsed, fTail);
[all...] |
| H A D | SkResourceCache.cpp | 73 fTail = nullptr;
319 Rec* rec = fTail;
349 Rec* rec = fTail;
375 Rec* rec = fTail;
418 fTail = prev;
432 SkASSERT(fTail);
454 if (!fTail) {
455 fTail = rec;
468 SkASSERT(nullptr == fTail);
473 if (fHead == fTail) {
[all...] |
| H A D | SkStream.cpp | 459 : fHead(nullptr), fTail(nullptr), fBytesWrittenBeforeTail(0)
473 fHead = fTail = nullptr;
480 if (fTail) {
481 return fBytesWrittenBeforeTail + fTail->written();
490 if (fTail) {
491 if (fTail->avail() > 0) {
492 size = SkTMin(fTail->avail(), count);
493 buffer = fTail->append(buffer, size);
500 // If we get here, we've just exhausted fTail, so update our tracker
501 fBytesWrittenBeforeTail += fTail
[all...] |
| H A D | SkResourceCache.h | 253 Rec* fTail; member in class:SkResourceCache
|
| /external/skia/src/gpu/ |
| H A D | GrMemoryPool.cpp | 31 fTail = fHead;
40 SkASSERT(fHead == fTail);
49 if (fTail->fFreeSize < size) {
54 block->fPrev = fTail;
56 SkASSERT(nullptr == fTail->fNext);
57 fTail->fNext = block;
58 fTail = block;
62 SkASSERT(kAssignedMarker == fTail->fBlockSentinal);
63 SkASSERT(fTail->fFreeSize >= size);
64 intptr_t ptr = fTail
[all...] |
| H A D | GrMemoryPool.h | 51 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
104 BlockHeader* fTail; member in class:GrMemoryPool
|
| H A D | GrTessellator.cpp | 237 VertexList() : fHead(nullptr), fTail(nullptr) {}
238 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {}
240 Vertex* fTail; member in struct:__anon17043::VertexList
242 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);
245 insert(v, fTail, nullptr);
251 if (fTail) {
252 fTail->fNext = list.fHead;
253 list.fHead->fPrev = fTail;
257 fTail = list.fTail;
426 Edge* fTail; member in struct:__anon17043::EdgeList
600 MonotonePoly* fTail; member in struct:__anon17043::Poly
[all...] |
| /external/skia/src/effects/gradients/ |
| H A D | SkGradientBitmapCache.cpp | 39 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 D | SkGradientBitmapCache.h | 28 mutable Entry* fTail; member in class:SkGradientBitmapCache
|
| /external/skia/include/core/ |
| H A D | SkRWBuffer.h | 60 SkROBuffer(const SkBufferHead* head, size_t available, const SkBufferBlock* fTail);
65 const SkBufferBlock* fTail; member in class:SkROBuffer
103 SkBufferBlock* fTail; member in class:SkRWBuffer
|
| H A D | SkStream.h | 406 Block* fTail; member in class:SkDynamicMemoryWStream
|
| /external/skia/src/pathops/ |
| H A D | SkOpContour.h | 50 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...] |
| H A D | SkOpSegment.h | 64 angle->set(&fTail, fTail.prev());
65 fTail.setFromAngle(angle);
273 fTail.ptT()->addOpp(start->fHead.ptT(), start->fHead.ptT());
392 return &fTail;
396 return &fTail;
434 SkOpSpanBase fTail; // the tail span always has its t set to one member in class:SkOpSegment
|
| H A D | SkOpContour.cpp | 26 const SkOpSegment* segment = fTail;
|
| H A D | SkOpSegment.cpp | 270 FAIL_WITH_NULL_IF(spanBase == &fTail);
287 while (spanBase != &fTail) {
307 if (activePrior && !fTail.simple()) {
473 if (spanBase == &fTail) {
805 SkOpSpanBase* oneSpan = &fTail;
|
| H A D | SkPathOpsDebug.cpp | 771 FAIL_WITH_NULL_IF(span != &fTail, span);
|
| /external/skia/tests/ |
| H A D | PathOpsAngleTest.cpp | 484 SkOpPtT* startPtT = startT == 0 ? fHead.ptT() : startT == 1 ? fTail.ptT()
486 SkOpPtT* endPtT = endT == 0 ? fHead.ptT() : endT == 1 ? fTail.ptT()
|