| /external/skia/src/core/ |
| D | SkTMultiMap.h | 21 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()
137 for (const ValueList* it = &vl; it; it = it->fNext) { in foreach()
[all …]
|
| D | SkStrikeCache.cpp | 110 strikePtr->fPrev->fNext = strikePtr->fNext; in internalFindStrikeOrNull()
111 if (strikePtr->fNext != nullptr) { in internalFindStrikeOrNull()
112 strikePtr->fNext->fPrev = strikePtr->fPrev; in internalFindStrikeOrNull()
117 strikePtr->fNext = fHead; in internalFindStrikeOrNull()
195 for (SkStrike* strike = fHead; strike != nullptr; strike = strike->fNext) { in forEachStrike()
257 SkASSERT(nullptr == strikePtr->fPrev && nullptr == strikePtr->fNext); in internalAttachToHead()
264 strikePtr->fNext = fHead; in internalAttachToHead()
280 strike->fPrev->fNext = strike->fNext; in internalRemoveStrike()
282 fHead = strike->fNext; in internalRemoveStrike()
284 if (strike->fNext) { in internalRemoveStrike()
[all …]
|
| D | SkScanPriv.h | 46 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()
|
| D | SkScan_Path.cpp | 37 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 …]
|
| D | SkStream.cpp | 474 Block* fNext; member
484 fNext = nullptr; in init()
522 Block* next = block->fNext; in reset()
566 fTail->fNext = block; in write()
586 dst->fTail->fNext = fHead; in writeToAndReset()
604 fTail->fNext = dst->fHead; in prependToAndReset()
630 block = block->fNext; in read()
642 block = block->fNext; in copyTo()
648 for (Block* block = fHead; block != nullptr; block = block->fNext) { in writeToStream()
685 Block* next = block->fNext; in copyToAndReset()
[all …]
|
| D | SkResourceCache.cpp | 109 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()
|
| /external/skia/src/base/ |
| D | SkTInternalLList.h | 24 ClassName* fNext = nullptr
43 T* next = entry->fNext; in remove()
46 prev->fNext = next; in remove()
57 entry->fNext = nullptr; in remove()
65 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
69 entry->fNext = fHead; in addToHead()
84 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
88 entry->fNext = nullptr; in addToTail()
90 fTail->fNext = entry; in addToTail()
116 newEntry->fNext = existingEntry; in addBefore()
[all …]
|
| D | SkDeque.cpp | 15 Block* fNext; member
25 fNext = fPrev = nullptr; in init()
64 Block* next = head->fNext; in ~SkDeque()
92 first->fNext = fFrontBlock; in push_front()
133 fBackBlock->fNext = last; in push_back()
162 first = first->fNext; in pop_front()
178 if (nullptr == first->fNext) { in pop_front()
181 SkASSERT(first->fNext->fBegin); in pop_front()
182 fFront = first->fNext->fBegin; in pop_front()
198 last->fNext = nullptr; in pop_back()
[all …]
|
| D | SkBlockAllocator.cpp | 36 : fNext(nullptr) in Block()
110 block->fPrev->fNext = block->fNext; in releaseBlock()
111 if (block->fNext) { in releaseBlock()
113 block->fNext->fPrev = block->fPrev; in releaseBlock()
155 Block* toSteal = other->fHead.fNext; in stealHeapBlocks()
161 fTail->fNext = toSteal; in stealHeapBlocks()
165 other->fHead.fNext = nullptr; in stealHeapBlocks()
174 b->fNext = nullptr; in reset()
186 SkASSERT(fTail == &fHead && fHead.fNext == nullptr && fHead.fPrev == nullptr && in reset()
261 fTail->fNext = new (mem) Block(fTail, allocSize); in addBlock()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | LinkBase.m | 37 @synthesize fNext;
52 fNext = nil;
61 fNext = np;
72 if (fNext) [fNext release];
83 copy.fNext = fNext;
90 node.fNext = (id<LinkList>)self.fNext;
91 if (node.fNext != nil)
92 node.fNext.fPrev = node;
93 self.fNext = node;
99 node.fNext = self;
[all …]
|
| D | HashRule.m | 78 if ( self.fNext != nil ) {
84 tmp = (RuleMemo *)tmp.fNext;
129 if ( self.fNext != nil ) {
135 tmp = (RuleMemo *)tmp.fNext;
146 if ( np.fNext != nil )
147 [self delete_chain:np.fNext];
190 aRule = aRule.fNext;
215 aRule.fNext = ptrBuffer[anIndex];
219 while (aRule.fNext != nil) {
220 aMatchIndex = [((RuleMemo *)aRule.fNext).startIndex integerValue];
[all …]
|
| D | UniqueIDMap.m | 59 fNext = nil;
82 if ( self.fNext != nil ) {
87 tmp = (NodeMapElement *)tmp.fNext;
100 if ( self.fNext != nil ) {
105 tmp = tmp.fNext;
148 if ( np.fNext != nil )
149 [self delete_chain:np.fNext];
164 np = np.fNext;
178 np.fNext = np1;
|
| /external/skia/src/gpu/ganesh/gradients/ |
| D | GrGradientBitmapCache.cpp | 24 Entry* fNext; member
32 fNext(nullptr), in Entry()
60 Entry* next = entry->fNext; in ~GrGradientBitmapCache()
69 entry->fPrev->fNext = entry->fNext; in release()
72 fHead = entry->fNext; in release()
74 if (entry->fNext) { in release()
76 entry->fNext->fPrev = entry->fPrev; in release()
86 entry->fNext = fHead; in attachToHead()
109 entry = entry->fNext; in find()
195 SkASSERT(nullptr == fTail->fNext); in validate()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 64 bounded->fNext = fBounded; in addBounded()
73 SkTSpan* next = prior ? prior->fNext : fHead; in addFollowing()
76 result->fNext = next; in addFollowing()
78 prior->fNext = result; in addFollowing()
132 testBounded = testBounded->fNext; in closestBoundedT()
146 } while ((work = work->fNext)); in debugIsBefore()
157 } while ((work = work->fNext)); in contains()
173 bounded = bounded->fNext; in findOppSpan()
227 fPrev = fNext = nullptr; in init()
360 bounded = bounded->fNext; in oppT()
[all …]
|
| D | SkOpSpan.h | 35 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 != opp) { in oppPrev()
111 oppPrev = oppPrev->fNext; in oppPrev()
[all …]
|
| D | SkOpAngle.cpp | 76 SkOpAngle* rh = lh->fNext; in after()
750 if (angle->fNext) { in insert()
755 } else if (fNext) { in insert()
764 bool singleton = nullptr == fNext; in insert()
766 fNext = this; in insert()
768 SkOpAngle* next = fNext; in insert()
769 if (next->fNext == this) { in insert()
771 this->fNext = angle; in insert()
772 angle->fNext = next; in insert()
774 next->fNext = angle; in insert()
[all …]
|
| /external/skia/src/sksl/lex/ |
| D | NFAState.h | 35 , 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
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | RBBISetBuilder.java | 52 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()
335 for (RangeDescriptor rd = fRangeList; rd != null; rd = rd.fNext) { in mergeCategories()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | RBBISetBuilder.java | 53 RangeDescriptor fNext; // Next RangeDescriptor in the linked list. field in RBBISetBuilder.RangeDescriptor
81 nr.fNext = this.fNext; in split()
82 this.fNext = nr; in split()
188 rlRange = rlRange.fNext; in buildRanges()
221 rlRange = rlRange.fNext; in buildRanges()
241 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildRanges()
242 … for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) { in buildRanges()
266 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildRanges()
318 for (RangeDescriptor rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in buildTrie()
336 for (RangeDescriptor rd = fRangeList; rd != null; rd = rd.fNext) { in mergeCategories()
[all …]
|
| /external/skia/tools/ |
| D | SkMetaData.cpp | 17 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()
|
| /external/cronet/third_party/icu/source/common/ |
| D | rbbisetb.cpp | 79 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 … (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 …]
|
| /external/icu/icu4c/source/common/ |
| D | rbbisetb.cpp | 79 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 … (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 …]
|
| /external/skia/src/gpu/ganesh/geometry/ |
| D | GrAATriangulator.cpp | 42 SSVertex(Vertex* v) : fVertex(v), fPrev(nullptr), fNext(nullptr) {} in SSVertex()
45 SSEdge* fNext; member
50 : fEdge(edge), fEvent(nullptr), fPrev(prev), fNext(next) { in SSEdge()
55 SSVertex* fNext; member
69 Vertex* next = e->fNext->fVertex; in makeEvent()
113 for (Vertex* outer = mesh->fHead; outer; outer = outer->fNext) { in connectPartners()
115 if ((inner->fPrev || inner->fNext) && (outer->fPrev || outer->fNext)) { in connectPartners()
132 edge->fNext->fVertex->fID); in dump_skel()
148 for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { in removeNonBoundaryEdges()
254 Vertex* next = fEdge->fNext->fVertex; in apply()
[all …]
|
| /external/skia/src/effects/ |
| D | SkLayerDrawLooper.cpp | 42 Rec* next = rec->fNext; in ~SkLayerDrawLooper()
150 fCurrRec = fCurrRec->fNext; in next()
176 rec = rec->fNext; in asABlurShadow()
213 rec = rec->fNext; in flatten()
252 Rec* next = rec->fNext; in ~Builder()
262 rec->fNext = fRecs; in addLayer()
283 rec->fNext = nullptr; in addLayerOnTop()
289 fTopRec->fNext = rec; in addLayerOnTop()
|
| /external/cronet/third_party/icu/source/tools/genrb/ |
| D | reslist.cpp | 153 line(0), fNext(NULL) { in SResource()
161 line(0), fNext(NULL) { in SResource()
175 SResource *next = current->fNext; in ~ContainerResource()
198 res->fNext = NULL; in add()
221 current = current->fNext; in add()
229 prev->fNext = res; in add()
232 res->fNext = current; in add()
243 prev->fNext = res; in add()
244 res->fNext = NULL; in add()
254 fLast->fNext = res; in add()
[all …]
|