| /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 | SkTInternalLList.h | 22 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 = existingEntry; in addBefore()
[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 | SkStrikeCache.cpp | 141 strikePtr->fPrev->fNext = strikePtr->fNext; in internalFindStrikeOrNull()
142 if (strikePtr->fNext != nullptr) { in internalFindStrikeOrNull()
143 strikePtr->fNext->fPrev = strikePtr->fPrev; in internalFindStrikeOrNull()
148 strikePtr->fNext = fHead; in internalFindStrikeOrNull()
227 for (Strike* strike = fHead; strike != nullptr; strike = strike->fNext) { in forEachStrike()
289 SkASSERT(nullptr == strikePtr->fPrev && nullptr == strikePtr->fNext); in internalAttachToHead()
296 strikePtr->fNext = fHead; in internalAttachToHead()
312 strike->fPrev->fNext = strike->fNext; in internalRemoveStrike()
314 fHead = strike->fNext; in internalRemoveStrike()
316 if (strike->fNext) { in internalRemoveStrike()
[all …]
|
| D | SkDeque.cpp | 12 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 = nullptr; in pop_back()
[all …]
|
| /external/skqp/src/core/ |
| D | SkTMultiMap.h | 22 explicit ValueList(T* value) : fValue(value), fNext(nullptr) {} in ValueList()
27 ValueList* fNext; member
38 next = cur->fNext; in ~SkTMultiMap()
50 newEntry->fNext = list->fNext; in insert()
53 list->fNext = newEntry; in insert()
73 list = list->fNext; in remove()
80 list = list->fNext; in remove()
105 list = list->fNext; in find()
122 list = list->fNext; in findAndRemove()
151 fList = fList->fNext;
[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 | SkTLS.cpp | 11 SkTLSRec* fNext; member
27 SkTLSRec* next = rec->fNext; in Destructor()
47 } while ((rec = rec->fNext) != nullptr); in Get()
53 rec->fNext = (SkTLSRec*)ptr; in Get()
76 } while ((rec = rec->fNext) != nullptr); in Find()
91 SkTLSRec* next = curr->fNext; in Delete()
94 prev->fNext = next; in Delete()
|
| D | SkDeque.cpp | 12 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()
194 last->fNext = nullptr; in pop_back()
[all …]
|
| 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()
112 SkEdge* currE = prevHead->fNext; in walk_edges()
[all …]
|
| /external/skqp/include/private/ |
| D | SkTInternalLList.h | 37 SkPtrWrapper<ClassName> fNext
59 T* next = entry->fNext; in remove()
62 prev->fNext = next; in remove()
73 entry->fNext = nullptr; in remove()
81 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
85 entry->fNext = fHead; in addToHead()
100 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
104 entry->fNext = nullptr; in addToTail()
106 fTail->fNext = entry; in addToTail()
132 newEntry->fNext = existingEntry; in addBefore()
[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 …]
|
| /external/skqp/src/gpu/ |
| D | GrTRecorder.h | 123 block->fNext = nullptr; in Alloc()
126 SkASSERT(nullptr == prev->fNext); in Alloc()
127 prev->fNext = block; in Alloc()
135 SkASSERT(block->fPrev->fNext == block); in Free()
136 block->fPrev->fNext = nullptr; in Free()
139 MemBlock* next = block->fNext; in Free()
151 MemBlock* fNext; member
214 if (!fTailBlock->fNext) { in alloc_back()
217 fTailBlock = fTailBlock->fNext; in alloc_back()
259 if (!fBlock->fNext) { in next()
[all …]
|
| /external/skqp/experimental/svg/model/ |
| D | SkPEG.h | 26 MatchResult(std::nullptr_t) : fNext(nullptr) {} in MatchResult()
27 MatchResult(const char* next, const V& v) : fNext(next), fValue(&v) {} in MatchResult()
30 SkASSERT(fValue.isValid() == SkToBool(fNext));
31 return SkToBool(fNext);
37 const char* fNext; member
59 return m ? MatchT(m.fNext, V(m.fValue.get())) in Match()
128 const auto tailMatch = Seq<Es...>::Match(headMatch.fNext);
129 return tailMatch ? MatchT(tailMatch.fNext, V(*headMatch, *tailMatch))
157 return MatchT(m1.fNext, V(m1.fValue.get(), nullptr));
160 return MatchT(m2.fNext, V(nullptr, m2.fValue.get()));
[all …]
|
| /external/skqp/src/gpu/gradients/ |
| D | GrGradientBitmapCache.cpp | 20 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()
221 SkASSERT(nullptr == fTail->fNext); in validate()
[all …]
|
| /external/skia/src/gpu/gradients/ |
| D | GrGradientBitmapCache.cpp | 20 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()
221 SkASSERT(nullptr == fTail->fNext); in validate()
[all …]
|
| /external/skqp/src/pathops/ |
| D | SkPathOpsTSect.cpp | 50 bounded->fNext = fBounded; in addBounded()
59 SkTSpan* next = prior ? prior->fNext : fHead; in addFollowing()
62 result->fNext = next; in addFollowing()
64 prior->fNext = result; in addFollowing()
118 testBounded = testBounded->fNext; in closestBoundedT()
132 } while ((work = work->fNext)); in debugIsBefore()
143 } while ((work = work->fNext)); in contains()
159 bounded = bounded->fNext; in findOppSpan()
214 fPrev = fNext = nullptr; in init()
347 bounded = bounded->fNext; in oppT()
[all …]
|
| /external/skia/src/pathops/ |
| D | SkPathOpsTSect.cpp | 51 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 …]
|
| /external/skia/src/gpu/ |
| D | GrBlockAllocator.cpp | 32 : 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 == nullptr && fHead.fPrev == nullptr && in reset()
257 fTail->fNext = new (mem) Block(fTail, allocSize); in addBlock()
[all …]
|
| /external/skqp/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()
88 for (int v : fNext) { in description()
98 for (int v : fNext) { in description()
126 for (int n : fNext) { in description()
147 std::vector<int> fNext; member
|
| /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/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/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/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 …]
|