Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:fnext (Results 26 - 50 of 234) sorted by null

12 3 4 5 6 7 8 910

/external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRUniqueIDMap.m	59 fNext = nil; 82 if ( self.fNext != nil ) { 87 tmp = (ANTLRNodeMapElement *)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;
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...]
ANTLRPtrStack.h	19 //ANTLRPtrStack *fNext; 23 //@property (copy) ANTLRPtrStack *fNext;
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/chromium_org/third_party/skia/src/gpu/
GrTextStrike_impl.h	36 strike->fPrev->fNext = strike->fNext; 39 fHead = strike->fNext; 42 if (strike->fNext) { 44 strike->fNext->fPrev = strike->fPrev; 68 strike->fNext = fHead;
GrMemoryPool.cpp	26 fHead->fNext = NULL; 49 block->fNext = NULL; 50 SkASSERT(NULL == fTail->fNext); 51 fTail->fNext = block; 82 BlockHeader* next = block->fNext; 84 prev->fNext = next; 131 SkASSERT(prev->fNext == block); 157 } while ((block = block->fNext));
GrAllocPool.cpp	15 Block* fNext; 24 block->fNext = next; 71 Block* next = block->fNext; 96 Block* next = fBlock->fNext; 111 block = block->fNext;
GrAtlas.cpp	51 , fNext(NULL) 140 currPlot->fNext = fFreePlots; 167 plotIter = plotIter->fNext; 199 newPlot->fNext = atlas->fPlots; 214 *plotRef = plot->fNext; 219 plotRef = &plot->fNext; 220 plot = plot->fNext; 229 GrPlot* next = plot->fNext; 240 fFreePlots = alloc->fNext; 254 plot->fNext = fFreePlots     [all...]
/external/skia/src/gpu/
GrTextStrike_impl.h	36 strike->fPrev->fNext = strike->fNext; 39 fHead = strike->fNext; 42 if (strike->fNext) { 44 strike->fNext->fPrev = strike->fPrev; 68 strike->fNext = fHead;
GrMemoryPool.cpp	26 fHead->fNext = NULL; 49 block->fNext = NULL; 50 SkASSERT(NULL == fTail->fNext); 51 fTail->fNext = block; 82 BlockHeader* next = block->fNext; 84 prev->fNext = next; 131 SkASSERT(prev->fNext == block); 157 } while ((block = block->fNext));
GrAllocPool.cpp	15 Block* fNext; 24 block->fNext = next; 71 Block* next = block->fNext; 96 Block* next = fBlock->fNext; 111 block = block->fNext;
GrAtlas.cpp	51 , fNext(NULL) 140 currPlot->fNext = fFreePlots; 167 plotIter = plotIter->fNext; 199 newPlot->fNext = atlas->fPlots; 214 *plotRef = plot->fNext; 219 plotRef = &plot->fNext; 220 plot = plot->fNext; 229 GrPlot* next = plot->fNext; 240 fFreePlots = alloc->fNext; 254 plot->fNext = fFreePlots     [all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
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/
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/
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/chromium_org/third_party/skia/src/images/
SkImageRefPool.cpp	87 ref->fNext = fHead; 106 ref->fNext = NULL; 110 SkASSERT(NULL == fTail->fNext); 111 fTail->fNext = ref; 128 fHead = ref->fNext; 134 ref->fPrev->fNext = ref->fNext; 136 if (ref->fNext) { 137 ref->fNext->fPrev = ref->fPrev; 140 ref->fNext = ref->fPrev = NULL     [all...]
/external/skia/src/images/
SkImageRefPool.cpp	87 ref->fNext = fHead; 106 ref->fNext = NULL; 110 SkASSERT(NULL == fTail->fNext); 111 fTail->fNext = ref; 128 fHead = ref->fNext; 134 ref->fPrev->fNext = ref->fNext; 136 if (ref->fNext) { 137 ref->fNext->fPrev = ref->fPrev; 140 ref->fNext = ref->fPrev = NULL     [all...]
/external/chromium_org/third_party/skia/src/core/
SkChunkAlloc.cpp	21 Block* fNext; 32 Block* next = block->fNext; 82 // block->fNext = fBlock; 106 block->fNext = fBlock; 139 block = block->fNext;
SkDeque.cpp	13 Block* fNext; 23 fNext = fPrev = NULL; 62 Block* next = head->fNext; 90 first->fNext = fFrontBlock; 131 fBackBlock->fNext = last; 160 first = first->fNext; 176 if (NULL == first->fNext) { 179 SkASSERT(NULL != first->fNext->fBegin); 180 fFront = first->fNext->fBegin; 195 last->fNext = NULL     [all...]
SkWriter32.cpp	31 block = block->fNext; 34 Block* next = block->fNext; 67 block->fNext = fTail; 89 block = block->fNext; 122 block = block->fNext; 133 Block* next = block->fNext; 134 block->fNext = NULL; 138 Block* next = block->fNext; 154 block = block->fNext; 210 block = block->fNext;     [all...]
/external/skia/src/core/
SkChunkAlloc.cpp	21 Block* fNext; 32 Block* next = block->fNext; 82 // block->fNext = fBlock; 106 block->fNext = fBlock; 139 block = block->fNext;
SkDeque.cpp	13 Block* fNext; 23 fNext = fPrev = NULL; 62 Block* next = head->fNext; 90 first->fNext = fFrontBlock; 131 fBackBlock->fNext = last; 160 first = first->fNext; 176 if (NULL == first->fNext) { 179 SkASSERT(NULL != first->fNext->fBegin); 180 fFront = first->fNext->fBegin; 195 last->fNext = NULL     [all...]
SkWriter32.cpp	31 block = block->fNext; 34 Block* next = block->fNext; 67 block->fNext = fTail; 89 block = block->fNext; 122 block = block->fNext; 133 Block* next = block->fNext; 134 block->fNext = NULL; 138 Block* next = block->fNext; 154 block = block->fNext; 210 block = block->fNext;     [all...]
/external/chromium_org/third_party/skia/src/gpu/effects/
GrTextureStripAtlas.cpp	228 fRows[i].fNext = NULL; 233 SkASSERT(NULL == fLRUBack || NULL == fLRUBack->fNext); 237 SkASSERT(NULL == row->fPrev && NULL == row->fNext); 243 fLRUBack->fNext = row; 250 if (NULL != row->fNext && NULL != row->fPrev) { 251 row->fPrev->fNext = row->fNext; 252 row->fNext->fPrev = row->fPrev; 254 if (NULL == row->fNext) { 258 fLRUBack->fNext = NULL     [all...]
/external/skia/src/gpu/effects/
GrTextureStripAtlas.cpp	228 fRows[i].fNext = NULL; 233 SkASSERT(NULL == fLRUBack || NULL == fLRUBack->fNext); 237 SkASSERT(NULL == row->fPrev && NULL == row->fNext); 243 fLRUBack->fNext = row; 250 if (NULL != row->fNext && NULL != row->fPrev) { 251 row->fPrev->fNext = row->fNext; 252 row->fNext->fPrev = row->fPrev; 254 if (NULL == row->fNext) { 258 fLRUBack->fNext = NULL     [all...]

Completed in 588 milliseconds

12 3 4 5 6 7 8 910