/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrMemoryPool.cpp | 25 fTail = fHead; 34 SkASSERT(fHead == fTail); 43 if (fTail->fFreeSize < size) { 48 block->fPrev = fTail; 50 SkASSERT(NULL == fTail->fNext); 51 fTail->fNext = block; 52 fTail = block; 54 SkASSERT(fTail->fFreeSize >= size); 55 intptr_t ptr = fTail->fCurrPtr; 58 *reinterpret_cast<BlockHeader**>(ptr) = fTail; [all...] |
H A D | GrMemoryPool.h | 44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; } 74 BlockHeader* fTail; member in class:GrMemoryPool
|
H A D | GrTextStrike_impl.h | 24 SkASSERT(fTail != strike); 27 SkASSERT(fTail == strike); 28 fTail = strike->fPrev;
|
H A D | GrTextStrike.cpp | 38 fHead = fTail = NULL; 101 SkASSERT(NULL == fTail); 102 fTail = strike; 123 fTail = NULL; 172 SkASSERT(!fTail); 174 SkASSERT(fHead == fTail); 176 SkASSERT(fHead != fTail); 188 strike = fTail;
|
H A D | GrTextStrike.h | 128 GrTextStrike* fTail; member in class:GrFontCache
|
/external/skia/src/gpu/ |
H A D | GrMemoryPool.cpp | 25 fTail = fHead; 34 SkASSERT(fHead == fTail); 43 if (fTail->fFreeSize < size) { 48 block->fPrev = fTail; 50 SkASSERT(NULL == fTail->fNext); 51 fTail->fNext = block; 52 fTail = block; 54 SkASSERT(fTail->fFreeSize >= size); 55 intptr_t ptr = fTail->fCurrPtr; 58 *reinterpret_cast<BlockHeader**>(ptr) = fTail; [all...] |
H A D | GrMemoryPool.h | 44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; } 74 BlockHeader* fTail; member in class:GrMemoryPool
|
H A D | GrTextStrike.cpp | 38 fHead = fTail = NULL; 98 SkASSERT(NULL == fTail); 99 fTail = strike; 115 fTail = NULL; 165 SkASSERT(!fTail); 167 SkASSERT(fHead == fTail); 169 SkASSERT(fHead != fTail); 181 strike = fTail;
|
H A D | GrTextStrike_impl.h | 43 SkASSERT(fTail != strike); 46 SkASSERT(fTail == strike); 47 fTail = strike->fPrev;
|
H A D | GrTextStrike.h | 124 GrTextStrike* fTail; member in class:GrFontCache
|
/external/chromium_org/third_party/skia/src/effects/gradients/ |
H A D | SkGradientBitmapCache.cpp | 38 fHead = fTail = NULL; 63 SkASSERT(fTail != entry); 66 SkASSERT(fTail == entry); 67 fTail = entry->fPrev; 78 fTail = entry; 106 SkASSERT(fTail); 107 delete this->detach(fTail); 125 SkASSERT(NULL == fTail->fNext); 128 SkASSERT(fHead == fTail); 130 SkASSERT(fHead != fTail); [all...] |
H A D | SkGradientBitmapCache.h | 29 mutable Entry* fTail; member in class:SkGradientBitmapCache
|
/external/skia/src/effects/gradients/ |
H A D | SkBitmapCache.cpp | 38 fHead = fTail = NULL; 63 SkASSERT(fTail != entry); 66 SkASSERT(fTail == entry); 67 fTail = entry->fPrev; 78 fTail = entry; 106 SkASSERT(fTail); 107 delete this->detach(fTail); 125 SkASSERT(NULL == fTail->fNext); 128 SkASSERT(fHead == fTail); 130 SkASSERT(fHead != fTail); [all...] |
H A D | SkBitmapCache.h | 29 mutable Entry* fTail; member in class:SkBitmapCache
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkTInternalLList.h | 45 , fTail(NULL) { 49 SkASSERT(fHead && fTail); 63 fTail = prev; 84 if (NULL == fTail) { 85 fTail = entry; 97 entry->fPrev = fTail; 99 if (fTail) { 100 fTail->fNext = entry; 102 fTail = entry; 160 SkASSERT(fTail 267 T* fTail; member in class:SkTInternalLList [all...] |
/external/skia/include/core/ |
H A D | SkTInternalLList.h | 45 , fTail(NULL) { 49 SkASSERT(NULL != fHead && NULL != fTail); 63 fTail = prev; 84 if (NULL == fTail) { 85 fTail = entry; 97 entry->fPrev = fTail; 99 if (NULL != fTail) { 100 fTail->fNext = entry; 102 fTail = entry; 160 SkASSERT(fTail 267 T* fTail; member in class:SkTInternalLList [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRecordPattern.h | 114 return i == 0 ? 0 : fTail.match(record, i); 133 template <typename T> T* second() { return fTail.fHead.get(); } 134 template <typename T> T* third() { return fTail.fTail.fHead.get(); } 161 Pattern fTail; member in class:SkRecords::Cons 169 // Bottoms out recursion down the fTail chain. Just return whatever i the front decided on.
|
H A D | SkResourceCache.cpp | 42 fTail = NULL; 245 Rec* rec = fTail; 280 fTail = prev; 294 SkASSERT(fTail); 316 if (!fTail) { 317 fTail = rec; 330 SkASSERT(NULL == fTail); 335 if (fHead == fTail) { 344 SkASSERT(NULL == fTail->fNext); 345 SkASSERT(fTail [all...] |
H A D | SkStream.cpp | 506 : fHead(NULL), fTail(NULL), fBytesWritten(0), fCopy(NULL) 526 fHead = fTail = NULL; 539 if (fTail != NULL && fTail->avail() > 0) { 540 size = SkTMin(fTail->avail(), count); 541 buffer = fTail->append(buffer, size); 553 if (fTail != NULL) 554 fTail->fNext = block; 556 fHead = fTail = block; 557 fTail [all...] |
H A D | SkResourceCache.h | 207 Rec* fTail; member in class:SkResourceCache
|
/external/skia/src/core/ |
H A D | SkRecordPattern.h | 110 return i == 0 ? 0 : fTail.match(record, i); 129 template <typename T> T* second() { return fTail.fHead.get(); } 130 template <typename T> T* third() { return fTail.fTail.fHead.get(); } 157 Pattern fTail; member in class:SkRecords::Cons 165 // Bottoms out recursion down the fTail chain. Just return whatever i the front decided on.
|
H A D | SkScaledImageCache.cpp | 162 fTail = NULL; 512 Rec* rec = fTail; 562 fTail = prev; 576 SkASSERT(fTail); 598 if (!fTail) { 599 fTail = rec; 612 SkASSERT(NULL == fTail); 617 if (fHead == fTail) { 626 SkASSERT(NULL == fTail->fNext); 627 SkASSERT(NULL != fTail [all...] |
H A D | SkStream.cpp | 525 : fHead(NULL), fTail(NULL), fBytesWritten(0), fCopy(NULL) 545 fHead = fTail = NULL; 558 if (fTail != NULL && fTail->avail() > 0) { 559 size = SkTMin(fTail->avail(), count); 560 buffer = fTail->append(buffer, size); 572 if (fTail != NULL) 573 fTail->fNext = block; 575 fHead = fTail = block; 576 fTail [all...] |
H A D | SkScaledImageCache.h | 179 Rec* fTail; member in class:SkScaledImageCache
|
/external/skia/include/utils/ |
H A D | SkJSON.h | 178 Slot* fTail; member in class:SkJSON::Object
|