Home
last modified time | relevance | path

Searched refs:fPrev (Results 1 - 25 of 39) sorted by relevance

12

/third_party/skia/src/core/
H A DSkTInternalLList.h21 ClassName* fPrev = nullptr; \
40 T* prev = entry->fPrev; in remove()
49 next->fPrev = prev; in remove()
54 entry->fPrev = nullptr; in remove()
63 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
66 entry->fPrev = nullptr; in addToHead()
69 fHead->fPrev = entry; in addToHead()
82 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
85 entry->fPrev = fTail; in addToTail()
115 T* prev = existingEntry->fPrev; in addBefore()
[all...]
H A DSkBlockAllocator.cpp33 , fPrev(prev) in Block()
105 SkASSERT(block->fPrev); in releaseBlock()
106 block->fPrev->fNext = block->fNext; in releaseBlock()
109 block->fNext->fPrev = block->fPrev; in releaseBlock()
112 fTail = block->fPrev; in releaseBlock()
117 SkASSERT(block != fHead.fPrev); // shouldn't already be the scratch block in releaseBlock()
118 if (fHead.fPrev) { in releaseBlock()
119 delete fHead.fPrev; in releaseBlock()
122 fHead.fPrev in releaseBlock()
[all...]
H A DSkScanPriv.h46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
52 edge->fPrev = afterMe; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
61 EdgeType* prev = edge->fPrev; in backward_insert_edge_based_on_x()
62 while (prev->fPrev && prev->fX > x) { in backward_insert_edge_based_on_x()
63 prev = prev->fPrev; in backward_insert_edge_based_on_x()
77 while (prev->fPrev && prev->fX > x) { in backward_insert_start()
78 prev = prev->fPrev; in backward_insert_start()
[all...]
H A DSkStrikeCache.cpp138 strikePtr->fPrev->fNext = strikePtr->fNext;
140 strikePtr->fNext->fPrev = strikePtr->fPrev;
142 fTail = strikePtr->fPrev;
144 fHead->fPrev = strikePtr;
146 strikePtr->fPrev = nullptr;
258 SkStrike* prev = strike->fPrev; in internalPurge()
285 SkASSERT(nullptr == strikePtr->fPrev && nullptr == strikePtr->fNext); in internalAttachToHead()
291 fHead->fPrev = strikePtr; in internalAttachToHead()
307 if (strike->fPrev) { in internalRemoveStrike()
[all...]
H A DSkDeque.cpp13 Block* fPrev; member
22 fNext = fPrev = nullptr; in init()
90 fFrontBlock->fPrev = first; in push_front()
129 last->fPrev = fBackBlock; in push_back()
161 first->fPrev = nullptr; in pop_front()
193 last = last->fPrev; in pop_back()
209 if (nullptr == last->fPrev) { in pop_back()
212 SkASSERT(last->fPrev->fEnd); in pop_back()
213 fBack = last->fPrev->fEnd - fElemSize; in pop_back()
275 fCurBlock = fCurBlock->fPrev; in prev()
[all...]
H A DSkResourceCache.cpp222 Rec* prev = rec->fPrev; in purgeAsNeeded()
250 Rec* prev = rec->fPrev; in purgeSharedID()
280 rec = rec->fPrev; in visitAll()
309 Rec* prev = rec->fPrev; in release()
322 next->fPrev = prev; in release()
325 rec->fNext = rec->fPrev = nullptr; in release()
340 fHead->fPrev = rec; in moveToHead()
350 rec->fPrev = nullptr; in addToHead()
353 fHead->fPrev = rec; in addToHead()
376 SkASSERT(nullptr == fHead->fPrev); in validate()
[all...]
H A DSkEdge.h29 SkEdge* fPrev; member
57 SkASSERT(fPrev && fNext);
58 SkASSERT(fPrev->fNext == this);
59 SkASSERT(fNext->fPrev == this);
H A DSkAnalyticEdge.h25 SkAnalyticEdge* fPrev; member
97 SkASSERT(fPrev && fNext); in validate()
98 SkASSERT(fPrev->fNext == this); in validate()
99 SkASSERT(fNext->fPrev == this); in validate()
H A DSkScan_Path.cpp48 SkEdge* prev = newEdge->fPrev; in insert_new_edges()
78 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
79 SkASSERT(edge->fPrev->fNext == edge); in validate_edges_for_y()
80 SkASSERT(edge->fNext->fPrev == edge); in validate_edges_for_y()
83 SkASSERT(edge->fPrev->fX <= edge->fX); in validate_edges_for_y()
387 list[i]->fPrev = list[i - 1]; in sort_edges()
438 headEdge.fPrev = nullptr; in sk_fill_path()
442 edge->fPrev = &headEdge; in sk_fill_path()
444 tailEdge.fPrev = last; in sk_fill_path()
722 headEdge.fPrev in sk_fill_triangle()
[all...]
H A DSkScan_AAAPath.cpp1027 list[i]->fPrev = list[i - 1];
1372 if (edge->fPrev->fPrev && edge->fPrev->fX + edge->fPrev->fDX > edge->fX + edge->fDX) {
1382 SkAnalyticEdge* prev = newEdge->fPrev;
1422 SkASSERT(edge->fPrev && edge->fNext);
1423 SkASSERT(edge->fPrev->fNext == edge);
1424 SkASSERT(edge->fNext->fPrev == edge);
1426 SkASSERT(edge->fPrev
[all...]
H A DSkBlockAllocator.h160 Block* fPrev; member in final::GrowthPolicy::final
446 int scratchBlockSize() const { return fHead.fPrev ? fHead.fPrev->fSize : 0; } in scratchBlockSize()
719 fNext = block ? (Forward ? block->fNext : block->fPrev) : nullptr; in advance()
/third_party/skia/src/gpu/gradients/
H A DGrGradientBitmapCache.cpp19 Entry* fPrev; member
27 : fPrev(nullptr), in Entry()
63 if (entry->fPrev) { in release()
65 entry->fPrev->fNext = entry->fNext; in release()
72 entry->fNext->fPrev = entry->fPrev; in release()
75 fTail = entry->fPrev; in release()
81 entry->fPrev = nullptr; in attachToHead()
84 fHead->fPrev = entry; in attachToHead()
220 SkASSERT(nullptr == fHead->fPrev); in validate()
[all...]
/third_party/skia/src/gpu/
H A DGrRenderTaskCluster.cpp127 while (clusterHead->fPrev in task_cluster_visit()
128 && 1 == clusterHead->fPrev->numTargets() in task_cluster_visit()
129 && target == first_target(clusterHead->fPrev)) { in task_cluster_visit()
130 clusterHead = clusterHead->fPrev; in task_cluster_visit()
H A DGrThreadSafeCache.cpp60 Entry* prev = cur ? cur->fPrev : nullptr; in dropUniqueRefs()
74 prev = cur ? cur->fPrev : nullptr; in dropUniqueRefs()
83 Entry* prev = cur ? cur->fPrev : nullptr; in dropUniqueRefsOlderThan()
98 prev = cur ? cur->fPrev : nullptr; in dropUniqueRefsOlderThan()
187 SkASSERT(!dead->fPrev && !dead->fNext && !dead->fList); in recycleEntry()
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.cpp39 SSVertex(Vertex* v) : fVertex(v), fPrev(nullptr), fNext(nullptr) {} in SSVertex()
41 SSEdge* fPrev; member
47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) { in SSEdge()
51 SSVertex* fPrev; member
65 Vertex* prev = e->fPrev->fVertex; in makeEvent()
112 if ((inner->fPrev || inner->fNext) && (outer->fPrev || outer->fNext)) { in connectPartners()
128 edge->fPrev->fVertex->fID, in dump_skel()
250 Vertex* prev = fEdge->fPrev->fVertex; in apply()
252 SSEdge* prevEdge = fEdge->fPrev in apply()
[all...]
H A DGrTriangulator.h259 * in Y) using the same fPrev/fNext pointers that were used for the contours, to avoid
268 : fPoint(point), fPrev(nullptr), fNext(nullptr) in Vertex()
280 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. member
310 list.fHead->fPrev = fTail; in append()
321 fHead->fPrev = fTail; in close()
462 , fPrev(nullptr) in MonotonePoly()
470 MonotonePoly* fPrev; member
H A DGrTriangulator.cpp114 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); in insert()
118 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); in remove()
332 SkASSERT(v && v->fPrev && v->fNext); in emitMonotonePoly()
333 Vertex* prev = v->fPrev; in emitMonotonePoly()
345 v->fPrev->fNext = v->fNext; in emitMonotonePoly()
346 v->fNext->fPrev = v->fPrev; in emitMonotonePoly()
348 if (v->fPrev == first) { in emitMonotonePoly()
351 v = v->fPrev; in emitMonotonePoly()
426 m->fPrev in addEdge()
[all...]
/third_party/skia/samplecode/
H A DSample.cpp76 fClick->fPrev = fClick->fCurr = fClick->fOrig = point; in mouse()
83 fClick->fPrev = fClick->fCurr; in mouse()
92 fClick->fPrev = fClick->fCurr; in mouse()
H A DSampleSG.cpp90 SkScalar dx = click->fCurr.fX - click->fPrev.fX;
91 SkScalar dy = click->fCurr.fY - click->fPrev.fY;
H A DSampleMixer.cpp81 fRect.offset(click->fCurr.fX - click->fPrev.fX,
82 click->fCurr.fY - click->fPrev.fY);
H A DSampleClip.cpp226 SkPoint fPrev = {0, 0}; in clip() member
239 rec->fPrev = pts[0]; in clip()
243 if (addLineTo || pts[0] != rec->fPrev) { in clip()
250 rec->fPrev = pts[1]; in clip()
254 rec->fPrev = pts[2]; in clip()
258 rec->fPrev = pts[3]; in clip()
H A DSampleStrokeVerb.cpp134 points[fPtIdx] += fCurr - fPrev; in doClick()
137 points[i] += fCurr - fPrev; in doClick()
/third_party/skia/src/utils/
H A DSkPolyUtils.cpp235 OffsetEdge* fPrev; member
299 node->fPrev->fNext = node->fNext; in remove_node()
300 node->fNext->fPrev = node->fPrev; in remove_node()
367 edgeData[curr].fPrev = &edgeData[prev]; in SkInsetConvexPolygon()
376 OffsetEdge* prevEdge = currEdge->fPrev; in SkInsetConvexPolygon()
397 prevEdge = prevEdge->fPrev; in SkInsetConvexPolygon()
426 prevEdge = prevEdge->fPrev; in SkInsetConvexPolygon()
1277 currEdge->fPrev = prevEdge; in SkOffsetSimplePolygon()
1288 currEdge->fPrev in SkOffsetSimplePolygon()
1780 SkVector fFirst, fPrev; global() member
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsTSect.cpp62 result->fPrev = prior; in addFollowing()
70 next->fPrev = result; in addFollowing()
215 fPrev = fNext = nullptr; in init()
415 fPrev = work; in splitAt()
422 fNext->fPrev = this; in splitAt()
441 SkASSERT(this != fPrev); in validate()
443 SkASSERT(fNext == nullptr || fNext != fPrev); in validate()
444 SkASSERT(fNext == nullptr || this == fNext->fPrev); in validate()
445 SkASSERT(fPrev == nullptr || this == fPrev in validate()
[all...]
H A DSkOpSpan.h299 return fPrev; in prev()
303 return fPrev; in prev()
335 fPrev = prev; in setPrev()
409 SkOpSpan* fPrev; // previous intersection point member in SkOpSpanBase

Completed in 24 milliseconds

12