Home
last modified time | relevance | path

Searched refs:fNext (Results 1 - 25 of 106) sorted by relevance

12345

/third_party/skia/src/core/
H A DSkTMultiMap.h21 explicit ValueList(T* value) : fValue(value), fNext(nullptr) {} in ValueList()
26 ValueList* fNext; member
40 next = it->fNext; in reset()
54 newEntry->fNext = list->fNext; in insert()
57 list->fNext = newEntry; in insert()
77 list = list->fNext; in remove()
84 list = list->fNext; in remove()
109 list = list->fNext; in find()
126 list = list->fNext; in findAndRemove()
[all...]
H A DSkTInternalLList.h22 ClassName* fNext = nullptr
41 T* next = entry->fNext; in remove()
44 prev->fNext = next; in remove()
55 entry->fNext = nullptr; in remove()
63 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
67 entry->fNext = fHead; in addToHead()
82 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
86 entry->fNext = nullptr; in addToTail()
88 fTail->fNext = entry; in addToTail()
114 newEntry->fNext in addBefore()
[all...]
H A DSkStrikeCache.cpp138 strikePtr->fPrev->fNext = strikePtr->fNext;
139 if (strikePtr->fNext != nullptr) {
140 strikePtr->fNext->fPrev = strikePtr->fPrev;
145 strikePtr->fNext = fHead;
223 for (SkStrike* strike = fHead; strike != nullptr; strike = strike->fNext) { in forEachStrike()
285 SkASSERT(nullptr == strikePtr->fPrev && nullptr == strikePtr->fNext); in internalAttachToHead()
292 strikePtr->fNext = fHead; in internalAttachToHead()
308 strike->fPrev->fNext = strike->fNext; in internalRemoveStrike()
[all...]
H A DSkScanPriv.h46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
53 edge->fNext = afterMe->fNext; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
55 afterMe->fNext = edge; in insert_edge_after()
65 if (prev->fNext != edge) { in backward_insert_edge_based_on_x()
H A DSkBlockAllocator.cpp32 : fNext(nullptr) in Block()
106 block->fPrev->fNext = block->fNext; in releaseBlock()
107 if (block->fNext) { in releaseBlock()
109 block->fNext->fPrev = block->fPrev; in releaseBlock()
151 Block* toSteal = other->fHead.fNext; in stealHeapBlocks()
157 fTail->fNext = toSteal; in stealHeapBlocks()
161 other->fHead.fNext = nullptr; in stealHeapBlocks()
170 b->fNext = nullptr; in reset()
182 SkASSERT(fTail == &fHead && fHead.fNext in reset()
[all...]
H A DSkDeque.cpp12 Block* fNext; member
22 fNext = fPrev = nullptr; in init()
61 Block* next = head->fNext; in ~SkDeque()
89 first->fNext = fFrontBlock; in push_front()
130 fBackBlock->fNext = last; in push_back()
159 first = first->fNext; in pop_front()
175 if (nullptr == first->fNext) { in pop_front()
178 SkASSERT(first->fNext->fBegin); in pop_front()
179 fFront = first->fNext->fBegin; in pop_front()
195 last->fNext in pop_back()
[all...]
H A DSkScan_Path.cpp37 edge = edge->fNext; in validate_sort()
56 SkEdge* next = newEdge->fNext; in insert_new_edges()
58 if (start->fNext == newEdge) { in insert_new_edges()
61 SkEdge* after = start->fNext; 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()
84 edge = edge->fNext; in validate_edges_for_y()
103 validate_sort(prevHead->fNext); in walk_edges()
111 SkEdge* currE = prevHead->fNext; in walk_edges()
[all...]
H A DSkStream.cpp467 Block* fNext; member
477 fNext = nullptr; in init()
515 Block* next = block->fNext; in reset()
559 fTail->fNext = block; in write()
579 dst->fTail->fNext = fHead; in writeToAndReset()
597 fTail->fNext = dst->fHead; in prependToAndReset()
623 block = block->fNext; in read()
635 block = block->fNext; in copyTo()
641 for (Block* block = fHead; block != nullptr; block = block->fNext) { in writeToStream()
678 Block* next = block->fNext; in copyToAndReset()
[all...]
H A DSkResourceCache.cpp109 Rec* next = rec->fNext; in ~SkResourceCache()
310 Rec* next = rec->fNext; in release()
316 prev->fNext = next; in release()
325 rec->fNext = rec->fPrev = nullptr; in release()
341 rec->fNext = fHead; in moveToHead()
351 rec->fNext = fHead; in addToHead()
377 SkASSERT(nullptr == fHead->fNext); in validate()
383 SkASSERT(fHead->fNext); in validate()
384 SkASSERT(nullptr == fTail->fNext); in validate()
394 rec = rec->fNext; in validate()
[all...]
H A DSkBlockAllocator.h159 Block* fNext; // doubly-linked list of blocks member in final::GrowthPolicy::final
708 this->advance(fNext); in operator ++()
719 fNext = block ? (Forward ? block->fNext : block->fPrev) : nullptr; in advance()
720 if (!Forward && fNext && fNext->isScratch()) { in advance()
723 fNext = nullptr; in advance()
725 SkASSERT(!fNext || !fNext->isScratch()); in advance()
730 BlockT* fNext; member in final::GrowthPolicy::SkBlockAllocator::BlockIter::Item
[all...]
H A DSkRegion_path.cpp402 Edge* fNext; member
411 SkDEBUGCODE(fNext = nullptr;) in set()
423 SkASSERT(base->fNext); in find_link()
437 SkASSERT(nullptr == e->fNext); in find_link()
438 e->fNext = base; in find_link()
450 SkASSERT(nullptr == base->fNext); in find_link()
451 base->fNext = e; in find_link()
470 edge = edge->fNext; in extract_path()
482 edge = edge->fNext; in extract_path()
536 SkASSERT(e->fNext !
[all...]
H A DSkScan_AAAPath.cpp1026 list[i - 1]->fNext = list[i];
1043 edge = (SkAnalyticEdge*)edge->fNext;
1086 SkAnalyticEdge* nextCurrE = currE->fNext;
1104 validate_sort((SkAnalyticEdge*)prevHead->fNext);
1106 SkAnalyticEdge* leftE = (SkAnalyticEdge*)prevHead->fNext;
1107 SkAnalyticEdge* riteE = (SkAnalyticEdge*)leftE->fNext;
1108 SkAnalyticEdge* currE = (SkAnalyticEdge*)riteE->fNext;
1121 currE = (SkAnalyticEdge*)currE->fNext;
1130 currE = (SkAnalyticEdge*)currE->fNext;
1387 newEdge = newEdge->fNext;
[all...]
/third_party/skia/src/gpu/gradients/
H A DGrGradientBitmapCache.cpp20 Entry* fNext; member
28 fNext(nullptr), in Entry()
56 Entry* next = entry->fNext; in ~GrGradientBitmapCache()
65 entry->fPrev->fNext = entry->fNext; in release()
68 fHead = entry->fNext; in release()
70 if (entry->fNext) { in release()
72 entry->fNext->fPrev = entry->fPrev; in release()
82 entry->fNext = fHead; in attachToHead()
105 entry = entry->fNext; in find()
[all...]
/third_party/skia/src/pathops/
H A DSkPathOpsTSect.cpp51 bounded->fNext = fBounded; in addBounded()
60 SkTSpan* next = prior ? prior->fNext : fHead; in addFollowing()
63 result->fNext = next; in addFollowing()
65 prior->fNext = result; in addFollowing()
119 testBounded = testBounded->fNext; in closestBoundedT()
133 } while ((work = work->fNext)); in debugIsBefore()
144 } while ((work = work->fNext)); in contains()
160 bounded = bounded->fNext; in findOppSpan()
215 fPrev = fNext = nullptr; in init()
348 bounded = bounded->fNext; in oppT()
[all...]
H A DSkOpSpan.h35 SkOpPtT* oldNext = this->fNext; in addOpp()
37 this->fNext = opp; in addOpp()
39 oppPrev->fNext = oldNext; in addOpp()
89 span->fNext = fNext; in insert()
90 fNext = span; in insert()
94 return fNext; in next()
98 return fNext; in next()
106 SkOpPtT* oppPrev = opp->fNext; in oppPrev()
110 while (oppPrev->fNext ! in oppPrev()
170 SkOpPtT* fNext; // intersection on opposite curve or alias on this curve global() member in SkOpPtT
568 SkOpSpanBase* fNext; // next intersection point global() member in SkOpSpan
[all...]
H A DSkOpAngle.cpp63 SkOpAngle* rh = lh->fNext; in after()
735 if (angle->fNext) { in insert()
740 } else if (fNext) { in insert()
749 bool singleton = nullptr == fNext; in insert()
751 fNext = this; in insert()
753 SkOpAngle* next = fNext; in insert()
754 if (next->fNext == this) { in insert()
756 this->fNext = angle; in insert()
757 angle->fNext = next; in insert()
759 next->fNext in insert()
[all...]
/third_party/skia/tools/
H A DSkMetaData.cpp17 Rec* next = rec->fNext; in reset()
85 rec->fNext = result.prev->fNext; in set()
86 result.prev->fNext = rec; in set()
90 rec->fNext = fRec; in set()
168 current.rec = current.rec->fNext; in findWithPrev()
181 result.prev->fNext = result.rec->fNext; in remove()
183 fRec = result.rec->fNext; in remove()
239 fRec = fRec->fNext; in next()
[all...]
/third_party/skia/src/sksl/lex/
H A DNFAState.h35 , fNext(std::move(next)) {} in NFAState()
40 , fNext(std::move(next)) {} in NFAState()
49 , fNext(std::move(next)) { in NFAState()
89 for (int v : fNext) { in description()
99 for (int v : fNext) { in description()
127 for (int n : fNext) { in description()
149 std::vector<int> fNext; member
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DRBBISetBuilder.java52 RangeDescriptor fNext; // Next RangeDescriptor in the linked list. field in RBBISetBuilder.RangeDescriptor
80 nr.fNext = this.fNext; in split()
81 this.fNext = nr; in split()
187 rlRange = rlRange.fNext; in buildRanges()
220 rlRange = rlRange.fNext; in buildRanges()
240 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildRanges()
241 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) { in buildRanges()
265 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildRanges()
317 for (RangeDescriptor rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildTrie()
[all...]
/third_party/icu/icu4c/source/common/
H A Drbbisetb.cpp79 nextRangeDesc = r->fNext; in ~RBBISetBuilder()
143 rlRange = rlRange->fNext; in buildRanges()
185 rlRange = rlRange->fNext; in buildRanges()
205 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
206 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) { in buildRanges()
230 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
284 for (RangeDescriptor *range = fRangeList; range!=nullptr && U_SUCCESS(*fStatus); range=range->fNext) { in buildTrie()
300 for (RangeDescriptor *rd = fRangeList; rd != nullptr; rd = rd->fNext) { in mergeCategories()
445 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in getFirstChar()
467 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in printRanges()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Drbbisetb.cpp79 nextRangeDesc = r->fNext; in ~RBBISetBuilder()
143 rlRange = rlRange->fNext; in buildRanges()
185 rlRange = rlRange->fNext; in buildRanges()
205 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
206 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) { in buildRanges()
230 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
284 for (RangeDescriptor *range = fRangeList; range!=nullptr && U_SUCCESS(*fStatus); range=range->fNext) { in buildTrie()
300 for (RangeDescriptor *rd = fRangeList; rd != nullptr; rd = rd->fNext) { in mergeCategories()
445 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in getFirstChar()
467 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in printRanges()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Drbbisetb.cpp79 nextRangeDesc = r->fNext; in ~RBBISetBuilder()
143 rlRange = rlRange->fNext; in buildRanges()
185 rlRange = rlRange->fNext; in buildRanges()
205 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
206 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) { in buildRanges()
230 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in buildRanges()
284 for (RangeDescriptor *range = fRangeList; range!=nullptr && U_SUCCESS(*fStatus); range=range->fNext) { in buildTrie()
300 for (RangeDescriptor *rd = fRangeList; rd != nullptr; rd = rd->fNext) { in mergeCategories()
445 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in getFirstChar()
467 for (rlRange = fRangeList; rlRange!=nullptr; rlRange=rlRange->fNext) { in printRanges()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DRBBISetBuilder.java50 RangeDescriptor fNext; // Next RangeDescriptor in the linked list. field in RBBISetBuilder.RangeDescriptor
76 nr.fNext = this.fNext; in split()
77 this.fNext = nr; in split()
194 rlRange = rlRange.fNext; in buildRanges()
227 rlRange = rlRange.fNext; in buildRanges()
245 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildRanges()
246 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) { in buildRanges()
300 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildTrie()
318 for (RangeDescriptor rd = fRangeList; rd != null; rd = rd.fNext) { in mergeCategories()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.cpp39 SSVertex(Vertex* v) : fVertex(v), fPrev(nullptr), fNext(nullptr) {} in SSVertex()
42 SSEdge* fNext; member
47 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) { in SSEdge()
52 SSVertex* fNext; member
66 Vertex* next = e->fNext->fVertex; in makeEvent()
110 for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) { in connectPartners()
112 if ((inner->fPrev || inner->fNext) && (outer->fPrev || outer->fNext)) { in connectPartners()
129 edge->fNext->fVertex->fID); in dump_skel()
145 for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { in removeNonBoundaryEdges()
[all...]
/third_party/skia/src/effects/
H A DSkLayerDrawLooper.cpp41 Rec* next = rec->fNext; in ~SkLayerDrawLooper()
149 fCurrRec = fCurrRec->fNext; in next()
175 rec = rec->fNext; in asABlurShadow()
212 rec = rec->fNext; in flatten()
251 Rec* next = rec->fNext; in ~Builder()
261 rec->fNext = fRecs; in addLayer()
282 rec->fNext = nullptr; in addLayerOnTop()
288 fTopRec->fNext = rec; in addLayerOnTop()

Completed in 21 milliseconds

12345