| /external/skia/include/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 …]
|
| /external/skia/src/core/ |
| D | SkTMultiMap.h | 23 explicit ValueList(T* value) : fValue(value), fNext(NULL) {} 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 = NULL; 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()
68 SkEdge* next = newEdge->fNext; in insert_new_edges()
77 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
78 SkASSERT(edge->fPrev->fNext == edge); in validate_edges_for_y()
[all …]
|
| D | SkTLS.cpp | 13 SkTLSRec* fNext; member
45 SkTLSRec* next = rec->fNext; in Destructor()
65 } while ((rec = rec->fNext) != NULL); in Get()
71 rec->fNext = (SkTLSRec*)ptr; in Get()
94 } while ((rec = rec->fNext) != NULL); in Find()
109 SkTLSRec* next = curr->fNext; in Delete()
112 prev->fNext = next; in Delete()
|
| D | SkDeque.cpp | 13 Block* fNext; member
23 fNext = fPrev = NULL; 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 (NULL == first->fNext) { in pop_front()
179 SkASSERT(first->fNext->fBegin); in pop_front()
180 fFront = first->fNext->fBegin; in pop_front()
195 last->fNext = NULL; in pop_back()
[all …]
|
| D | SkChunkAlloc.cpp | 21 Block* fNext; member
33 fNext = NULL; in reset()
44 Block* next = block->fNext; in FreeChain()
93 for (Block* cur = largest->fNext; cur; cur = next) { in rewind()
94 next = cur->fNext; in rewind()
152 block->fNext = fBlock; in addBlockIfNecessary()
204 block = block->fNext; in contains()
217 for (Block* temp = fBlock; temp; temp = temp->fNext) { in validate()
|
| /external/skia/src/effects/gradients/ |
| D | SkGradientBitmapCache.cpp | 14 Entry* fNext; member
22 fNext(NULL), 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(NULL == 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 | 233 fRows[i].fNext = NULL; in initLRU()
238 SkASSERT(NULL == fLRUBack || NULL == fLRUBack->fNext); in initLRU()
242 SkASSERT(NULL == row->fPrev && NULL == row->fNext); in appendLRU()
248 fLRUBack->fNext = row; in appendLRU()
255 if (row->fNext && row->fPrev) { in removeFromLRU()
256 row->fPrev->fNext = row->fNext; in removeFromLRU()
257 row->fNext->fPrev = row->fPrev; in removeFromLRU()
259 if (NULL == row->fNext) { in removeFromLRU()
263 fLRUBack->fNext = NULL; in removeFromLRU()
268 fLRUFront = row->fNext; in removeFromLRU()
[all …]
|
| /external/skia/src/gpu/ |
| D | GrTRecorder.h | 123 block->fNext = NULL; in Alloc()
126 SkASSERT(NULL == prev->fNext); in Alloc()
127 prev->fNext = block; in Alloc()
135 SkASSERT(block->fPrev->fNext == block); in Free()
136 block->fPrev->fNext = NULL; in Free()
139 MemBlock* next = block->fNext; in Free()
151 MemBlock* fNext; member
215 if (!fTailBlock->fNext) { in alloc_back()
218 fTailBlock = fTailBlock->fNext; in alloc_back()
261 if (!fBlock->fNext) { in next()
[all …]
|
| D | GrTessellatingPathRenderer.cpp | 142 : fPoint(point), fPrev(NULL), fNext(NULL) in Vertex()
152 Vertex* fNext; // " member
317 , fNext(NULL) in Poly()
334 , fNext(NULL) {} in MonotonePoly()
339 MonotonePoly* fNext; member
352 fTail->fNext = newV; in addVertex()
355 newV->fNext = fHead; in addVertex()
364 Vertex* v = first->fNext; in emit()
366 SkASSERT(v && v->fPrev && v->fNext); in emit()
369 Vertex* next = v->fNext; in emit()
[all …]
|
| D | GrMemoryPool.cpp | 28 fHead->fNext = NULL; in GrMemoryPool()
51 block->fNext = NULL; in allocate()
52 SkASSERT(NULL == fTail->fNext); in allocate()
53 fTail->fNext = block; in allocate()
86 BlockHeader* next = block->fNext; in release()
88 prev->fNext = next; in release()
139 SkASSERT(prev->fNext == block); in validate()
165 } while ((block = block->fNext)); in validate()
|
| /external/skia/src/pathops/ |
| D | SkOpSpan.h | 31 SkOpPtT* oppPrev = opp->fNext; in addOpp()
35 while (oppPrev->fNext != opp) { in addOpp()
36 oppPrev = oppPrev->fNext; in addOpp()
42 SkOpPtT* oldNext = this->fNext; in addOpp()
44 this->fNext = opp; in addOpp()
46 oppPrev->fNext = oldNext; in addOpp()
82 span->fNext = fNext; in insert()
83 fNext = span; in insert()
87 return fNext; in next()
91 return fNext; in next()
[all …]
|
| D | SkPathOpsTSect.h | 63 SkTSpanBounded* fNext; member
127 return fNext; in next()
182 SkTSpan* fNext; variable
355 bounded->fNext = fBounded; in addBounded()
364 SkTSpan<TCurve, OppCurve>* next = prior ? prior->fNext : fHead; in addFollowing()
367 result->fNext = next; in addFollowing()
369 prior->fNext = result; in addFollowing()
423 testBounded = testBounded->fNext; in closestBoundedT()
437 } while ((work = work->fNext)); in debugIsBefore()
449 } while ((work = work->fNext)); in contains()
[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/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/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/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/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 …]
|