HomeSort by relevance Sort by last modified time
    Searched defs:fHead (Results 1 - 25 of 34) sorted by null

1 2

  /external/skia/include/core/
SkRWBuffer.h 64 const SkBufferHead* fHead;
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
106 SkBufferHead* fHead;
SkStream.h 472 Block* fHead;
  /external/skia/src/shaders/gradients/
SkGradientBitmapCache.h 27 mutable Entry* fHead;
  /external/skqp/include/core/
SkRWBuffer.h 64 const SkBufferHead* fHead;
94 return sk_sp<SkROBuffer>(new SkROBuffer(fHead, fTotalUsed, fTail));
106 SkBufferHead* fHead;
SkStream.h 470 Block* fHead;
  /external/skqp/src/shaders/gradients/
SkGradientBitmapCache.h 27 mutable Entry* fHead;
  /external/skia/src/core/
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;
SkGlyphCache_Globals.h 33 fHead = nullptr;
42 SkGlyphCache* cache = fHead;
52 SkGlyphCache* internalGetHead() const { return fHead; }
83 SkGlyphCache* fHead;
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...]
SkResourceCache.h 261 Rec* fHead;
  /external/skqp/src/core/
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;
SkGlyphCache_Globals.h 33 fHead = nullptr;
42 SkGlyphCache* cache = fHead;
52 SkGlyphCache* internalGetHead() const { return fHead; }
83 SkGlyphCache* fHead;
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...]
SkResourceCache.h 261 Rec* fHead;
  /external/skia/src/gpu/
GrMemoryPool.h 54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
64 size_t preallocSize() const { return fHead->fSize; }
107 BlockHeader* fHead;
GrResourceAllocator.h 164 bool empty() const { return !SkToBool(fHead); }
165 const Interval* peekHead() const { return fHead; }
172 Interval* fHead = nullptr;
  /external/skqp/src/gpu/
GrMemoryPool.h 54 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
64 size_t preallocSize() const { return fHead->fSize; }
107 BlockHeader* fHead;
GrResourceAllocator.h 164 bool empty() const { return !SkToBool(fHead); }
165 const Interval* peekHead() const { return fHead; }
171 Interval* fHead = nullptr;
  /external/skia/src/pathops/
SkOpCoincidence.h 137 : fHead(nullptr)
227 return !fHead && !fTop;
293 SkCoincidentSpans* fHead;
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...]
SkOpSegment.h 82 angle->set(&fHead, fHead.next());
83 fHead.setToAngle(angle);
224 return &fHead;
228 return &fHead;
269 fTail.ptT()->addOpp(start->fHead.ptT(), start->fHead.ptT());
429 SkOpSpan fHead; // the head span always has its t set to zero
  /external/skqp/src/pathops/
SkOpCoincidence.h 137 : fHead(nullptr)
227 return !fHead && !fTop;
293 SkCoincidentSpans* fHead;
  /external/skia/tests/
OnFlushCallbackTest.cpp 284 op->setNext(header->fHead);
285 header->fHead = op;
359 for (AtlasedRectOp* op = lists[i]->fHead; op; op = op->next()) {
393 AtlasedRectOp* fHead;
408 header->fHead = nullptr;

Completed in 808 milliseconds

1 2