Searched refs:fPrev (Results 1 - 25 of 33) sorted by relevance

12

/external/skia/src/core/
H A DSkTInternalLList.h35 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...]
H A DSkDeque.cpp14 Block* fPrev; member in struct:SkDeque::Block
23 fNext = fPrev = nullptr;
91 fFrontBlock->fPrev = first;
130 last->fPrev = fBackBlock;
161 first->fPrev = nullptr;
194 last = last->fPrev;
210 if (nullptr == last->fPrev) {
213 SkASSERT(last->fPrev->fEnd);
214 fBack = last->fPrev->fEnd - fElemSize;
276 fCurBlock = fCurBlock->fPrev;
[all...]
H A DSkEdge.h28 SkEdge* fPrev; member in struct:SkEdge
56 SkASSERT(fPrev && fNext);
57 SkASSERT(fPrev->fNext == this);
58 SkASSERT(fNext->fPrev == this);
H A DSkResourceCache.cpp317 Rec* prev = rec->fPrev;
343 Rec* prev = rec->fPrev;
370 rec = rec->fPrev;
399 Rec* prev = rec->fPrev;
412 next->fPrev = prev;
415 rec->fNext = rec->fPrev = nullptr;
430 fHead->fPrev = rec;
440 rec->fPrev = nullptr;
443 fHead->fPrev = rec;
466 SkASSERT(nullptr == fHead->fPrev);
[all...]
H A DSkScan_Path.cpp40 edge->fPrev->fNext = edge->fNext;
41 edge->fNext->fPrev = edge->fPrev;
45 edge->fPrev = afterMe;
47 afterMe->fNext->fPrev = edge;
54 SkEdge* prev = edge->fPrev;
56 prev = prev->fPrev;
70 prev = prev->fPrev;
79 SkEdge* prev = newEdge->fPrev;
109 SkASSERT(edge->fPrev
[all...]
H A DSkGlyphCache.cpp46 fPrev = fNext = nullptr;
701 SkGlyphCache* prev = cache->fPrev;
723 SkASSERT(nullptr == cache->fPrev && nullptr == cache->fNext);
725 fHead->fPrev = cache;
739 if (cache->fPrev) {
740 cache->fPrev->fNext = cache->fNext;
745 cache->fNext->fPrev = cache->fPrev;
747 cache->fPrev = cache->fNext = nullptr;
H A DSkResourceCache.h95 Rec* fPrev; member in struct:SkResourceCache::Rec
/external/skia/src/effects/gradients/
H A DSkGradientBitmapCache.cpp13 Entry* fPrev; member in struct:SkGradientBitmapCache::Entry
21 : fPrev(nullptr),
55 if (entry->fPrev) {
57 entry->fPrev->fNext = entry->fNext;
64 entry->fNext->fPrev = entry->fPrev;
67 fTail = entry->fPrev;
73 entry->fPrev = nullptr;
76 fHead->fPrev = entry;
124 SkASSERT(nullptr == fHead->fPrev);
[all...]
/external/skia/src/gpu/effects/
H A DGrTextureStripAtlas.cpp232 fRows[i].fPrev = nullptr;
235 SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev);
240 SkASSERT(nullptr == row->fPrev && nullptr == row->fNext);
245 row->fPrev = fLRUBack;
253 if (row->fNext && row->fPrev) {
254 row->fPrev->fNext = row->fNext;
255 row->fNext->fPrev = row->fPrev;
259 fLRUBack = row->fPrev;
264 if (nullptr == row->fPrev) {
[all...]
H A DGrTextureStripAtlas.h86 AtlasRow() : fKey(kEmptyAtlasRowKey), fLocks(0), fNext(nullptr), fPrev(nullptr) { }
93 AtlasRow* fPrev; member in struct:GrTextureStripAtlas::AtlasRow
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRLinkBase.h53 @property (retain) id<ANTLRLinkList> fPrev; variable
58 id<ANTLRLinkList> fPrev; variable
62 @property (retain) id<ANTLRLinkList> fPrev; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev; variable
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev; variable
/external/skia/src/gpu/
H A DGrTRecorder.h123 block->fPrev = prev;
133 if (block && block->fPrev) {
134 SkASSERT(block->fPrev->fNext == block);
135 block->fPrev->fNext = nullptr;
151 MemBlock* fPrev; member in struct:GrTRecorder::MemBlock
189 fTailBlock = fTailBlock->fPrev;
309 if (!fBlock->fPrev) {
313 fBlock = fBlock->fPrev;
H A DGrMemoryPool.cpp29 fHead->fPrev = nullptr;
50 block->fPrev = fTail;
92 BlockHeader* prev = block->fPrev;
97 next->fPrev = prev;
148 SkASSERT(prev == block->fPrev);
H A DGrTessellator.cpp131 * in Y) using the same fPrev/fNext pointers that were used for the contours, to avoid
140 : fPoint(point), fPrev(nullptr), fNext(nullptr)
149 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. member in struct:__anon16907::Vertex
331 , fPrev(nullptr)
336 MonotonePoly* fPrev; member in struct:__anon16907::Poly::MonotonePoly
349 newV->fPrev = fTail;
354 fHead->fPrev = newV;
364 SkASSERT(v && v->fPrev && v->fNext);
365 Vertex* prev = v->fPrev;
374 v->fPrev
[all...]
H A DGrMemoryPool.h65 BlockHeader* fPrev; member in struct:GrMemoryPool::BlockHeader
/external/skia/samplecode/
H A DPerlinPatch.cpp194 SkScalar xDiff = click->fPrev.fX - click->fCurr.fX;
195 SkScalar yDiff = click->fPrev.fY - click->fCurr.fY;
199 SkScalar yDiff = click->fCurr.fY - click->fPrev.fY;
H A DSampleXfer.cpp240 fSelected->fLoc.fX += click->fCurr.fX - click->fPrev.fX;
241 fSelected->fLoc.fY += click->fCurr.fY - click->fPrev.fY;
H A DSampleDraw.cpp363 (*iter)->offset(click->fCurr.x() - click->fPrev.x(),
364 click->fCurr.y() - click->fPrev.y());
H A DSamplePathClip.cpp256 void handleMove() override { fRect->offset(fCurr.x() - fPrev.x(), fCurr.y() - fPrev.y()); }
/external/skia/src/views/
H A DSkView.cpp391 click->fPrev = click->fCurr = click->fOrig;
409 click->fPrev = click->fCurr;
413 click->fCurr = click->fPrev;
432 click->fPrev = click->fCurr;
436 click->fCurr = click->fPrev;
/external/skia/src/pathops/
H A DSkOpSpan.h257 return fPrev;
291 fPrev = prev;
365 SkOpSpan* fPrev; // previous intersection point member in class:SkOpSpanBase
H A DSkOpSegment.h293 return fPrev;
330 fPrev = prev;
413 const SkOpSegment* fPrev; member in class:SkOpSegment

Completed in 986 milliseconds

12