Home
last modified time | relevance | path

Searched refs:fPrev (Results 1 – 25 of 31) sorted by relevance

12

/external/skia/src/core/
DSkTInternalLList.h35 SkPtrWrapper<ClassName> fPrev; \
52 T* prev = entry->fPrev; in remove()
61 next->fPrev = prev; in remove()
66 entry->fPrev = NULL; in remove()
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext); in addToHead()
78 entry->fPrev = NULL; in addToHead()
81 fHead->fPrev = entry; in addToHead()
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext); in addToTail()
97 entry->fPrev = fTail; in addToTail()
127 T* prev = existingEntry->fPrev; in addBefore()
[all …]
DSkDeque.cpp14 Block* fPrev; member
23 fNext = fPrev = nullptr; in init()
91 fFrontBlock->fPrev = first; in push_front()
130 last->fPrev = fBackBlock; in push_back()
161 first->fPrev = nullptr; in pop_front()
194 last = last->fPrev; in pop_back()
210 if (nullptr == last->fPrev) { in pop_back()
213 SkASSERT(last->fPrev->fEnd); in pop_back()
214 fBack = last->fPrev->fEnd - fElemSize; in pop_back()
276 fCurBlock = fCurBlock->fPrev; in prev()
[all …]
DSkScan_Path.cpp40 edge->fPrev->fNext = edge->fNext; in remove_edge()
41 edge->fNext->fPrev = edge->fPrev; in remove_edge()
45 edge->fPrev = afterMe; in insert_edge_after()
47 afterMe->fNext->fPrev = edge; in insert_edge_after()
54 SkEdge* prev = edge->fPrev; in backward_insert_edge_based_on_x()
56 prev = prev->fPrev; in backward_insert_edge_based_on_x()
70 prev = prev->fPrev; in backward_insert_start()
79 SkEdge* prev = newEdge->fPrev; in insert_new_edges()
109 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
110 SkASSERT(edge->fPrev->fNext == edge); in validate_edges_for_y()
[all …]
DSkResourceCache.cpp317 Rec* prev = rec->fPrev; in purgeAsNeeded()
343 Rec* prev = rec->fPrev; in purgeSharedID()
370 rec = rec->fPrev; in visitAll()
399 Rec* prev = rec->fPrev; in detach()
412 next->fPrev = prev; in detach()
415 rec->fNext = rec->fPrev = nullptr; in detach()
430 fHead->fPrev = rec; in moveToHead()
440 rec->fPrev = nullptr; in addToHead()
443 fHead->fPrev = rec; in addToHead()
466 SkASSERT(nullptr == fHead->fPrev); in validate()
[all …]
DSkEdge.h28 SkEdge* fPrev; member
56 SkASSERT(fPrev && fNext); in validate()
57 SkASSERT(fPrev->fNext == this); in validate()
58 SkASSERT(fNext->fPrev == this); in validate()
DSkGlyphCache.cpp46 fPrev = fNext = nullptr; in SkGlyphCache()
701 SkGlyphCache* prev = cache->fPrev; in internalPurge()
723 SkASSERT(nullptr == cache->fPrev && nullptr == cache->fNext); in internalAttachCacheToHead()
725 fHead->fPrev = cache; in internalAttachCacheToHead()
739 if (cache->fPrev) { in internalDetachCache()
740 cache->fPrev->fNext = cache->fNext; in internalDetachCache()
745 cache->fNext->fPrev = cache->fPrev; in internalDetachCache()
747 cache->fPrev = cache->fNext = nullptr; in internalDetachCache()
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
DANTLRLinkBase.m36 @synthesize fPrev;
53 fPrev = nil;
62 fPrev = pp;
73 if (fPrev) [fPrev dealloc];
82 copy.fPrev = fPrev;
89 node.fPrev = (id<ANTLRLinkList>)self;
92 node.fNext.fPrev = node;
100 node.fPrev = self.fPrev;
101 if (node.fPrev != nil)
102 node.fPrev.fNext = node;
[all …]
DANTLRLinkBase.h53 @property (retain) id<ANTLRLinkList> fPrev;
58 id<ANTLRLinkList> fPrev; variable
62 @property (retain) id<ANTLRLinkList> fPrev;
/external/skia/src/effects/gradients/
DSkGradientBitmapCache.cpp13 Entry* fPrev; member
21 : fPrev(nullptr), in Entry()
55 if (entry->fPrev) { in detach()
57 entry->fPrev->fNext = entry->fNext; in detach()
64 entry->fNext->fPrev = entry->fPrev; in detach()
67 fTail = entry->fPrev; in detach()
73 entry->fPrev = nullptr; in attachToHead()
76 fHead->fPrev = entry; in attachToHead()
124 SkASSERT(nullptr == fHead->fPrev); in validate()
144 entry = entry->fPrev; in validate()
/external/skia/src/gpu/effects/
DGrTextureStripAtlas.cpp232 fRows[i].fPrev = nullptr; in initLRU()
235 SkASSERT(nullptr == fLRUFront || nullptr == fLRUFront->fPrev); in initLRU()
240 SkASSERT(nullptr == row->fPrev && nullptr == row->fNext); in appendLRU()
245 row->fPrev = fLRUBack; in appendLRU()
253 if (row->fNext && row->fPrev) { in removeFromLRU()
254 row->fPrev->fNext = row->fNext; in removeFromLRU()
255 row->fNext->fPrev = row->fPrev; in removeFromLRU()
259 fLRUBack = row->fPrev; in removeFromLRU()
264 if (nullptr == row->fPrev) { in removeFromLRU()
268 fLRUFront->fPrev = nullptr; in removeFromLRU()
[all …]
DGrTextureStripAtlas.h86 AtlasRow() : fKey(kEmptyAtlasRowKey), fLocks(0), fNext(nullptr), fPrev(nullptr) { } in AtlasRow()
93 AtlasRow* fPrev; member
/external/skia/src/gpu/
DGrTessellator.cpp140 : fPoint(point), fPrev(nullptr), fNext(nullptr) in Vertex()
149 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. member
331 , fPrev(nullptr) in MonotonePoly()
336 MonotonePoly* fPrev; member
349 newV->fPrev = fTail; in addVertex()
354 fHead->fPrev = newV; in addVertex()
364 SkASSERT(v && v->fPrev && v->fNext); in emit()
365 Vertex* prev = v->fPrev; in emit()
374 v->fPrev->fNext = v->fNext; in emit()
375 v->fNext->fPrev = v->fPrev; in emit()
[all …]
DGrTRecorder.h123 block->fPrev = prev; in Alloc()
133 if (block && block->fPrev) { in Free()
134 SkASSERT(block->fPrev->fNext == block); in Free()
135 block->fPrev->fNext = nullptr; in Free()
151 MemBlock* fPrev; member
189 fTailBlock = fTailBlock->fPrev; in pop_back()
309 if (!fBlock->fPrev) { in previous()
313 fBlock = fBlock->fPrev; in previous()
DGrMemoryPool.cpp29 fHead->fPrev = nullptr; in GrMemoryPool()
50 block->fPrev = fTail; in allocate()
92 BlockHeader* prev = block->fPrev; in release()
97 next->fPrev = prev; in release()
148 SkASSERT(prev == block->fPrev); in validate()
DGrMemoryPool.h65 BlockHeader* fPrev; member
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
DANTLRLinkBase.h52 id<ANTLRLinkList> fPrev; variable
56 @property (retain, getter=getfPrev, setter=setFPrev:) id<ANTLRLinkList> fPrev;
/external/skia/samplecode/
DPerlinPatch.cpp194 SkScalar xDiff = click->fPrev.fX - click->fCurr.fX; in onClick()
195 SkScalar yDiff = click->fPrev.fY - click->fCurr.fY; in onClick()
199 SkScalar yDiff = click->fCurr.fY - click->fPrev.fY; in onClick()
DSampleXfer.cpp240 fSelected->fLoc.fX += click->fCurr.fX - click->fPrev.fX; in onClick()
241 fSelected->fLoc.fY += click->fCurr.fY - click->fPrev.fY; in onClick()
DSampleDraw.cpp363 (*iter)->offset(click->fCurr.x() - click->fPrev.x(), in onClick()
364 click->fCurr.y() - click->fPrev.y()); in onClick()
/external/skia/src/views/
DSkView.cpp391 click->fPrev = click->fCurr = click->fOrig; in DoClickDown()
409 click->fPrev = click->fCurr; in DoClickMoved()
413 click->fCurr = click->fPrev; in DoClickMoved()
432 click->fPrev = click->fCurr; in DoClickUp()
436 click->fCurr = click->fPrev; in DoClickUp()
/external/skia/src/pathops/
DSkOpSpan.h257 return fPrev; in prev()
291 fPrev = prev; in setPrev()
365 SkOpSpan* fPrev; // previous intersection point variable
DSkPathOpsTSect.h198 SkTSpan* fPrev; variable
385 result->fPrev = prior; in addFollowing()
393 next->fPrev = result; in addFollowing()
542 fPrev = fNext = nullptr; in init()
746 fPrev = work; in splitAt()
753 fNext->fPrev = this; in splitAt()
772 SkASSERT(fNext == nullptr || fNext != fPrev); in validate()
773 SkASSERT(fNext == nullptr || this == fNext->fPrev); in validate()
774 SkASSERT(fPrev == nullptr || this == fPrev->fNext); in validate()
866 result->fPrev = result->fNext = nullptr; in addOne()
[all …]
DSkOpSegment.h293 return fPrev; in prev()
330 fPrev = prev; in setPrev()
413 const SkOpSegment* fPrev; variable

12