/external/skia/src/effects/gradients/ |
D | SkGradientBitmapCache.cpp | 38 fHead = fTail = NULL; in SkGradientBitmapCache() 46 Entry* entry = fHead; in ~SkGradientBitmapCache() 56 SkASSERT(fHead != entry); in detach() 59 SkASSERT(fHead == entry); in detach() 60 fHead = entry->fNext; in detach() 74 entry->fNext = fHead; in attachToHead() 75 if (fHead) { in attachToHead() 76 fHead->fPrev = entry; in attachToHead() 80 fHead = entry; in attachToHead() 86 Entry* entry = fHead; in find() [all …]
|
/external/skia/include/core/ |
D | SkTInternalLList.h | 44 : fHead(NULL) in SkTInternalLList() 49 SkASSERT(fHead && fTail); in remove() 58 fHead = next; in remove() 79 entry->fNext = fHead; in addToHead() 80 if (fHead) { in addToHead() 81 fHead->fPrev = entry; in addToHead() 83 fHead = entry; in addToHead() 103 if (NULL == fHead) { in addToTail() 104 fHead = entry; in addToTail() 131 SkASSERT(fHead == existingEntry); in addBefore() [all …]
|
/external/skia/src/gpu/ |
D | GrMemoryPool.cpp | 26 fHead = CreateBlock(fPreallocSize); in GrMemoryPool() 27 fTail = fHead; in GrMemoryPool() 28 fHead->fNext = NULL; in GrMemoryPool() 29 fHead->fPrev = NULL; in GrMemoryPool() 36 SkASSERT(fHead == fTail); in ~GrMemoryPool() 37 SkASSERT(0 == fHead->fLiveCount); in ~GrMemoryPool() 38 DeleteBlock(fHead); in ~GrMemoryPool() 80 if (fHead == block) { in release() 81 fHead->fCurrPtr = reinterpret_cast<intptr_t>(fHead) + kHeaderSize; in release() 82 fHead->fLiveCount = 0; in release() [all …]
|
D | GrMemoryPool.h | 44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; } in isEmpty() 80 BlockHeader* fHead; variable
|
D | GrTessellatingPathRenderer.cpp | 210 EdgeList() : fHead(NULL), fTail(NULL) {} in EdgeList() 211 Edge* fHead; member 305 return activeEdges && (fLeft || fRight || activeEdges->fHead == this); in isActive() 314 , fHead(NULL) in Poly() 331 , fHead(NULL) in MonotonePoly() 336 Vertex* fHead; member 348 if (fHead == NULL) { in addVertex() 349 fHead = fTail = newV; in addVertex() 355 newV->fNext = fHead; in addVertex() 356 fHead->fPrev = newV; in addVertex() [all …]
|
/external/skia/src/core/ |
D | SkRWBuffer.cpp | 117 SkROBuffer::SkROBuffer(const SkBufferHead* head, size_t used) : fHead(head), fUsed(used) { in SkROBuffer() 119 fHead->ref(); in SkROBuffer() 128 if (fHead) { in ~SkROBuffer() 129 fHead->validate(fUsed); in ~SkROBuffer() 130 fHead->unref(); in ~SkROBuffer() 140 fBlock = &buffer->fHead->fBlock; in reset() 164 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(NULL), fTail(NULL), fTotalUsed(0) {} in SkRWBuffer() 168 fHead->unref(); in ~SkRWBuffer() 179 if (NULL == fHead) { in append() 180 fHead = SkBufferHead::Alloc(length); in append() [all …]
|
D | SkResourceCache.cpp | 60 fHead = NULL; in init() 198 Rec* rec = fHead; in ~SkResourceCache() 376 SkASSERT(fHead == rec); in detach() 377 fHead = next; in detach() 392 if (fHead == rec) { in moveToHead() 396 SkASSERT(fHead); in moveToHead() 403 fHead->fPrev = rec; in moveToHead() 404 rec->fNext = fHead; in moveToHead() 405 fHead = rec; in moveToHead() 414 rec->fNext = fHead; in addToHead() [all …]
|
D | SkRecordPattern.h | 113 i = this->matchHead(&fHead, record, i); in match() 132 template <typename T> T* first() { return fHead.get(); } in first() 133 template <typename T> T* second() { return fTail.fHead.get(); } in second() 134 template <typename T> T* third() { return fTail.fTail.fHead.get(); } in third() 135 template <typename T> T* fourth() { return fTail.fTail.fTail.fHead.get(); } in fourth() 142 if (record->mutate<bool>(i, fHead)) { in matchHead() 153 if (!record->mutate<bool>(i, fHead)) { in matchHead() 161 Matcher fHead; variable
|
D | SkGlyphCache_Globals.h | 34 fHead = NULL; in SkGlyphCache_Globals() 44 SkGlyphCache* cache = fHead; in ~SkGlyphCache_Globals() 56 SkGlyphCache* internalGetHead() const { return fHead; } in internalGetHead() 102 SkGlyphCache* fHead;
|
D | SkStream.cpp | 520 : fHead(NULL), fTail(NULL), fBytesWritten(0), fCopy(NULL) in SkDynamicMemoryWStream() 533 Block* block = fHead; in reset() 540 fHead = fTail = NULL; in reset() 570 fHead = fTail = block; in write() 584 Block* block = fHead; in write() 605 Block* block = fHead; in read() 627 Block* block = fHead; in copyTo() 639 for (Block* block = fHead; block != NULL; block = block->fNext) { in writeToStream() 673 explicit SkBlockMemoryRefCnt(SkDynamicMemoryWStream::Block* head) : fHead(head) { } in SkBlockMemoryRefCnt() 676 SkDynamicMemoryWStream::Block* block = fHead; in ~SkBlockMemoryRefCnt() [all …]
|
D | SkRWBuffer.h | 62 const SkBufferHead* fHead; variable 92 SkBufferHead* fHead;
|
D | SkGlyphCache.cpp | 566 SkGlyphCache* cache = fHead; in internalGetTail() 631 if (fHead) { in internalAttachCacheToHead() 632 fHead->fPrev = cache; in internalAttachCacheToHead() 633 cache->fNext = fHead; in internalAttachCacheToHead() 635 fHead = cache; in internalAttachCacheToHead() 649 fHead = cache->fNext; in internalDetachCache() 678 const SkGlyphCache* head = fHead; in validate()
|
/external/skia/src/pathops/ |
D | SkOpContour.h | 57 SkOpSegment* segment = &fHead; in align() 65 ? SkOpTAllocator<SkOpSegment>::Allocate(allocator) : &fHead; in appendSegment() 92 SkOpSegment* segment = &fHead; in calcAngles() 116 SkOpSegment* segment = &fHead; in debugShowActiveSpans() 149 const SkOpSegment* segment = &fHead; in debugValidate() 191 return &fHead; in first() 196 return &fHead; in first() 216 SkOpSegment* segment = &fHead; in missingCoincidence() 228 SkOpSegment* segment = &fHead; in moveMultiples() 237 SkOpSegment* segment = &fHead; in moveNearby() [all …]
|
D | SkOpCoincidence.cpp | 14 SkCoincidentSpans* coinRec = fHead; in extend() 48 coinRec->fNext = this->fHead; in add() 54 this->fHead = coinRec; in add() 78 SkCoincidentSpans* check = this->fHead; in addIfMissing() 128 SkCoincidentSpans* outer = this->fHead; in addMissing() 177 SkCoincidentSpans* coin = fHead; in contains() 193 SkCoincidentSpans* coin = fHead; in apply() 301 SkCoincidentSpans* coin = fHead; in detach() 310 fHead = next; in detach() 320 SkCoincidentSpans* coin = fHead; in expand() [all …]
|
D | SkOpContour.cpp | 41 const SkPoint& pt = fHead.pts()[0]; in toPath() 43 const SkOpSegment* segment = &fHead; in toPath() 51 SkOpSegment* segment = &fHead; in undoneSegment()
|
D | SkPathOpsTSect.h | 297 SkTSpan<TCurve, OppCurve>* fHead; variable 364 SkTSpan<TCurve, OppCurve>* next = prior ? prior->fNext : fHead; in addFollowing() 371 fHead = result; in addFollowing() 820 fHead = addOne(); in SkTSect() 821 fHead->init(c); in SkTSect() 879 if (sect2->fHead->contains(oppTTest)) { in binarySearchCoin() 909 SkTSpan<TCurve, OppCurve>* test = fHead; in boundsMax() 910 SkTSpan<TCurve, OppCurve>* largest = fHead; in boundsMax() 925 SkTSpan<TCurve, OppCurve>* first = fHead; in coincidentCheck() 961 const SkTSpan<TCurve, OppCurve>* test = fHead; in collapsed() [all …]
|
D | SkOpSegment.cpp | 167 if ((start == &fHead && end == &fTail) || (start == &fTail && end == &fHead)) { in addCurveTo() 177 bool reverse = ePtr == fPts && start != &fHead; in addCurveTo() 220 SkOpSpanBase* test = &fHead; in addMissing() 243 SkOpSpanBase* span = &fHead; in addT() 301 SkOpSpanBase* span = &fHead; in align() 315 SkOpSpan* span = &fHead; in align() 326 bool activePrior = !fHead.isCanceled(); in calcAngles() 327 if (activePrior && !fHead.simple()) { in calcAngles() 330 SkOpSpan* prior = &fHead; in calcAngles() 331 SkOpSpanBase* spanBase = fHead.next(); in calcAngles() [all …]
|
D | SkOpCoincidence.h | 29 : fHead(NULL) { in SkOpCoincidence() 58 SkCoincidentSpans* fHead; variable
|
D | SkOpSegment.h | 85 angle->set(&fHead, fHead.next()); in addStartSpan() 86 fHead.setToAngle(angle); in addStartSpan() 188 return &fHead; in head() 192 return &fHead; in head() 383 SkOpSpan fHead; // the head span always has its t set to zero
|
D | SkPathOpsPostSect.cpp | 352 coinRec->fNext = this->fHead; in add() 358 this->fHead = coinRec; in add() 363 SkCoincidentSpans* coin = fHead; in contains() 379 SkCoincidentSpans* coin = fHead; in apply() 471 SkCoincidentSpans* coin = fHead; in mark()
|
D | SkPathOpsWinding.cpp | 112 SkOpSegment* testSegment = &fHead; in rayCheck() 189 SkOpSpan* span = &fHead; in windingSpanAtT() 357 SkOpSpan* span = &fHead; in findSortableTop() 375 SkOpSegment* testSegment = &fHead; in findSortableTop()
|
/external/skia/tests/ |
D | PathOpsTSectDebug.h | 18 const SkTSpan<TCurve, OppCurve>* test = fHead; in debugSpan() 29 const SkTSpan<TCurve, OppCurve>* test = fHead; in debugT() 48 dumpCommon(fHead); in dump() 65 if (this->fHead) { in dumpBoth() 68 if (opp->fHead) { in dumpBoth() 82 const SkTSpan<OppCurve, TCurve>* test = bounded->debugOpp()->fHead; in dumpBounded() 92 const SkTSpan<TCurve, OppCurve>* test = fHead; in dumpBounds() 130 dumpCommonCurves(fHead); in dumpCurves()
|
D | PathOpsDebug.cpp | 1020 const SkOpSpanBase* span = &fHead; in dump() 1034 const SkOpSpanBase* span = &fHead; in dumpAll() 1044 const SkOpSpanBase* span = &fHead; in dumpAngles() 1060 const SkOpSpan* span = &fHead; in dumpCoin() 1117 SkCoincidentSpans* span = fHead; in dump() 1129 const SkOpSegment* segment = &fHead; in dump() 1143 const SkOpSegment* segment = &fHead; in dumpAll() 1155 const SkOpSegment* segment = &fHead; in dumpAngles() 1163 const SkOpSegment* segment = &fHead; in dumpPt() 1173 const SkOpSegment* segment = &fHead; in dumpPts() [all …]
|
/external/skia/src/svg/parser/ |
D | SkSVGGradient.cpp | 82 SkSVGPaint* saveHead = parser.fHead; in write() 83 parser.fHead = &fPaintState; in write() 113 parser.fHead = saveHead; in write()
|
D | SkSVGParser.cpp | 40 fHead(&fEmptyPaint), fIDs(256), in SkSVGParser() 113 SkSVGPaint* state = fHead; in getPaintLast() 127 SkSVGPaint* walking = fHead; in isStrokeAndFill() 233 SkSVGPaint::Push(&fHead, &element->fPaintState); in translate() 267 SkSVGPaint::Pop(&fHead); in translate()
|