| /external/skia/src/core/ |
| SkRefDict.cpp | 13 Impl* fNext;
34 rec = rec->fNext;
57 prev->fNext = rec->fNext;
59 fImpl = rec->fNext;
66 rec = rec->fNext;
75 rec->fNext = fImpl;
82 Impl* next = rec->fNext;
|
| SkTMultiMap.h | 22 explicit ValueList(T* value) : fValue(value), fNext(nullptr) {}
27 ValueList* fNext;
43 newEntry->fNext = list->fNext;
46 list->fNext = newEntry;
63 list = list->fNext;
66 if (list->fNext) {
67 ValueList* next = list->fNext;
69 list->fNext = next->fNext;
[all...] |
| SkTLS.cpp | 20 SkTLSRec* fNext;
52 SkTLSRec* next = rec->fNext;
72 } while ((rec = rec->fNext) != nullptr);
78 rec->fNext = (SkTLSRec*)ptr;
101 } while ((rec = rec->fNext) != nullptr);
116 SkTLSRec* next = curr->fNext;
119 prev->fNext = next;
|
| SkTInternalLList.h | 36 SkPtrWrapper<ClassName> fNext
53 T* next = entry->fNext;
56 prev->fNext = next;
67 entry->fNext = NULL;
75 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
79 entry->fNext = fHead;
94 SkASSERT(NULL == entry->fPrev && NULL == entry->fNext);
98 entry->fNext = NULL;
100 fTail->fNext = entry;
126 newEntry->fNext = existingEntry
[all...] |
| SkSinglyLinkedList.h | 24 Node* next = node->fNext;
38 for (Node* node = fHead; node; node = node->fNext) {
46 fHead = node->fNext;
55 n->fNext = fHead;
66 fTail->fNext = n;
75 void operator++() { fNode = fNode->fNext; }
88 Node* fNext;
90 Node(Args&&... args) : fData(std::forward<Args>(args)...), fNext(nullptr) {}
|
| SkDeque.cpp | 12 Block* fNext;
22 fNext = fPrev = nullptr;
61 Block* next = head->fNext;
89 first->fNext = fFrontBlock;
130 fBackBlock->fNext = last;
159 first = first->fNext;
175 if (nullptr == first->fNext) {
178 SkASSERT(first->fNext->fBegin);
179 fFront = first->fNext->fBegin;
194 last->fNext = nullptr
[all...] |
| SkScan_Path.cpp | 32 edge = edge->fNext;
51 SkEdge* next = newEdge->fNext;
53 if (start->fNext == newEdge) {
56 SkEdge* after = start->fNext;
73 SkASSERT(edge->fPrev && edge->fNext);
74 SkASSERT(edge->fPrev->fNext == edge);
75 SkASSERT(edge->fNext->fPrev == edge);
79 edge = edge->fNext;
98 validate_sort(prevHead->fNext);
108 SkEdge* currE = prevHead->fNext;
[all...] |
| SkLinearBitmapPipeline_sample.h | 306 : fNext{next}, fAccessor{std::forward<Args>(args)...} { }
310 : fNext{next}, fAccessor{sampler.fAccessor} { }
316 if (n >= 1) fNext->blendPixel(px0);
317 if (n >= 2) fNext->blendPixel(px1);
318 if (n >= 3) fNext->blendPixel(px2);
324 fNext->blend4Pixels(px0, px1, px2, px3);
337 src_strategy_blend(span, fNext, &fAccessor);
364 Next* next = fNext;
400 src_strategy_blend(span, fNext, &fAccessor);
409 Next* const fNext;
[all...] |
| SkScanPriv.h | 44 edge->fPrev->fNext = edge->fNext;
45 edge->fNext->fPrev = edge->fPrev;
51 edge->fNext = afterMe->fNext;
52 afterMe->fNext->fPrev = edge;
53 afterMe->fNext = edge;
63 if (prev->fNext != edge) {
|
| /external/skia/src/gpu/ |
| GrResourceAllocator.cpp | 35 fHead = temp->fNext;
43 intvl->fNext = nullptr;
46 intvl->fNext = fHead;
50 Interval* next = prev->fNext;
51 for (; next && intvl->fStart > next->fStart; prev = next, next = next->fNext) {
53 intvl->fNext = next;
54 prev->fNext = intvl;
61 intvl->fNext = nullptr;
64 intvl->fNext = fHead;
68 Interval* next = prev->fNext;
[all...] |
| GrTRecorder.h | 122 block->fNext = nullptr;
125 SkASSERT(nullptr == prev->fNext);
126 prev->fNext = block;
134 SkASSERT(block->fPrev->fNext == block);
135 block->fPrev->fNext = nullptr;
138 MemBlock* next = block->fNext;
150 MemBlock* fNext;
213 if (!fTailBlock->fNext) {
216 fTailBlock = fTailBlock->fNext;
258 if (!fBlock->fNext) {
[all...] |
| GrResourceAllocator.h | 78 , fNext(nullptr) {
92 Interval* fNext;
101 fHead = temp->fNext;
|
| GrMemoryPool.cpp | 34 fHead->fNext = nullptr;
70 block->fNext = nullptr;
71 SkASSERT(nullptr == fTail->fNext);
72 fTail->fNext = block;
115 BlockHeader* next = block->fNext;
117 prev->fNext = next;
172 SkASSERT(prev->fNext == block);
200 } while ((block = block->fNext));
|
| /external/skia/src/views/ |
| SkTagList.cpp | 23 rec = rec->fNext;
37 SkTagList* next = rec->fNext;
42 prev->fNext = next;
57 SkTagList* next = rec->fNext;
|
| SkTagList.h | 23 SkTagList* fNext;
31 fNext = nullptr;
|
| /external/skia/src/shaders/gradients/ |
| SkGradientBitmapCache.cpp | 15 Entry* fNext;
23 fNext(nullptr),
49 Entry* next = entry->fNext;
58 entry->fPrev->fNext = entry->fNext;
61 fHead = entry->fNext;
63 if (entry->fNext) {
65 entry->fNext->fPrev = entry->fPrev;
75 entry->fNext = fHead;
98 entry = entry->fNext;
[all...] |
| /external/skia/src/sksl/ast/ |
| SkSLASTForStatement.h | 25 , fNext(std::move(next))
38 if (fNext) {
39 result.append(fNext->description());
48 const std::unique_ptr<ASTExpression> fNext;
|
| /external/skia/src/sksl/ir/ |
| SkSLForStatement.h | 28 , fNext(std::move(next))
41 if (fNext) {
42 result += fNext->description();
53 std::unique_ptr<Expression> fNext;
|
| /external/skia/src/gpu/effects/ |
| GrTextureStripAtlas.cpp | 239 fRows[i].fNext = nullptr;
244 SkASSERT(nullptr == fLRUBack || nullptr == fLRUBack->fNext);
248 SkASSERT(nullptr == row->fPrev && nullptr == row->fNext);
254 fLRUBack->fNext = row;
261 if (row->fNext && row->fPrev) {
262 row->fPrev->fNext = row->fNext;
263 row->fNext->fPrev = row->fPrev;
265 if (nullptr == row->fNext) {
269 fLRUBack->fNext = nullptr
[all...] |
| /external/skia/experimental/svg/model/ |
| SkPEG.h | 19 * If the match was successful, |fNext| points to the next unconsumed character in the
22 * Otherwise, |fNext| is nullptr and |fValue| is uninitialized.
26 MatchResult(std::nullptr_t) : fNext(nullptr) {}
27 MatchResult(const char* next, const V& v) : fNext(next), fValue(&v) {}
30 SkASSERT(fValue.isValid() == SkToBool(fNext));
31 return SkToBool(fNext);
37 const char* fNext;
59 return m ? MatchT(m.fNext, V(m.fValue.get()))
128 const auto tailMatch = Seq<Es...>::Match(headMatch.fNext);
129 return tailMatch ? MatchT(tailMatch.fNext, V(*headMatch, *tailMatch)
[all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ANTLRLinkBase.h | 54 @property (retain) id<ANTLRLinkList> fNext;
59 id<ANTLRLinkList> fNext;
63 @property (retain) id<ANTLRLinkList> fNext;
|
| /external/icu/icu4c/source/common/ |
| rbbisetb.cpp | 115 nextRangeDesc = r->fNext;
178 rlRange = rlRange->fNext;
220 rlRange = rlRange->fNext;
238 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
239 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange->fNext) {
298 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
419 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
442 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
477 for (rlRange = fRangeList; rlRange!=0; rlRange=rlRange->fNext) {
499 for (tRange = rlRange; tRange != 0; tRange = tRange->fNext) {
[all...] |
| /external/skia/src/pathops/ |
| SkOpSpan.h | 35 SkOpPtT* oldNext = this->fNext;
37 this->fNext = opp;
39 oppPrev->fNext = oldNext;
89 span->fNext = fNext;
90 fNext = span;
94 return fNext;
98 return fNext;
106 SkOpPtT* oppPrev = opp->fNext;
110 while (oppPrev->fNext != opp)
[all...] |
| /external/skia/src/effects/ |
| SkLayerDrawLooper.cpp | 36 Rec* next = rec->fNext;
162 fCurrRec = fCurrRec->fNext;
189 rec = rec->fNext;
223 newTopRec->fNext = nullptr;
226 oldRec = oldRec->fNext;
231 newRec->fNext = nullptr;
232 prevNewRec->fNext = newRec;
235 oldRec = oldRec->fNext;
257 rec = rec->fNext;
332 rec = rec->fNext;
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RBBISetBuilder.java | 48 RangeDescriptor fNext; // Next RangeDescriptor in the linked list.
74 nr.fNext = this.fNext;
75 this.fNext = nr;
189 rlRange = rlRange.fNext;
222 rlRange = rlRange.fNext;
240 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) {
241 for (rlSearchRange=fRangeList; rlSearchRange != rlRange; rlSearchRange=rlSearchRange.fNext) {
294 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) {
426 for (rlRange = fRangeList; rlRange!=null; rlRange=rlRange.fNext) {
[all...] |
