/external/skia/src/core/ |
D | SkTInternalLList.h | 36 SkPtrWrapper<ClassName> fNext 53 T* next = entry->fNext; in remove() 56 prev->fNext = next; in remove() 67 entry->fNext = NULL; in remove() 75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext); in addToHead() 79 entry->fNext = fHead; in addToHead() 94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext); in addToTail() 98 entry->fNext = NULL; in addToTail() 100 fTail->fNext = entry; in addToTail() 126 newEntry->fNext = existingEntry; in addBefore() [all …]
|
D | SkTMultiMap.h | 23 explicit ValueList(T* value) : fValue(value), fNext(nullptr) {} in ValueList() 28 ValueList* fNext; member 44 newEntry->fNext = list->fNext; in insert() 47 list->fNext = newEntry; in insert() 64 list = list->fNext; in remove() 67 if (list->fNext) { in remove() 68 ValueList* next = list->fNext; in remove() 70 list->fNext = next->fNext; in remove() 73 prev->fNext = nullptr; in remove() 98 list = list->fNext; in find() [all …]
|
D | SkRefDict.cpp | 14 Impl* fNext; member 35 rec = rec->fNext; in find() 58 prev->fNext = rec->fNext; in set() 60 fImpl = rec->fNext; in set() 67 rec = rec->fNext; in set() 76 rec->fNext = fImpl; in set() 83 Impl* next = rec->fNext; in removeAll()
|
D | SkScan_Path.cpp | 32 edge = edge->fNext; in validate_sort() 40 edge->fPrev->fNext = edge->fNext; in remove_edge() 41 edge->fNext->fPrev = edge->fPrev; in remove_edge() 46 edge->fNext = afterMe->fNext; in insert_edge_after() 47 afterMe->fNext->fPrev = edge; in insert_edge_after() 48 afterMe->fNext = edge; in insert_edge_after() 58 if (prev->fNext != edge) { in backward_insert_edge_based_on_x() 87 SkEdge* next = newEdge->fNext; in insert_new_edges() 89 if (start->fNext == newEdge) { in insert_new_edges() 92 SkEdge* after = start->fNext; in insert_new_edges() [all …]
|
D | SkTLS.cpp | 20 SkTLSRec* fNext; member 52 SkTLSRec* next = rec->fNext; in Destructor() 72 } while ((rec = rec->fNext) != nullptr); in Get() 78 rec->fNext = (SkTLSRec*)ptr; in Get() 101 } while ((rec = rec->fNext) != nullptr); in Find() 116 SkTLSRec* next = curr->fNext; in Delete() 119 prev->fNext = next; in Delete()
|
D | SkDeque.cpp | 13 Block* fNext; member 23 fNext = fPrev = nullptr; in init() 62 Block* next = head->fNext; in ~SkDeque() 90 first->fNext = fFrontBlock; in push_front() 131 fBackBlock->fNext = last; in push_back() 160 first = first->fNext; in pop_front() 176 if (nullptr == first->fNext) { in pop_front() 179 SkASSERT(first->fNext->fBegin); in pop_front() 180 fFront = first->fNext->fBegin; in pop_front() 195 last->fNext = nullptr; in pop_back() [all …]
|
D | SkLinearBitmapPipeline.cpp | 132 : fNext{next} in PointProcessor() 137 fNext->pointListFew(n, xs, ys); in pointListFew() 142 fNext->pointList4(xs, ys); in pointList4() 146 if (!fStrategy.maybeProcessSpan(start, length, count, fNext)) { in pointSpan() 152 Next* const fNext; member in __anonfaf87f990111::PointProcessor 162 : fNext{next} in BilerpProcessor() 167 fNext->pointListFew(n, xs, ys); in pointListFew() 172 fNext->pointList4(xs, ys); in pointList4() 177 fNext->bilerpList(xs, ys); in bilerpList() 181 if (!fStrategy.maybeProcessSpan(start, length, count, fNext)) { in pointSpan() [all …]
|
/external/skia/src/effects/gradients/ |
D | SkGradientBitmapCache.cpp | 14 Entry* fNext; member 22 fNext(nullptr), in Entry() 48 Entry* next = entry->fNext; in ~SkGradientBitmapCache() 57 entry->fPrev->fNext = entry->fNext; in detach() 60 fHead = entry->fNext; in detach() 62 if (entry->fNext) { in detach() 64 entry->fNext->fPrev = entry->fPrev; in detach() 74 entry->fNext = fHead; in attachToHead() 97 entry = entry->fNext; in find() 125 SkASSERT(nullptr == fTail->fNext); in validate() [all …]
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
D | ANTLRLinkBase.m | 37 @synthesize fNext; 52 fNext = nil; 61 fNext = np; 72 if (fNext) [fNext dealloc]; 83 copy.fNext = fNext; 90 node.fNext = (id<ANTLRLinkList>)self.fNext; 91 if (node.fNext != nil) 92 node.fNext.fPrev = node; 93 self.fNext = node; 99 node.fNext = self; [all …]
|
D | ANTLRHashRule.m | 78 if ( self.fNext != nil ) { 84 tmp = (ANTLRRuleMemo *)tmp.fNext; 129 if ( self.fNext != nil ) { 135 tmp = (ANTLRRuleMemo *)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 = [((ANTLRRuleMemo *)aRule.fNext).startIndex integerValue]; [all …]
|
D | ANTLRHashMap.m | 60 fNext = nil; 66 if ( fNext != nil ) { 67 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 69 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 82 fNext = nil; 88 if ( fNext != nil ) { 89 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 91 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 107 if ( self.fNext != nil ) { 110 while ( tmp && tmp != [((ANTLRHashMap *)fNext) getptrBufferEntry:idx] ) { [all …]
|
/external/skia/src/gpu/effects/ |
D | GrTextureStripAtlas.cpp | 231 fRows[i].fNext = nullptr; in initLRU() 236 SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext); in initLRU() 240 SkASSERT(nullptr == row->fPrev && nullptr == row->fNext); in appendLRU() 246 fLRUBack->fNext = row; in appendLRU() 253 if (row->fNext && row->fPrev) { in removeFromLRU() 254 row->fPrev->fNext = row->fNext; in removeFromLRU() 255 row->fNext->fPrev = row->fPrev; in removeFromLRU() 257 if (nullptr == row->fNext) { in removeFromLRU() 261 fLRUBack->fNext = nullptr; in removeFromLRU() 266 fLRUFront = row->fNext; in removeFromLRU() [all …]
|
/external/skia/src/gpu/ |
D | GrTRecorder.h | 122 block->fNext = nullptr; in Alloc() 125 SkASSERT(nullptr == prev->fNext); in Alloc() 126 prev->fNext = block; in Alloc() 134 SkASSERT(block->fPrev->fNext == block); in Free() 135 block->fPrev->fNext = nullptr; in Free() 138 MemBlock* next = block->fNext; in Free() 150 MemBlock* fNext; member 213 if (!fTailBlock->fNext) { in alloc_back() 216 fTailBlock = fTailBlock->fNext; in alloc_back() 258 if (!fBlock->fNext) { in next() [all …]
|
D | GrTessellator.cpp | 140 : fPoint(point), fPrev(nullptr), fNext(nullptr) in Vertex() 150 Vertex* fNext; // " member 315 , fNext(nullptr) in Poly() 332 , fNext(nullptr) {} in MonotonePoly() 337 MonotonePoly* fNext; member 350 fTail->fNext = newV; in addVertex() 353 newV->fNext = fHead; in addVertex() 362 Vertex* v = first->fNext; in emit() 364 SkASSERT(v && v->fPrev && v->fNext); in emit() 367 Vertex* next = v->fNext; in emit() [all …]
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
D | ANTLRHashRule.m | 62 fNext = nil; 70 fNext = nil; 81 if ( self.fNext != nil ) { 87 tmp = (ANTLRRuleMemo *)tmp.fNext; 133 if ( self.fNext != nil ) { 138 tmp = tmp.fNext; 147 if ( np.fNext != nil ) 148 [self delete_chain:np.fNext]; 191 aRule = aRule.fNext; 215 aRule.fNext = ptrBuffer[anIndex]; [all …]
|
D | ANTLRHashMap.m | 66 fNext = nil; 69 if ( fNext != nil ) { 70 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 72 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 85 fNext = nil; 88 if ( fNext != nil ) { 89 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 91 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 104 if ( self.fNext != nil ) { 107 while ( tmp && tmp != [((ANTLRHashMap *)fNext) getptrBufferEntry:idx] ) { [all …]
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
D | ANTLRHashRule.m | 62 fNext = nil; 70 fNext = nil; 81 if ( self.fNext != nil ) { 87 tmp = (ANTLRRuleMemo *)tmp.fNext; 133 if ( self.fNext != nil ) { 138 tmp = tmp.fNext; 147 if ( np.fNext != nil ) 148 [self delete_chain:np.fNext]; 191 aRule = aRule.fNext; 215 aRule.fNext = ptrBuffer[anIndex]; [all …]
|
D | ANTLRHashMap.m | 66 fNext = nil; 69 if ( fNext != nil ) { 70 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 72 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 85 fNext = nil; 88 if ( fNext != nil ) { 89 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 91 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 104 if ( self.fNext != nil ) { 107 while ( tmp && tmp != [((ANTLRHashMap *)fNext) getptrBufferEntry:idx] ) { [all …]
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
D | ANTLRHashRule.m | 62 fNext = nil; 70 fNext = nil; 81 if ( self.fNext != nil ) { 87 tmp = (ANTLRRuleMemo *)tmp.fNext; 133 if ( self.fNext != nil ) { 138 tmp = tmp.fNext; 147 if ( np.fNext != nil ) 148 [self delete_chain:np.fNext]; 191 aRule = aRule.fNext; 215 aRule.fNext = ptrBuffer[anIndex]; [all …]
|
D | ANTLRHashMap.m | 66 fNext = nil; 69 if ( fNext != nil ) { 70 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 72 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 85 fNext = nil; 88 if ( fNext != nil ) { 89 Scope = ((ANTLRHashMap *)fNext)->Scope+1; 91 ptrBuffer[idx] = ((ANTLRHashMap *)fNext)->ptrBuffer[idx]; 104 if ( self.fNext != nil ) { 107 while ( tmp && tmp != [((ANTLRHashMap *)fNext) getptrBufferEntry:idx] ) { [all …]
|
/external/icu/icu4c/source/common/ |
D | rbbisetb.cpp | 113 nextRangeDesc = r->fNext; in ~RBBISetBuilder() 176 rlRange = rlRange->fNext; in build() 218 rlRange = rlRange->fNext; in build() 236 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) { in build() 237 … for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) { in build() 296 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) { in build() 417 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) { in getFirstChar() 440 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) { in printRanges() 475 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) { in printRangeGroups() 497 for (tRange = rlRange; tRange != 0; tRange = tRange->fNext) { in printRangeGroups() [all …]
|
/external/skia/src/pathops/ |
D | SkOpSpan.h | 32 SkOpPtT* oppPrev = opp->fNext; in addOpp() 36 while (oppPrev->fNext != opp) { in addOpp() 37 oppPrev = oppPrev->fNext; in addOpp() 43 SkOpPtT* oldNext = this->fNext; in addOpp() 45 this->fNext = opp; in addOpp() 47 oppPrev->fNext = oldNext; in addOpp() 91 span->fNext = fNext; in insert() 92 fNext = span; in insert() 96 return fNext; in next() 100 return fNext; in next() [all …]
|
D | SkOpSpan.cpp | 56 SkOpPtT* ptT = fNext; in doppelganger() 58 ptT = ptT->fNext; in doppelganger() 65 ptT = ptT->fNext; in doppelganger() 78 ptT = ptT->fNext; in find() 92 fNext = this; in init() 110 while ((next = next->fNext) != this) { in prev() 113 SkASSERT(result->fNext == this); in prev() 120 SkOpPtT* next = prev->fNext; in remove() 123 SkASSERT(prev->fNext != prev); in remove() 134 SkASSERT(this->fNext); in removeNext() [all …]
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | RBBISetBuilder.java | 46 RangeDescriptor fNext; // Next RangeDescriptor in the linked list. field in RBBISetBuilder.RangeDescriptor 72 nr.fNext = this.fNext; in split() 73 this.fNext = nr; in split() 187 rlRange = rlRange.fNext; in build() 220 rlRange = rlRange.fNext; in build() 238 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in build() 239 … for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) { in build() 292 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in build() 424 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in getFirstChar() 447 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in printRanges() [all …]
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | RBBISetBuilder.java | 45 RangeDescriptor fNext; // Next RangeDescriptor in the linked list. field in RBBISetBuilder.RangeDescriptor 71 nr.fNext = this.fNext; in split() 72 this.fNext = nr; in split() 186 rlRange = rlRange.fNext; in build() 219 rlRange = rlRange.fNext; in build() 237 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in build() 238 … for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) { in build() 291 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in build() 423 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in getFirstChar() 446 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) { in printRanges() [all …]
|