/external/skia/src/base/ |
D | SkTInternalLList.h | 34 fHead = nullptr; in reset() 39 SkASSERT(fHead && fTail); in remove() 48 fHead = next; in remove() 69 entry->fNext = fHead; in addToHead() 70 if (fHead) { in addToHead() 71 fHead->fPrev = entry; in addToHead() 73 fHead = entry; in addToHead() 93 if (nullptr == fHead) { in addToTail() 94 fHead = entry; in addToTail() 121 SkASSERT(fHead == existingEntry); in addBefore() [all …]
|
D | SkBlockAllocator.cpp | 19 : fTail(&fHead) in SkBlockAllocator() 30 , fHead(/*prev=*/nullptr, additionalPreallocBytes + BaseHeadBlockSize()) { in SkBlockAllocator() 57 size_t size = offsetof(SkBlockAllocator, fHead) + this->scratchBlockSize(); in totalSize() 101 if (block == &fHead) { in releaseBlock() 121 SkASSERT(block != fHead.fPrev); // shouldn't already be the scratch block in releaseBlock() 122 if (fHead.fPrev) { in releaseBlock() 123 delete fHead.fPrev; in releaseBlock() 126 fHead.fPrev = block; in releaseBlock() 155 Block* toSteal = other->fHead.fNext; in stealHeapBlocks() 159 SkASSERT(other->fTail != &other->fHead); in stealHeapBlocks() [all …]
|
D | SkArenaAllocList.h | 28 void reset() { fHead = fTail = nullptr; } in reset() 48 Iter begin() { return Iter(fHead); } in begin() 59 Node* fHead = nullptr; variable 66 SkASSERT(!fHead == !fTail); in append() 69 fHead = fTail = n; in append()
|
D | SkBlockAllocator.h | 232 return sizeof(SkBlockAllocator) + fHead.fSize - BaseHeadBlockSize(); in preallocSize() 240 return fHead.fSize - kDataStart; in preallocUsableSpace() 248 int metadata() const { return fHead.fAllocatorMetadata; } in metadata() 253 void setMetadata(int value) { fHead.fAllocatorMetadata = value; } in setMetadata() 318 const Block* headBlock() const { return &fHead; } in headBlock() 319 Block* headBlock() { return &fHead; } in headBlock() 439 return sizeof(SkBlockAllocator) - offsetof(SkBlockAllocator, fHead); in BaseHeadBlockSize() 447 int scratchBlockSize() const { return fHead.fPrev ? fHead.fPrev->fSize : 0; } in scratchBlockSize() 473 alignas(kAddressAlign) Block fHead; variable 531 offsetof(SkBlockAllocator, fHead) + BlockOverhead<Align, Padding>()); in Overhead() [all …]
|
/external/skia/src/gpu/ganesh/gradients/ |
D | GrGradientBitmapCache.cpp | 50 fHead = fTail = nullptr; in GrGradientBitmapCache() 58 Entry* entry = fHead; in ~GrGradientBitmapCache() 68 SkASSERT(fHead != entry); in release() 71 SkASSERT(fHead == entry); in release() 72 fHead = entry->fNext; in release() 86 entry->fNext = fHead; in attachToHead() 87 if (fHead) { in attachToHead() 88 fHead->fPrev = entry; in attachToHead() 92 fHead = entry; in attachToHead() 98 Entry* entry = fHead; in find() [all …]
|
/external/skia/src/gpu/ganesh/geometry/ |
D | GrTriangulator.h | 229 const Node* head() const { return fHead; } in head() 250 if (list.fHead) { in concat() 251 *fTail = list.fHead; in concat() 254 list.fHead = nullptr; in concat() 255 list.fTail = &list.fHead; in concat() 261 Node* fHead = nullptr; 262 Node** fTail = &fHead; 312 VertexList() : fHead(nullptr), fTail(nullptr) {} in VertexList() 313 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList() 314 Vertex* fHead; member [all …]
|
D | GrAATriangulator.cpp | 113 for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) { in connectPartners() 148 for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { in removeNonBoundaryEdges() 191 for (Edge* e = boundary->fHead; e != nullptr;) { in simplifyBoundary() 203 e = boundary->fHead; in simplifyBoundary() 222 e = boundary->fHead; // join->fLeft ? join->fLeft : join; in simplifyBoundary() 318 for (Vertex* v = mesh->fHead; v != nullptr; v = v->fNext) { in collapseOverlapRegions() 417 if (!boundary->fHead || !boundary->fHead->fRight || !boundary->fHead->fRight->fRight) { in strokeBoundary() 433 for (Edge* e = boundary->fHead; e != nullptr; e = e->fRight) { in strokeBoundary() 546 if (!inversion(innerVertices.fTail, innerVertices.fHead, prevEdge, c)) { in strokeBoundary() 549 if (!inversion(outerVertices.fTail, outerVertices.fHead, prevEdge, c)) { in strokeBoundary() [all …]
|
D | GrTriangulator.cpp | 117 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert() 121 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove() 293 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert() 299 list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); in remove() 333 Vertex* first = vertices.fHead; in emitMonotonePoly() 383 , fHead(nullptr) in Poly() 414 fHead = fTail = tri->allocateMonotonePoly(e, side, fWinding); in addEdge() 442 for (MonotonePoly* m = poly->fHead; m != nullptr; m = m->fNext) { in emitPoly() 563 if (contour->fHead) { in pathToContours() 645 Edge* next = prev ? prev->fRight : fHead; in insert() [all …]
|
/external/skia/src/pathops/ |
D | SkOpContour.h | 59 : &fHead; in appendSegment() 74 SkOpSegment* segment = &fHead; in calcAngles() 129 SkOpSegment* segment = &fHead; in debugShowActiveSpans() 146 const SkOpSegment* segment = &fHead; in debugValidate() 188 return &fHead; in first() 193 return &fHead; in first() 216 SkOpSegment* segment = &fHead; in joinSegments() 220 segment->joinEnds(next ? next : &fHead); in joinSegments() 225 SkOpSegment* segment = &fHead; in markAllDone() 234 SkOpSegment* segment = &fHead; in missingCoincidence() [all …]
|
D | SkOpCoincidence.cpp | 201 SkCoincidentSpans* test = fHead; in extend() 280 DebugCheckAdd(fHead, coinPtTStart, coinPtTEnd, oppPtTStart, oppPtTEnd); in add() 284 coinRec->set(this->fHead, coinPtTStart, coinPtTEnd, oppPtTStart, oppPtTEnd); in add() 285 fHead = coinRec; in add() 394 SkCoincidentSpans* span = fHead; in addEndMovedSpans() 399 fHead = nullptr; in addEndMovedSpans() 442 SkCoincidentSpans* coin = this->fHead; in addExpanded() 675 if (fHead && !this->checkOverlap(fHead, coinSeg, oppSeg, coinTs, in addOrOverlap() 698 if (!fHead || !this->release(fHead, test)) { in addOrOverlap() 783 fHead->debugShow(); in addOrOverlap() [all …]
|
D | SkPathOpsTSect.cpp | 73 SkTSpan* next = prior ? prior->fNext : fHead; in addFollowing() 80 fHead = result; in addFollowing() 526 fHead = this->addOne(); in SkTSect() 527 SkDEBUGCODE(fHead->debugSetGlobalState(debugGlobalState)); in SkTSect() 528 fHead->init(c); in SkTSect() 592 if (sect2->fHead->contains(oppTTest)) { in binarySearchCoin() 629 SkTSpan* test = fHead; in boundsMax() 630 SkTSpan* largest = fHead; in boundsMax() 649 SkTSpan* first = fHead; in coincidentCheck() 673 if (!fHead || !sect2->fHead) { in coincidentCheck() [all …]
|
D | SkOpSegment.h | 93 angle->set(&fHead, fHead.next()); in addStartSpan() 94 fHead.setToAngle(angle); in addStartSpan() 235 return &fHead; in head() 239 return &fHead; in head() 280 fTail.ptT()->addOpp(start->fHead.ptT(), start->fHead.ptT()); in joinEnds() 440 SkOpSpan fHead; // the head span always has its t set to zero
|
D | SkPathOpsDebug.cpp | 728 const SkOpSpanBase* span = &fHead; in debugAddT() 758 const SkOpSpanBase* base = &fHead; in debugCheckAngleCoin() 787 const SkOpSpan* span = &fHead; in debugClearAll() 845 const SkOpSpanBase* spanBase = &fHead; in debugMissingCoincidence() 862 if (spanBase == &fHead) { in debugMissingCoincidence() 940 DebugClearVisited(&fHead); in debugMissingCoincidence() 948 const SkOpSpanBase* test = &fHead; in debugMoveMultiples() 1045 const SkOpSpanBase* spanBase = &fHead; in debugMoveNearby() 1054 if (spanBase == &fHead) { in debugMoveNearby() 1069 spanBase = &fHead; in debugMoveNearby() [all …]
|
/external/skia/src/core/ |
D | SkResourceCache.cpp | 82 fHead = nullptr; in init() 107 Rec* rec = fHead; in ~SkResourceCache() 313 SkASSERT(fHead == rec); in release() 314 fHead = next; in release() 329 if (fHead == rec) { in moveToHead() 333 SkASSERT(fHead); in moveToHead() 340 fHead->fPrev = rec; in moveToHead() 341 rec->fNext = fHead; in moveToHead() 342 fHead = rec; in moveToHead() 351 rec->fNext = fHead; in addToHead() [all …]
|
D | SkStream.cpp | 498 : fHead(other.fHead) in SkDynamicMemoryWStream() 502 other.fHead = nullptr; in SkDynamicMemoryWStream() 520 Block* block = fHead; in reset() 526 fHead = fTail = nullptr; in reset() 568 fHead = fTail = block; in write() 586 dst->fTail->fNext = fHead; in writeToAndReset() 589 fHead = fTail = nullptr; in writeToAndReset() 604 fTail->fNext = dst->fHead; in prependToAndReset() 605 dst->fHead = fHead; in prependToAndReset() 607 fHead = fTail = nullptr; in prependToAndReset() [all …]
|
D | SkStrikeCache.cpp | 101 if (fHead != nullptr && fHead->getDescriptor() == desc) { return sk_ref_sp(fHead); } in internalFindStrikeOrNull() 108 if (fHead != strikePtr) { in internalFindStrikeOrNull() 116 fHead->fPrev = strikePtr; in internalFindStrikeOrNull() 117 strikePtr->fNext = fHead; in internalFindStrikeOrNull() 119 fHead = strikePtr; in internalFindStrikeOrNull() 195 for (SkStrike* strike = fHead; strike != nullptr; strike = strike->fNext) { in forEachStrike() 262 if (fHead != nullptr) { in internalAttachToHead() 263 fHead->fPrev = strikePtr; in internalAttachToHead() 264 strikePtr->fNext = fHead; in internalAttachToHead() 271 fHead = strikePtr; // Transfer ownership of strike to the cache list. in internalAttachToHead() [all …]
|
/external/skia/src/gpu/ganesh/tessellate/ |
D | PathTessellator.h | 43 void operator++() { fHead = fHead->fNext; } 44 bool operator!=(const Iter& b) const { return fHead != b.fHead; } 46 return {fHead->fPathMatrix, fHead->fPath, fHead->fColor}; 48 const PathDrawList* fHead; member
|
/external/skia/src/gpu/ganesh/ |
D | GrResourceAllocator.cpp | 186 Interval* temp = fHead; in popHead() 188 fHead = temp->next(); in popHead() 189 if (!fHead) { in popHead() 204 if (!fHead) { in insertByIncreasingStart() 206 fHead = fTail = intvl; in insertByIncreasingStart() 207 } else if (intvl->start() <= fHead->start()) { in insertByIncreasingStart() 209 intvl->setNext(fHead); in insertByIncreasingStart() 210 fHead = intvl; in insertByIncreasingStart() 217 Interval* prev = fHead; in insertByIncreasingStart() 235 if (!fHead) { in insertByIncreasingEnd() [all …]
|
D | GrRingBuffer.cpp | 19 head = fHead; in getAllocationOffset() 53 fHead = SkAlignTo(head + size, fAlignment); in getAllocationOffset() 78 fHead = 0; in suballocate() 103 submitData->fLastHead = fHead; in startSubmit()
|
D | GrResourceAllocator.h | 255 SkASSERT(SkToBool(fHead) == SkToBool(fTail)); in empty() 256 return !SkToBool(fHead); in empty() 258 const Interval* peekHead() const { return fHead; } in peekHead() 259 Interval* peekHead() { return fHead; } in peekHead() 267 Interval* fHead = nullptr;
|
/external/skia/src/gpu/ganesh/ops/ |
D | AtlasTextOp.cpp | 85 , fHead{geo} 86 , fTail{&fHead->fNext} { 115 , fHead{geo} 116 , fTail{&fHead->fNext} { 153 for(Geometry* geom = fHead; geom != nullptr; geom = geom->fNext) { in onDumpInfo() 180 color.setToConstant(fHead->fColor); in finalize() 204 caps, clampType, &fHead->fColor); in finalize() 220 if (fUsesLocalCoords && !fHead->fDrawMatrix.invert(&localMatrix)) { in onPrepareDraws() 267 target->allocator(), *target->caps().shaderCaps(), fHead->fColor, in onPrepareDraws() 306 for (const Geometry* geo = fHead; geo != nullptr; geo = geo->fNext) { in onPrepareDraws() [all …]
|
D | OpsTask.cpp | 80 : fHead(std::move(op)), fTail(fHead.get()) { in List() 87 fHead = std::move(that.fHead); in operator =() 95 SkASSERT(fHead); in popHead() 96 auto temp = fHead->cutChain(); in popHead() 97 std::swap(temp, fHead); in popHead() 98 if (!fHead) { in popHead() 109 SkASSERT(head == fHead.get()); in removeOp() 113 SkASSERT(op == fHead.get()); in removeOp() 131 if (fHead) { in pushHead() 132 op->chainConcat(std::move(fHead)); in pushHead() [all …]
|
D | OpsTask.h | 213 bool empty() const { return !SkToBool(fHead); } in empty() 214 GrOp* head() const { return fHead.get(); } in head() 227 GrOp::Owner fHead{nullptr}; 230 static_assert(::sk_is_trivially_relocatable<decltype(fHead)>::value);
|
/external/skia/tests/ |
D | PathOpsDebug.cpp | 855 const SkOpSpanBase* span = &fHead; in dump() 869 const SkOpSpanBase* span = &fHead; in dumpAll() 879 const SkOpSpanBase* span = &fHead; in dumpAngles() 895 const SkOpSpan* span = &fHead; in dumpCoin() 952 SkCoincidentSpans* span = fHead; in dump() 957 if (!fTop || fHead == fTop) { in dump() 983 const SkOpSegment* segment = &fHead; in dump() 997 const SkOpSegment* segment = &fHead; in dumpAll() 1009 const SkOpSegment* segment = &fHead; in dumpAngles() 1017 const SkOpSegment* segment = &fHead; in dumpPt() [all …]
|
/external/skia/src/text/gpu/ |
D | SubRunContainer.h | 218 bool isEmpty() const { return fHead == nullptr; } in isEmpty() 219 Iterator begin() { return Iterator{ fHead.get()}; } in begin() 221 Iterator begin() const { return Iterator{ fHead.get()}; } in begin() 223 SubRun& front() const {return *fHead; } in front() 226 SubRunOwner fHead{nullptr}; 227 SubRunOwner* fTail{&fHead};
|