/external/skqp/include/private/ |
D | SkTInternalLList.h | 45 : fHead(nullptr) in SkTInternalLList() 50 fHead = nullptr; in reset() 55 SkASSERT(fHead && fTail); in remove() 64 fHead = next; in remove() 85 entry->fNext = fHead; in addToHead() 86 if (fHead) { in addToHead() 87 fHead->fPrev = entry; in addToHead() 89 fHead = entry; in addToHead() 109 if (nullptr == fHead) { in addToTail() 110 fHead = entry; in addToTail() [all …]
|
/external/skia/include/private/ |
D | SkTInternalLList.h | 45 : fHead(nullptr) in SkTInternalLList() 50 fHead = nullptr; in reset() 55 SkASSERT(fHead && fTail); in remove() 64 fHead = next; in remove() 85 entry->fNext = fHead; in addToHead() 86 if (fHead) { in addToHead() 87 fHead->fPrev = entry; in addToHead() 89 fHead = entry; in addToHead() 109 if (nullptr == fHead) { in addToTail() 110 fHead = entry; in addToTail() [all …]
|
/external/skqp/src/gpu/ccpr/ |
D | GrCCSTLList.h | 23 GrCCSTLList(Args&&... args) : fHead(std::forward<Args>(args)...) {} in GrCCSTLList() 26 T* draw = fHead.fNext; // fHead will be destructed automatically. in ~GrCCSTLList() 34 const T& head() const { return fHead; } in head() 35 T& head() { return fHead; } in head() 38 T* nextTail = (&right.fHead == right.fTail) ? nullptr : right.fTail; in append() 40 new (alloc->makeBytesAlignedTo(sizeof(T), alignof(T))) T(std::move(right.fHead)); in append() 43 right.fHead.fNext = nullptr; in append() 44 right.fTail = &right.fHead; in append() 56 Iter<const T> begin() const { return Iter<const T>{&fHead}; } in begin() 58 Iter<T> begin() { return Iter<T>{&fHead}; } in begin() [all …]
|
/external/skia/src/gpu/ccpr/ |
D | GrCCSTLList.h | 23 GrCCSTLList(Args&&... args) : fHead(std::forward<Args>(args)...) {} in GrCCSTLList() 26 T* draw = fHead.fNext; // fHead will be destructed automatically. in ~GrCCSTLList() 34 const T& head() const { return fHead; } in head() 35 T& head() { return fHead; } in head() 38 T* nextTail = (&right.fHead == right.fTail) ? nullptr : right.fTail; in append() 40 new (alloc->makeBytesAlignedTo(sizeof(T), alignof(T))) T(std::move(right.fHead)); in append() 43 right.fHead.fNext = nullptr; in append() 44 right.fTail = &right.fHead; in append() 56 Iter<const T> begin() const { return Iter<const T>{&fHead}; } in begin() 58 Iter<T> begin() { return Iter<T>{&fHead}; } in begin() [all …]
|
/external/skqp/src/gpu/ |
D | GrMemoryPool.cpp | 40 fHead = CreateBlock(preallocSize); in GrMemoryPool() 41 fTail = fHead; in GrMemoryPool() 42 fHead->fNext = nullptr; in GrMemoryPool() 43 fHead->fPrev = nullptr; in GrMemoryPool() 63 SkASSERT(fHead == fTail); in ~GrMemoryPool() 64 SkASSERT(0 == fHead->fLiveCount); in ~GrMemoryPool() 65 DeleteBlock(fHead); in ~GrMemoryPool() 120 if (fHead == block) { in release() 121 fHead->fCurrPtr = reinterpret_cast<intptr_t>(fHead) + kHeaderSize; in release() 122 fHead->fLiveCount = 0; in release() [all …]
|
D | GrResourceAllocator.cpp | 123 Interval* temp = fHead; in popHead() 125 fHead = temp->next(); in popHead() 126 if (!fHead) { in popHead() 141 if (!fHead) { in insertByIncreasingStart() 143 fHead = fTail = intvl; in insertByIncreasingStart() 144 } else if (intvl->start() <= fHead->start()) { in insertByIncreasingStart() 146 intvl->setNext(fHead); in insertByIncreasingStart() 147 fHead = intvl; in insertByIncreasingStart() 154 Interval* prev = fHead; in insertByIncreasingStart() 172 if (!fHead) { in insertByIncreasingEnd() [all …]
|
D | GrTessellator.cpp | 228 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() 229 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() 230 Vertex* fHead; member 233 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert() 239 if (!list.fHead) { in append() 243 fTail->fNext = list.fHead; in append() 244 list.fHead->fPrev = fTail; in append() 246 fHead = list.fHead; in append() 251 insert(v, nullptr, fHead); in prepend() 254 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove() [all …]
|
D | GrRenderTargetOpList.cpp | 40 : fHead(std::move(op)), fTail(fHead.get()) { in List() 48 fHead = std::move(that.fHead); in operator =() 56 SkASSERT(fHead); in popHead() 57 auto temp = fHead->cutChain(); in popHead() 58 std::swap(temp, fHead); in popHead() 59 if (!fHead) { in popHead() 70 SkASSERT(head == fHead.get()); in removeOp() 74 SkASSERT(op == fHead.get()); in removeOp() 92 if (fHead) { in pushHead() 93 op->chainConcat(std::move(fHead)); in pushHead() [all …]
|
/external/skia/src/gpu/ |
D | GrMemoryPool.cpp | 40 fHead = CreateBlock(preallocSize); in GrMemoryPool() 41 fTail = fHead; in GrMemoryPool() 42 fHead->fNext = nullptr; in GrMemoryPool() 43 fHead->fPrev = nullptr; in GrMemoryPool() 63 SkASSERT(fHead == fTail); in ~GrMemoryPool() 64 SkASSERT(0 == fHead->fLiveCount); in ~GrMemoryPool() 65 DeleteBlock(fHead); in ~GrMemoryPool() 120 if (fHead == block) { in release() 121 fHead->fCurrPtr = reinterpret_cast<intptr_t>(fHead) + kHeaderSize; in release() 122 fHead->fLiveCount = 0; in release() [all …]
|
D | GrResourceAllocator.cpp | 123 Interval* temp = fHead; in popHead() 125 fHead = temp->next(); in popHead() 126 if (!fHead) { in popHead() 141 if (!fHead) { in insertByIncreasingStart() 143 fHead = fTail = intvl; in insertByIncreasingStart() 144 } else if (intvl->start() <= fHead->start()) { in insertByIncreasingStart() 146 intvl->setNext(fHead); in insertByIncreasingStart() 147 fHead = intvl; in insertByIncreasingStart() 154 Interval* prev = fHead; in insertByIncreasingStart() 172 if (!fHead) { in insertByIncreasingEnd() [all …]
|
D | GrTessellator.cpp | 228 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() 229 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() 230 Vertex* fHead; member 233 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert() 239 if (!list.fHead) { in append() 243 fTail->fNext = list.fHead; in append() 244 list.fHead->fPrev = fTail; in append() 246 fHead = list.fHead; in append() 251 insert(v, nullptr, fHead); in prepend() 254 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove() [all …]
|
D | GrRenderTargetOpList.cpp | 42 : fHead(std::move(op)), fTail(fHead.get()) { in List() 50 fHead = std::move(that.fHead); in operator =() 58 SkASSERT(fHead); in popHead() 59 auto temp = fHead->cutChain(); in popHead() 60 std::swap(temp, fHead); in popHead() 61 if (!fHead) { in popHead() 72 SkASSERT(head == fHead.get()); in removeOp() 76 SkASSERT(op == fHead.get()); in removeOp() 94 if (fHead) { in pushHead() 95 op->chainConcat(std::move(fHead)); in pushHead() [all …]
|
/external/skia/src/gpu/gradients/ |
D | GrGradientBitmapCache.cpp | 46 fHead = fTail = nullptr; in GrGradientBitmapCache() 54 Entry* entry = fHead; in ~GrGradientBitmapCache() 64 SkASSERT(fHead != entry); in release() 67 SkASSERT(fHead == entry); in release() 68 fHead = entry->fNext; in release() 82 entry->fNext = fHead; in attachToHead() 83 if (fHead) { in attachToHead() 84 fHead->fPrev = entry; in attachToHead() 88 fHead = entry; in attachToHead() 94 Entry* entry = fHead; in find() [all …]
|
/external/skqp/src/gpu/gradients/ |
D | GrGradientBitmapCache.cpp | 46 fHead = fTail = nullptr; in GrGradientBitmapCache() 54 Entry* entry = fHead; in ~GrGradientBitmapCache() 64 SkASSERT(fHead != entry); in release() 67 SkASSERT(fHead == entry); in release() 68 fHead = entry->fNext; in release() 82 entry->fNext = fHead; in attachToHead() 83 if (fHead) { in attachToHead() 84 fHead->fPrev = entry; in attachToHead() 88 fHead = entry; in attachToHead() 94 Entry* entry = fHead; in find() [all …]
|
/external/skia/src/core/ |
D | SkRWBuffer.cpp | 130 : fHead(head), fAvailable(available), fTail(tail) in SkROBuffer() 133 fHead->ref(); in SkROBuffer() 143 if (fHead) { in ~SkROBuffer() 144 fHead->unref(); in ~SkROBuffer() 158 if (buffer && buffer->fHead) { in reset() 159 fBlock = &buffer->fHead->fBlock; in reset() 194 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) { in SkRWBuffer() 196 fHead = SkBufferHead::Alloc(initialCapacity); in SkRWBuffer() 197 fTail = &fHead->fBlock; in SkRWBuffer() 203 if (fHead) { in ~SkRWBuffer() [all …]
|
D | SkResourceCache.cpp | 81 fHead = nullptr; in init() 104 Rec* rec = fHead; in ~SkResourceCache() 310 SkASSERT(fHead == rec); in release() 311 fHead = next; in release() 326 if (fHead == rec) { in moveToHead() 330 SkASSERT(fHead); in moveToHead() 337 fHead->fPrev = rec; in moveToHead() 338 rec->fNext = fHead; in moveToHead() 339 fHead = rec; in moveToHead() 348 rec->fNext = fHead; in addToHead() [all …]
|
D | SkStream.cpp | 480 : fHead(other.fHead) in SkDynamicMemoryWStream() 484 other.fHead = nullptr; in SkDynamicMemoryWStream() 502 Block* block = fHead; in reset() 508 fHead = fTail = nullptr; in reset() 550 fHead = fTail = block; in write() 568 dst->fTail->fNext = fHead; in writeToAndReset() 571 fHead = fTail = nullptr; in writeToAndReset() 586 fTail->fNext = dst->fHead; in prependToAndReset() 587 dst->fHead = fHead; in prependToAndReset() 589 fHead = fTail = nullptr; in prependToAndReset() [all …]
|
D | SkArenaAllocList.h | 26 void reset() { fHead = fTail = nullptr; } in reset() 46 Iter begin() { return Iter(fHead); } in begin() 57 Node* fHead = nullptr; variable 64 SkASSERT(!fHead == !fTail); in append() 67 fHead = fTail = n; in append()
|
/external/skqp/src/core/ |
D | SkRWBuffer.cpp | 130 : fHead(head), fAvailable(available), fTail(tail) in SkROBuffer() 133 fHead->ref(); in SkROBuffer() 143 if (fHead) { in ~SkROBuffer() 144 fHead->unref(); in ~SkROBuffer() 158 if (buffer && buffer->fHead) { in reset() 159 fBlock = &buffer->fHead->fBlock; in reset() 194 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(nullptr), fTail(nullptr), fTotalUsed(0) { in SkRWBuffer() 196 fHead = SkBufferHead::Alloc(initialCapacity); in SkRWBuffer() 197 fTail = &fHead->fBlock; in SkRWBuffer() 203 if (fHead) { in ~SkRWBuffer() [all …]
|
D | SkResourceCache.cpp | 81 fHead = nullptr; in init() 104 Rec* rec = fHead; in ~SkResourceCache() 310 SkASSERT(fHead == rec); in release() 311 fHead = next; in release() 326 if (fHead == rec) { in moveToHead() 330 SkASSERT(fHead); in moveToHead() 337 fHead->fPrev = rec; in moveToHead() 338 rec->fNext = fHead; in moveToHead() 339 fHead = rec; in moveToHead() 348 rec->fNext = fHead; in addToHead() [all …]
|
D | SkStream.cpp | 480 : fHead(other.fHead) in SkDynamicMemoryWStream() 484 other.fHead = nullptr; in SkDynamicMemoryWStream() 502 Block* block = fHead; in reset() 508 fHead = fTail = nullptr; in reset() 550 fHead = fTail = block; in write() 568 dst->fTail->fNext = fHead; in writeToAndReset() 571 fHead = fTail = nullptr; in writeToAndReset() 586 fTail->fNext = dst->fHead; in prependToAndReset() 587 dst->fHead = fHead; in prependToAndReset() 589 fHead = fTail = nullptr; in prependToAndReset() [all …]
|
D | SkArenaAllocList.h | 26 void reset() { fHead = fTail = nullptr; } in reset() 46 Iter begin() { return Iter(fHead); } in begin() 57 Node* fHead = nullptr; variable 64 SkASSERT(!fHead == !fTail); in append() 67 fHead = fTail = n; in append()
|
/external/skia/src/pathops/ |
D | SkOpContour.h | 49 : &fHead; in appendSegment() 64 SkOpSegment* segment = &fHead; in calcAngles() 119 SkOpSegment* segment = &fHead; in debugShowActiveSpans() 136 const SkOpSegment* segment = &fHead; in debugValidate() 178 return &fHead; in first() 183 return &fHead; in first() 206 SkOpSegment* segment = &fHead; in joinSegments() 210 segment->joinEnds(next ? next : &fHead); in joinSegments() 215 SkOpSegment* segment = &fHead; in markAllDone() 224 SkOpSegment* segment = &fHead; in missingCoincidence() [all …]
|
D | SkOpCoincidence.cpp | 193 SkCoincidentSpans* test = fHead; in extend() 272 DebugCheckAdd(fHead, coinPtTStart, coinPtTEnd, oppPtTStart, oppPtTEnd); in add() 276 coinRec->set(this->fHead, coinPtTStart, coinPtTEnd, oppPtTStart, oppPtTEnd); in add() 277 fHead = coinRec; in add() 386 SkCoincidentSpans* span = fHead; in addEndMovedSpans() 391 fHead = nullptr; in addEndMovedSpans() 434 SkCoincidentSpans* coin = this->fHead; in addExpanded() 667 if (fHead && !this->checkOverlap(fHead, coinSeg, oppSeg, coinTs, in addOrOverlap() 690 if (!fHead || !this->release(fHead, test)) { in addOrOverlap() 775 fHead->debugShow(); in addOrOverlap() [all …]
|
/external/skqp/src/pathops/ |
D | SkOpContour.h | 49 : &fHead; in appendSegment() 64 SkOpSegment* segment = &fHead; in calcAngles() 119 SkOpSegment* segment = &fHead; in debugShowActiveSpans() 136 const SkOpSegment* segment = &fHead; in debugValidate() 178 return &fHead; in first() 183 return &fHead; in first() 206 SkOpSegment* segment = &fHead; in joinSegments() 210 segment->joinEnds(next ? next : &fHead); in joinSegments() 215 SkOpSegment* segment = &fHead; in markAllDone() 224 SkOpSegment* segment = &fHead; in missingCoincidence() [all …]
|