/external/skia/samplecode/ |
H A D | TransitionView.cpp | 42 fNext = next; 43 fNext->setClipToBounds(true); 44 fNext->setVisibleP(true); 45 (void)SampleView::SetUsePipe(fNext, SkOSMenu::kOffState); 47 //is now the sole owner of fNext 48 this->attachChildToFront(fNext)->unref(); 59 if (SampleView::IsSampleView(fNext)) 60 ((SampleView*)fNext)->requestMenu(menu); 67 if (SampleCode::RequestTitle(fNext, &title)) { 95 fNext 175 SkView* fNext; member in class:TransitionView [all...] |
/external/skia/src/core/ |
H A D | SkAdvancedTypefaceMetrics.cpp | 198 curRange = appendRange(&curRange->fNext, gId); 211 curRange = appendRange(&curRange->fNext, gId); 218 curRange = appendRange(&curRange->fNext, gId); 227 appendRange(&curRange->fNext, 233 curRange = appendRange(&curRange->fNext, gId); 247 SkASSERT(prevRange->fNext->fStartId == lastIndex); 248 prevRange->fNext.free();
|
H A D | SkCanvas.cpp | 116 DeviceCM* fNext; member in struct:DeviceCM 123 : fNext(NULL) { 236 // don't bother initializing fNext 266 fCurrLayer = fCurrLayer->fNext; 281 fCurrLayer = rec->fNext; 772 if (NULL == layer->fNext) { // only one layer 778 } while ((layer = layer->fNext) != NULL); 937 layer->fNext = fMCRec->fTopLayer; 993 if (layer->fNext) {
|
H A D | SkChunkAlloc.cpp | 21 Block* fNext; member in struct:SkChunkAlloc::Block 32 Block* next = block->fNext; 82 // block->fNext = fBlock; 106 block->fNext = fBlock; 139 block = block->fNext;
|
H A D | SkDeque.cpp | 13 Block* fNext; member in struct:SkDeque::Block 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 [all...] |
H A D | SkEdge.h | 27 SkEdge* fNext; member in struct:SkEdge 57 SkASSERT(fPrev && fNext); 58 SkASSERT(fPrev->fNext == this); 59 SkASSERT(fNext->fPrev == this);
|
H A D | SkGlyphCache.cpp | 82 fPrev = fNext = NULL; 417 rec = rec->fNext; 433 rec = rec->fNext; 439 rec->fNext = fAuxProcList; 447 AuxProcRec* next = rec->fNext; 498 for (cache = globals.internalGetHead(); cache != NULL; cache = cache->fNext) { 529 for (cache = globals.internalGetHead(); cache != NULL; cache = cache->fNext) { 574 SkASSERT(cache->fNext == NULL); 594 while (cache->fNext) { 595 cache = cache->fNext; [all...] |
H A D | SkGlyphCache.h | 204 SkGlyphCache* fNext, *fPrev; member in class:SkGlyphCache 235 AuxProcRec* fNext; member in struct:SkGlyphCache::AuxProcRec
|
H A D | SkGlyphCache_Globals.h | 46 SkGlyphCache* next = cache->fNext;
|
H A D | SkMetaData.cpp | 54 Rec* next = rec->fNext; 69 rec = rec->fNext; 140 rec->fNext = fRec; 240 rec = rec->fNext; 249 Rec* next = rec->fNext; 252 prev->fNext = next; 323 fRec = fRec->fNext;
|
H A D | SkRefDict.cpp | 14 Impl* fNext; member in struct:SkRefDict::Impl 35 rec = rec->fNext; 58 prev->fNext = rec->fNext; 60 fImpl = rec->fNext; 67 rec = rec->fNext; 76 rec->fNext = fImpl; 83 Impl* next = rec->fNext;
|
H A D | SkRegion_path.cpp | 381 Edge* fNext; member in struct:Edge 390 SkDEBUGCODE(fNext = NULL;) 402 SkASSERT(base->fNext); 416 SkASSERT(NULL == e->fNext); 417 e->fNext = base; 429 SkASSERT(NULL == base->fNext); 430 base->fNext = e; 449 edge = edge->fNext; 461 edge = edge->fNext; 515 SkASSERT(e->fNext ! [all...] |
H A D | SkScaledImageCache.cpp | 125 Rec* fNext; member in struct:SkScaledImageCache::Rec 154 rec = rec->fNext; 309 Rec* next = rec->fNext; 481 rec = rec->fNext; 552 Rec* next = rec->fNext; 558 prev->fNext = next; 567 rec->fNext = rec->fPrev = NULL; 583 rec->fNext = fHead; 593 rec->fNext = fHead; 619 SkASSERT(NULL == fHead->fNext); [all...] |
H A D | SkScan_Path.cpp | 36 edge = edge->fNext; 44 edge->fPrev->fNext = edge->fNext; 45 edge->fNext->fPrev = edge->fPrev; 49 SkASSERT(prev->fNext == next && next->fPrev == prev); 52 prev->fPrev->fNext = next; 56 prev->fNext = next->fNext; 57 next->fNext->fPrev = prev; 58 next->fNext [all...] |
H A D | SkStream.cpp | 499 Block* fNext; member in struct:SkDynamicMemoryWStream::Block 510 fNext = NULL; 541 Block* next = block->fNext; 573 fTail->fNext = block; 601 block = block->fNext; 622 block = block->fNext; 638 block = block->fNext; 677 SkDynamicMemoryWStream::Block* next = block->fNext; 715 fCurrent = fCurrent->fNext; 775 if (NULL == fBlockMemory->fHead->fNext) { [all...] |
H A D | SkTLS.cpp | 13 SkTLSRec* fNext; member in struct:SkTLSRec 45 SkTLSRec* next = rec->fNext; 65 } while ((rec = rec->fNext) != NULL); 71 rec->fNext = (SkTLSRec*)ptr; 94 } while ((rec = rec->fNext) != NULL); 109 SkTLSRec* next = curr->fNext; 112 prev->fNext = next;
|
/external/skia/src/effects/ |
H A D | SkLayerDrawLooper.cpp | 33 Rec* next = rec->fNext; 151 fCurrRec = fCurrRec->fNext; 178 rec = rec->fNext; 210 rec = rec->fNext; 229 rec = rec->fNext; 256 rec = rec->fNext; 319 rec = rec->fNext; 333 Rec* next = rec->fNext; 343 rec->fNext = fRecs; 364 rec->fNext [all...] |
/external/skia/src/effects/gradients/ |
H A D | SkBitmapCache.cpp | 14 Entry* fNext; member in struct:SkBitmapCache::Entry 22 fNext(NULL), 48 Entry* next = entry->fNext; 57 entry->fPrev->fNext = entry->fNext; 60 fHead = entry->fNext; 62 if (entry->fNext) { 64 entry->fNext->fPrev = entry->fPrev; 74 entry->fNext = fHead; 97 entry = entry->fNext; [all...] |
/external/skia/src/gpu/ |
H A D | GrAllocPool.cpp | 15 Block* fNext; member in struct:GrAllocPool::Block 24 block->fNext = next; 71 Block* next = block->fNext; 96 Block* next = fBlock->fNext; 111 block = block->fNext;
|
H A D | 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));
|
H A D | GrMemoryPool.h | 56 BlockHeader* fNext; ///< doubly-linked list of blocks. member in struct:GrMemoryPool::BlockHeader
|
H A D | GrTMultiMap.h | 23 explicit ValueList(T* value) : fValue(value), fNext(NULL) {} 28 ValueList* fNext; member in struct:GrTMultiMap::ValueList 44 newEntry->fNext = list->fNext; 47 list->fNext = newEntry; 64 list = list->fNext; 67 if (NULL != list->fNext) { 68 ValueList* next = list->fNext; 70 list->fNext = next->fNext; [all...] |
H A D | GrTextStrike.cpp | 102 strike->fNext = fHead; 139 strike = strike->fNext; 144 strike = strikeToPurge->fNext; 176 strike = strike->fNext;
|
H A D | GrTextStrike.h | 53 GrTextStrike* fNext; member in class:GrTextStrike
|
H A D | GrTextStrike_impl.h | 36 strike->fPrev->fNext = strike->fNext; 39 fHead = strike->fNext; 42 if (strike->fNext) { 44 strike->fNext->fPrev = strike->fPrev; 64 strike->fNext = fHead;
|