| /external/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/gpu/ |
| H A D | GrMemoryPool.cpp | 27 fTail = fHead;
36 SkASSERT(fHead == fTail);
45 if (fTail->fFreeSize < size) {
50 block->fPrev = fTail;
52 SkASSERT(NULL == fTail->fNext);
53 fTail->fNext = block;
54 fTail = block;
58 SkASSERT(fTail->fFreeSize >= size);
59 intptr_t ptr = fTail->fCurrPtr;
62 *reinterpret_cast<BlockHeader**>(ptr) = fTail;
[all...] |
| H A D | GrMemoryPool.h | 44 bool isEmpty() const { return fTail == fHead && !fHead->fLiveCount; }
81 BlockHeader* fTail; member in class:GrMemoryPool
|
| H A D | GrTessellatingPathRenderer.cpp | 210 EdgeList() : fHead(NULL), fTail(NULL) {}
212 Edge* fTail; member in struct:__anon13994::EdgeList
315 , fTail(NULL)
332 , fTail(NULL)
337 Vertex* fTail; member in struct:__anon13994::Poly::MonotonePoly
349 fHead = fTail = newV;
351 newV->fPrev = fTail;
352 fTail->fNext = newV;
353 fTail = newV;
365 while (v != fTail) {
442 MonotonePoly* fTail; member in struct:__anon13994::Poly
[all...] |
| /external/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...] |
| H A D | SkStream.h | 430 Block* fTail; member in class:SkDynamicMemoryWStream
|
| /external/skia/src/core/ |
| H A D | SkRWBuffer.cpp | 164 SkRWBuffer::SkRWBuffer(size_t initialCapacity) : fHead(NULL), fTail(NULL), fTotalUsed(0) {}
181 fTail = &fHead->fBlock;
184 size_t written = fTail->append(src, length);
191 fTail->fNext = block;
192 fTail = block;
193 written = fTail->append(src, length);
209 fTail = &fHead->fBlock;
210 } else if (fTail->avail() < length) {
212 fTail->fNext = block;
213 fTail
[all...] |
| 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(); }
135 template <typename T> T* fourth() { return fTail.fTail.fTail.fHead.get(); }
162 Pattern fTail; member in class:SkRecords::Cons
170 // Bottoms out recursion down the fTail chain. Just return whatever i the front decided on.
|
| H A D | SkResourceCache.cpp | 61 fTail = NULL;
296 Rec* rec = fTail;
326 Rec* rec = fTail;
383 fTail = prev;
397 SkASSERT(fTail);
419 if (!fTail) {
420 fTail = rec;
433 SkASSERT(NULL == fTail);
438 if (fHead == fTail) {
447 SkASSERT(NULL == fTail
[all...] |
| H A D | SkRWBuffer.h | 93 SkBufferBlock* fTail; member in class:SkRWBuffer
|
| H A D | SkStream.cpp | 520 : fHead(NULL), fTail(NULL), fBytesWritten(0), fCopy(NULL)
540 fHead = fTail = NULL;
553 if (fTail != NULL && fTail->avail() > 0) {
554 size = SkTMin(fTail->avail(), count);
555 buffer = fTail->append(buffer, size);
567 if (fTail != NULL)
568 fTail->fNext = block;
570 fHead = fTail = block;
571 fTail
[all...] |
| H A D | SkResourceCache.h | 237 Rec* fTail; member in class:SkResourceCache
|
| /external/skia/src/pathops/ |
| H A D | SkOpContour.h | 66 result->setPrev(fTail);
67 if (fTail) {
68 fTail->setNext(result);
70 fTail = result;
156 SkASSERT(prior == fTail);
184 return fTail->pts()[SkPathOpsVerbToPoints(fTail->verb())];
282 fTail = NULL;
337 const SkOpSegment* segment = fTail;
356 SkOpSegment* fTail; member in class:SkOpContour
[all...] |
| H A D | SkOpSegment.h | 70 angle->set(&fTail, fTail.prev());
71 fTail.setFromAngle(angle);
341 return &fTail;
345 return &fTail;
384 SkOpSpanBase fTail; // the tail span always has its t set to one member in class:SkOpSegment
|
| H A D | SkOpSegment.cpp | 167 if ((start == &fHead && end == &fTail) || (start == &fTail && end == &fHead)) {
292 SkASSERT(span != &fTail);
306 if (span == &fTail) {
332 while (spanBase != &fTail) {
350 if (activePrior && !fTail.simple()) {
375 return fVerb == SkPath::kLine_Verb && fHead.pt() == fTail.pt();
830 SkOpSpanBase* oneSpan = &fTail;
1307 if (oppTest == &oppSegment->fTail || oppTest == &oppSegment->fHead) {
1309 SkASSERT(oppSpan != &oppSegment->fTail);
[all...] |
| /external/skia/tests/ |
| H A D | PathOpsAngleTest.cpp | 476 SkOpPtT* startPtT = startT == 0 ? fHead.ptT() : startT == 1 ? fTail.ptT()
478 SkOpPtT* endPtT = endT == 0 ? fHead.ptT() : endT == 1 ? fTail.ptT()
|