HomeSort by relevance Sort by last modified time
    Searched defs:fPrev (Results 1 - 18 of 18) sorted by null

  /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/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/skia/src/core/
SkEdge.h 27 SkEdge* fPrev;
55 SkASSERT(fPrev && fNext);
56 SkASSERT(fPrev->fNext == this);
57 SkASSERT(fNext->fPrev == this);
SkAnalyticEdge.h 22 SkAnalyticEdge* fPrev;
91 SkASSERT(fPrev && fNext);
92 SkASSERT(fPrev->fNext == this);
93 SkASSERT(fNext->fPrev == this);
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...]
SkGlyphCache.h 230 SkGlyphCache* fPrev;
SkResourceCache.h 107 Rec* fPrev;
  /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/
GrMemoryPool.h 85 BlockHeader* fPrev;
GrTextureStripAtlas.h 90 AtlasRow() : fKey(kEmptyAtlasRowKey), fLocks(0), fNext(nullptr), fPrev(nullptr) { }
97 AtlasRow* fPrev;
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;
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/include/views/
SkView.h 155 SkPoint fOrig, fPrev, fCurr;
  /external/skia/src/pathops/
SkOpSegment.h 309 return fPrev;
355 fPrev = prev;
433 const SkOpSegment* fPrev;
SkOpSpan.h 294 return fPrev;
298 return fPrev;
330 fPrev = prev;
404 SkOpSpan* fPrev; // previous intersection point
SkPathOpsTSect.h 209 SkTSpan* fPrev;
407 result->fPrev = prior;
415 next->fPrev = result;
565 fPrev = fNext = nullptr;
770 fPrev = work;
777 fNext->fPrev = this;
797 SkASSERT(this != fPrev);
799 SkASSERT(fNext == nullptr || fNext != fPrev);
800 SkASSERT(fNext == nullptr || this == fNext->fPrev);
801 SkASSERT(fPrev == nullptr || this == fPrev->fNext)
    [all...]

Completed in 286 milliseconds