| /external/skia/src/core/ |
| SkTInternalLList.h | 35 SkPtrWrapper<ClassName> fPrev; \
52 T* prev = entry->fPrev;
61 next->fPrev = prev;
66 entry->fPrev = NULL;
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
78 entry->fPrev = NULL;
81 fHead->fPrev = entry;
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
97 entry->fPrev = fTail;
127 T* prev = existingEntry->fPrev;
[all...] |
| SkScanPriv.h | 44 edge->fPrev->fNext = edge->fNext;
45 edge->fNext->fPrev = edge->fPrev;
50 edge->fPrev = afterMe;
52 afterMe->fNext->fPrev = edge;
59 EdgeType* prev = edge->fPrev;
60 while (prev->fPrev && prev->fX > x) {
61 prev = prev->fPrev;
75 while (prev->fPrev && prev->fX > x) {
76 prev = prev->fPrev;
[all...] |
| SkDeque.cpp | 13 Block* fPrev;
22 fNext = fPrev = nullptr;
90 fFrontBlock->fPrev = first;
129 last->fPrev = fBackBlock;
160 first->fPrev = nullptr;
193 last = last->fPrev;
209 if (nullptr == last->fPrev) {
212 SkASSERT(last->fPrev->fEnd);
213 fBack = last->fPrev->fEnd - fElemSize;
275 fCurBlock = fCurBlock->fPrev;
[all...] |
| SkResourceCache.cpp | 210 Rec* prev = rec->fPrev;
238 Rec* prev = rec->fPrev;
268 rec = rec->fPrev;
297 Rec* prev = rec->fPrev;
310 next->fPrev = prev;
313 rec->fNext = rec->fPrev = nullptr;
328 fHead->fPrev = rec;
338 rec->fPrev = nullptr;
341 fHead->fPrev = rec;
364 SkASSERT(nullptr == fHead->fPrev);
[all...] |
| SkAnalyticEdge.h | 22 SkAnalyticEdge* fPrev;
91 SkASSERT(fPrev && fNext);
92 SkASSERT(fPrev->fNext == this);
93 SkASSERT(fNext->fPrev == this);
|
| SkEdge.h | 27 SkEdge* fPrev;
55 SkASSERT(fPrev && fNext);
56 SkASSERT(fPrev->fNext == this);
57 SkASSERT(fNext->fPrev == this);
|
| SkScan_Path.cpp | 43 SkEdge* prev = newEdge->fPrev;
73 SkASSERT(edge->fPrev && edge->fNext);
74 SkASSERT(edge->fPrev->fNext == edge);
75 SkASSERT(edge->fNext->fPrev == edge);
78 SkASSERT(edge->fPrev->fX <= edge->fX);
381 list[i]->fPrev = list[i - 1];
432 headEdge.fPrev = nullptr;
436 edge->fPrev = &headEdge;
438 tailEdge.fPrev = last;
720 headEdge.fPrev = nullptr
[all...] |
| SkResourceCache.h | 107 Rec* fPrev;
|
| SkGlyphCache.cpp | 42 fPrev = fNext = nullptr;
681 SkGlyphCache* prev = cache->fPrev;
703 SkASSERT(nullptr == cache->fPrev && nullptr == cache->fNext);
705 fHead->fPrev = cache;
719 if (cache->fPrev) {
720 cache->fPrev->fNext = cache->fNext;
725 cache->fNext->fPrev = cache->fPrev;
727 cache->fPrev = cache->fNext = nullptr;
|
| SkScan_AAAPath.cpp | [all...] |
| /external/skia/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 14 Entry* fPrev;
22 : fPrev(nullptr),
56 if (entry->fPrev) {
58 entry->fPrev->fNext = entry->fNext;
65 entry->fNext->fPrev = entry->fPrev;
68 fTail = entry->fPrev;
74 entry->fPrev = nullptr;
77 fHead->fPrev = entry;
125 SkASSERT(nullptr == fHead->fPrev);
[all...] |
| /external/skia/src/gpu/effects/ |
| GrTextureStripAtlas.cpp | 240 fRows[i].fPrev = nullptr;
243 SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);
248 SkASSERT(nullptr == row->fPrev && nullptr == row->fNext);
253 row->fPrev = fLRUBack;
261 if (row->fNext && row->fPrev) {
262 row->fPrev->fNext = row->fNext;
263 row->fNext->fPrev = row->fPrev;
267 fLRUBack = row->fPrev;
272 if (nullptr == row->fPrev) {
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRLinkBase.h | 53 @property (retain) id<ANTLRLinkList> fPrev;
58 id<ANTLRLinkList> fPrev;
62 @property (retain) id<ANTLRLinkList> fPrev;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| ANTLRLinkBase.h | 52 id<ANTLRLinkList> fPrev;
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
| ANTLRLinkBase.h | 52 id<ANTLRLinkList> fPrev;
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
| ANTLRLinkBase.h | 52 id<ANTLRLinkList> fPrev;
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
|
| /external/skia/src/gpu/ |
| GrTRecorder.h | 123 block->fPrev = prev;
133 if (block && block->fPrev) {
134 SkASSERT(block->fPrev->fNext == block);
135 block->fPrev->fNext = nullptr;
151 MemBlock* fPrev;
189 fTailBlock = fTailBlock->fPrev;
309 if (!fBlock->fPrev) {
313 fBlock = fBlock->fPrev;
|
| GrTextureStripAtlas.h | 90 AtlasRow() : fKey(kEmptyAtlasRowKey), fLocks(0), fNext(nullptr), fPrev(nullptr) { }
97 AtlasRow* fPrev;
|
| GrMemoryPool.cpp | 35 fHead->fPrev = nullptr;
69 block->fPrev = fTail;
114 BlockHeader* prev = block->fPrev;
119 next->fPrev = prev;
170 SkASSERT(prev == block->fPrev);
|
| GrMemoryPool.h | 85 BlockHeader* fPrev;
|
| GrTessellator.cpp | 134 * in Y) using the same fPrev/fNext pointers that were used for the contours, to avoid
143 : fPoint(point), fPrev(nullptr), fNext(nullptr)
154 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices.
241 list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail);
252 list.fHead->fPrev = fTail;
262 list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail);
267 fHead->fPrev = fTail;
475 , fPrev(nullptr)
482 MonotonePoly* fPrev;
516 SkASSERT(v && v->fPrev && v->fNext)
[all...] |
| /external/skia/samplecode/ |
| PerlinPatch.cpp | 201 SkScalar xDiff = click->fPrev.fX - click->fCurr.fX;
202 SkScalar yDiff = click->fPrev.fY - click->fCurr.fY;
206 SkScalar yDiff = click->fCurr.fY - click->fPrev.fY;
|
| SampleXfer.cpp | 236 fSelected->fLoc.fX += click->fCurr.fX - click->fPrev.fX;
237 fSelected->fLoc.fY += click->fCurr.fY - click->fPrev.fY;
|
| /external/skia/src/pathops/ |
| SkOpSpan.h | 294 return fPrev;
298 return fPrev;
330 fPrev = prev;
404 SkOpSpan* fPrev; // previous intersection point
|
| /external/skia/src/views/ |
| SkView.cpp | 392 click->fPrev = click->fCurr = click->fOrig;
410 click->fPrev = click->fCurr;
414 click->fCurr = click->fPrev;
433 click->fPrev = click->fCurr;
437 click->fCurr = click->fPrev;
|
