Searched refs:fNext (Results 26 - 50 of 141) sorted by relevance

123456

/external/chromium_org/third_party/skia/src/gpu/
H A DGrMemoryPool.cpp26 fHead->fNext = NULL;
49 block->fNext = NULL;
50 SkASSERT(NULL == fTail->fNext);
51 fTail->fNext = block;
82 BlockHeader* next = block->fNext;
84 prev->fNext = next;
131 SkASSERT(prev->fNext == block);
157 } while ((block = block->fNext));
H A DGrAllocPool.cpp15 Block* fNext; member in struct:GrAllocPool::Block
24 block->fNext = next;
71 Block* next = block->fNext;
96 Block* next = fBlock->fNext;
111 block = block->fNext;
H A DGrMemoryPool.h56 BlockHeader* fNext; ///< doubly-linked list of blocks. member in struct:GrMemoryPool::BlockHeader
/external/skia/src/gpu/
H A DGrMemoryPool.cpp26 fHead->fNext = NULL;
49 block->fNext = NULL;
50 SkASSERT(NULL == fTail->fNext);
51 fTail->fNext = block;
82 BlockHeader* next = block->fNext;
84 prev->fNext = next;
131 SkASSERT(prev->fNext == block);
157 } while ((block = block->fNext));
H A DGrAllocPool.cpp15 Block* fNext; member in struct:GrAllocPool::Block
24 block->fNext = next;
71 Block* next = block->fNext;
96 Block* next = fBlock->fNext;
111 block = block->fNext;
/external/chromium_org/third_party/skia/src/core/
H A DSkScan_Path.cpp36 edge = edge->fNext;
44 edge->fPrev->fNext = edge->fNext;
45 edge->fNext->fPrev = edge->fPrev;
49 SkASSERT(prev->fNext == next && next->fPrev == prev);
52 prev->fPrev->fNext = next;
56 prev->fNext = next->fNext;
57 next->fNext->fPrev = prev;
58 next->fNext
[all...]
H A DSkDeque.cpp13 Block* fNext; member in struct:SkDeque::Block
23 fNext = fPrev = NULL;
62 Block* next = head->fNext;
90 first->fNext = fFrontBlock;
131 fBackBlock->fNext = last;
160 first = first->fNext;
176 if (NULL == first->fNext) {
179 SkASSERT(first->fNext->fBegin);
180 fFront = first->fNext->fBegin;
195 last->fNext
[all...]
H A DSkChunkAlloc.cpp21 Block* fNext; member in struct:SkChunkAlloc::Block
32 Block* next = block->fNext;
82 // block->fNext = fBlock;
106 block->fNext = fBlock;
139 block = block->fNext;
H A DSkGlyphCache.cpp82 fPrev = fNext = NULL;
417 rec = rec->fNext;
433 rec = rec->fNext;
439 rec->fNext = fAuxProcList;
447 AuxProcRec* next = rec->fNext;
512 for (cache = globals.internalGetHead(); cache != NULL; cache = cache->fNext) {
557 SkASSERT(cache->fNext == NULL);
577 while (cache->fNext) {
578 cache = cache->fNext;
639 SkASSERT(NULL == cache->fPrev && NULL == cache->fNext);
[all...]
H A DSkEdge.h27 SkEdge* fNext; member in struct:SkEdge
57 SkASSERT(fPrev && fNext);
58 SkASSERT(fPrev->fNext == this);
59 SkASSERT(fNext->fPrev == this);
/external/skia/src/core/
H A DSkScan_Path.cpp36 edge = edge->fNext;
44 edge->fPrev->fNext = edge->fNext;
45 edge->fNext->fPrev = edge->fPrev;
49 SkASSERT(prev->fNext == next && next->fPrev == prev);
52 prev->fPrev->fNext = next;
56 prev->fNext = next->fNext;
57 next->fNext->fPrev = prev;
58 next->fNext
[all...]
H A DSkDeque.cpp13 Block* fNext; member in struct:SkDeque::Block
23 fNext = fPrev = NULL;
62 Block* next = head->fNext;
90 first->fNext = fFrontBlock;
131 fBackBlock->fNext = last;
160 first = first->fNext;
176 if (NULL == first->fNext) {
179 SkASSERT(NULL != first->fNext->fBegin);
180 fFront = first->fNext->fBegin;
195 last->fNext
[all...]
H A DSkChunkAlloc.cpp21 Block* fNext; member in struct:SkChunkAlloc::Block
32 Block* next = block->fNext;
82 // block->fNext = fBlock;
106 block->fNext = fBlock;
139 block = block->fNext;
H A DSkEdge.h27 SkEdge* fNext; member in struct:SkEdge
57 SkASSERT(fPrev && fNext);
58 SkASSERT(fPrev->fNext == this);
59 SkASSERT(fNext->fPrev == this);
H A DSkGlyphCache.cpp82 fPrev = fNext = NULL;
417 rec = rec->fNext;
433 rec = rec->fNext;
439 rec->fNext = fAuxProcList;
447 AuxProcRec* next = rec->fNext;
498 for (cache = globals.internalGetHead(); cache != NULL; cache = cache->fNext) {
529 for (cache = globals.internalGetHead(); cache != NULL; cache = cache->fNext) {
574 SkASSERT(cache->fNext == NULL);
594 while (cache->fNext) {
595 cache = cache->fNext;
[all...]
/external/chromium_org/third_party/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h37 fInitialRec.fNext = NULL;
45 Rec* next = rec->fNext;
122 rec->fNext = fRec;
173 Rec* rec = fRec->fNext;
191 Rec* fNext; member in struct:SkTDStackNester::Rec
/external/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h37 fInitialRec.fNext = NULL;
45 Rec* next = rec->fNext;
122 rec->fNext = fRec;
173 Rec* rec = fRec->fNext;
191 Rec* fNext; member in struct:SkTDStackNester::Rec
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRLinkBase.h54 @property (retain) id<ANTLRLinkList> fNext; variable
59 id<ANTLRLinkList> fNext; variable
63 @property (retain) id<ANTLRLinkList> fNext; variable
/external/junit/src/org/junit/rules/
H A DExpectedException.java101 private final Statement fNext; field in class:ExpectedException.ExpectedExceptionStatement
104 fNext= base;
110 fNext.evaluate();
/external/chromium_org/third_party/icu/source/common/
H A Drbbisetb.cpp113 nextRangeDesc = r->fNext;
176 rlRange = rlRange->fNext;
218 rlRange = rlRange->fNext;
236 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
237 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) {
296 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
417 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
440 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
475 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
497 for (tRange = rlRange; tRange != 0; tRange = tRange->fNext) {
[all...]
/external/icu/icu4c/source/common/
H A Drbbisetb.cpp113 nextRangeDesc = r->fNext;
176 rlRange = rlRange->fNext;
218 rlRange = rlRange->fNext;
236 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
237 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) {
296 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
417 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
440 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
475 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
497 for (tRange = rlRange; tRange != 0; tRange = tRange->fNext) {
[all...]
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpAngle.cpp63 const SkOpAngle& rh = *lh.fNext;
534 while ((angle = angle->fNext) != this) {
566 angle = angle->fNext;
578 while ((angle = angle->fNext)) {
640 if (angle->fNext) {
645 } else if (fNext) {
654 bool singleton = NULL == fNext;
656 fNext = this;
658 SkOpAngle* next = fNext;
659 if (next->fNext
[all...]
H A DSkOpAngle.h36 return !!fNext;
48 return fNext;
126 SkOpAngle* fNext; member in class:SkOpAngle
/external/skia/src/pathops/
H A DSkOpAngle.cpp63 const SkOpAngle& rh = *lh.fNext;
537 while ((angle = angle->fNext) != this) {
569 angle = angle->fNext;
581 while ((angle = angle->fNext)) {
643 if (angle->fNext) {
648 } else if (fNext) {
657 bool singleton = NULL == fNext;
659 fNext = this;
661 SkOpAngle* next = fNext;
662 if (next->fNext
[all...]
H A DSkOpAngle.h36 return !!fNext;
48 return fNext;
126 SkOpAngle* fNext; member in class:SkOpAngle

Completed in 2814 milliseconds

123456