| /external/skia/include/private/ |
| D | SkTInternalLList.h | 36 SkPtrWrapper<ClassName> fPrev; \
58 T* prev = entry->fPrev; in remove()
67 next->fPrev = prev; in remove()
72 entry->fPrev = nullptr; in remove()
81 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
84 entry->fPrev = nullptr; in addToHead()
87 fHead->fPrev = entry; in addToHead()
100 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
103 entry->fPrev = fTail; in addToTail()
133 T* prev = existingEntry->fPrev; in addBefore()
[all …]
|
| /external/skqp/include/private/ |
| D | SkTInternalLList.h | 36 SkPtrWrapper<ClassName> fPrev; \
58 T* prev = entry->fPrev; in remove()
67 next->fPrev = prev; in remove()
72 entry->fPrev = nullptr; in remove()
81 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToHead()
84 entry->fPrev = nullptr; in addToHead()
87 fHead->fPrev = entry; in addToHead()
100 SkASSERT(nullptr == entry->fPrev && nullptr == entry->fNext); in addToTail()
103 entry->fPrev = fTail; in addToTail()
133 T* prev = existingEntry->fPrev; in addBefore()
[all …]
|
| /external/antlr/runtime/ObjC/Framework/ |
| D | LinkBase.m | 36 @synthesize fPrev;
53 fPrev = nil;
62 fPrev = pp;
73 if (fPrev) [fPrev release];
82 copy.fPrev = fPrev;
89 node.fPrev = (id<LinkList>)self;
92 node.fNext.fPrev = node;
100 node.fPrev = self.fPrev;
101 if (node.fPrev != nil)
102 node.fPrev.fNext = node;
[all …]
|
| D | LinkBase.h | 53 @property (retain) id<LinkList> fPrev;
58 id<LinkList> fPrev; variable
62 @property (retain) id<LinkList> fPrev;
|
| /external/skia/src/core/ |
| D | SkScanPriv.h | 46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
52 edge->fPrev = afterMe; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
61 EdgeType* prev = edge->fPrev; in backward_insert_edge_based_on_x()
62 while (prev->fPrev && prev->fX > x) { in backward_insert_edge_based_on_x()
63 prev = prev->fPrev; in backward_insert_edge_based_on_x()
77 while (prev->fPrev && prev->fX > x) { in backward_insert_start()
78 prev = prev->fPrev; in backward_insert_start()
|
| D | SkDeque.cpp | 13 Block* fPrev; member
22 fNext = fPrev = nullptr; in init()
90 fFrontBlock->fPrev = first; in push_front()
129 last->fPrev = fBackBlock; in push_back()
161 first->fPrev = nullptr; in pop_front()
193 last = last->fPrev; in pop_back()
209 if (nullptr == last->fPrev) { in pop_back()
212 SkASSERT(last->fPrev->fEnd); in pop_back()
213 fBack = last->fPrev->fEnd - fElemSize; in pop_back()
275 fCurBlock = fCurBlock->fPrev; in prev()
[all …]
|
| D | SkResourceCache.cpp | 219 Rec* prev = rec->fPrev; in purgeAsNeeded()
247 Rec* prev = rec->fPrev; in purgeSharedID()
277 rec = rec->fPrev; in visitAll()
306 Rec* prev = rec->fPrev; in release()
319 next->fPrev = prev; in release()
322 rec->fNext = rec->fPrev = nullptr; in release()
337 fHead->fPrev = rec; in moveToHead()
347 rec->fPrev = nullptr; in addToHead()
350 fHead->fPrev = rec; in addToHead()
373 SkASSERT(nullptr == fHead->fPrev); in validate()
[all …]
|
| D | SkScan_Path.cpp | 48 SkEdge* prev = newEdge->fPrev; in insert_new_edges()
78 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
79 SkASSERT(edge->fPrev->fNext == edge); in validate_edges_for_y()
80 SkASSERT(edge->fNext->fPrev == edge); in validate_edges_for_y()
83 SkASSERT(edge->fPrev->fX <= edge->fX); in validate_edges_for_y()
388 list[i]->fPrev = list[i - 1]; in sort_edges()
439 headEdge.fPrev = nullptr; in sk_fill_path()
443 edge->fPrev = &headEdge; in sk_fill_path()
445 tailEdge.fPrev = last; in sk_fill_path()
718 headEdge.fPrev = nullptr; in sk_fill_triangle()
[all …]
|
| D | SkEdge.h | 29 SkEdge* fPrev; member
57 SkASSERT(fPrev && fNext); in validate()
58 SkASSERT(fPrev->fNext == this); in validate()
59 SkASSERT(fNext->fPrev == this); in validate()
|
| D | SkStrikeCache.cpp | 63 Node* fPrev{nullptr}; member in SkStrikeCache::Node
567 Node* prev = node->fPrev; in internalPurge()
592 SkASSERT(nullptr == node->fPrev && nullptr == node->fNext); in internalAttachToHead()
594 fHead->fPrev = node; in internalAttachToHead()
612 if (node->fPrev) { in internalDetachCache()
613 node->fPrev->fNext = node->fNext; in internalDetachCache()
618 node->fNext->fPrev = node->fPrev; in internalDetachCache()
620 fTail = node->fPrev; in internalDetachCache()
622 node->fPrev = node->fNext = nullptr; in internalDetachCache()
|
| D | SkAnalyticEdge.h | 25 SkAnalyticEdge* fPrev; member
97 SkASSERT(fPrev && fNext); in validate()
98 SkASSERT(fPrev->fNext == this); in validate()
99 SkASSERT(fNext->fPrev == this); in validate()
|
| /external/skqp/src/core/ |
| D | SkScanPriv.h | 46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
52 edge->fPrev = afterMe; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
61 EdgeType* prev = edge->fPrev; in backward_insert_edge_based_on_x()
62 while (prev->fPrev && prev->fX > x) { in backward_insert_edge_based_on_x()
63 prev = prev->fPrev; in backward_insert_edge_based_on_x()
77 while (prev->fPrev && prev->fX > x) { in backward_insert_start()
78 prev = prev->fPrev; in backward_insert_start()
|
| D | SkDeque.cpp | 13 Block* fPrev; member
22 fNext = fPrev = nullptr; in init()
90 fFrontBlock->fPrev = first; in push_front()
129 last->fPrev = fBackBlock; in push_back()
160 first->fPrev = nullptr; in pop_front()
193 last = last->fPrev; in pop_back()
209 if (nullptr == last->fPrev) { in pop_back()
212 SkASSERT(last->fPrev->fEnd); in pop_back()
213 fBack = last->fPrev->fEnd - fElemSize; in pop_back()
275 fCurBlock = fCurBlock->fPrev; in prev()
[all …]
|
| D | SkResourceCache.cpp | 219 Rec* prev = rec->fPrev; in purgeAsNeeded()
247 Rec* prev = rec->fPrev; in purgeSharedID()
277 rec = rec->fPrev; in visitAll()
306 Rec* prev = rec->fPrev; in release()
319 next->fPrev = prev; in release()
322 rec->fNext = rec->fPrev = nullptr; in release()
337 fHead->fPrev = rec; in moveToHead()
347 rec->fPrev = nullptr; in addToHead()
350 fHead->fPrev = rec; in addToHead()
373 SkASSERT(nullptr == fHead->fPrev); in validate()
[all …]
|
| D | SkScan_Path.cpp | 48 SkEdge* prev = newEdge->fPrev; in insert_new_edges()
78 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
79 SkASSERT(edge->fPrev->fNext == edge); in validate_edges_for_y()
80 SkASSERT(edge->fNext->fPrev == edge); in validate_edges_for_y()
83 SkASSERT(edge->fPrev->fX <= edge->fX); in validate_edges_for_y()
388 list[i]->fPrev = list[i - 1]; in sort_edges()
439 headEdge.fPrev = nullptr; in sk_fill_path()
443 edge->fPrev = &headEdge; in sk_fill_path()
445 tailEdge.fPrev = last; in sk_fill_path()
718 headEdge.fPrev = nullptr; in sk_fill_triangle()
[all …]
|
| D | SkEdge.h | 29 SkEdge* fPrev; member
57 SkASSERT(fPrev && fNext); in validate()
58 SkASSERT(fPrev->fNext == this); in validate()
59 SkASSERT(fNext->fPrev == this); in validate()
|
| D | SkStrikeCache.cpp | 49 Node* fPrev{nullptr}; member in SkStrikeCache::Node
542 Node* prev = node->fPrev; in internalPurge()
567 SkASSERT(nullptr == node->fPrev && nullptr == node->fNext); in internalAttachToHead()
569 fHead->fPrev = node; in internalAttachToHead()
587 if (node->fPrev) { in internalDetachCache()
588 node->fPrev->fNext = node->fNext; in internalDetachCache()
593 node->fNext->fPrev = node->fPrev; in internalDetachCache()
595 fTail = node->fPrev; in internalDetachCache()
597 node->fPrev = node->fNext = nullptr; in internalDetachCache()
|
| D | SkAnalyticEdge.h | 25 SkAnalyticEdge* fPrev; member
97 SkASSERT(fPrev && fNext); in validate()
98 SkASSERT(fPrev->fNext == this); in validate()
99 SkASSERT(fNext->fPrev == this); in validate()
|
| /external/skqp/src/gpu/gradients/ |
| D | GrGradientBitmapCache.cpp | 19 Entry* fPrev; member
27 : fPrev(nullptr), in Entry()
63 if (entry->fPrev) { in release()
65 entry->fPrev->fNext = entry->fNext; in release()
72 entry->fNext->fPrev = entry->fPrev; in release()
75 fTail = entry->fPrev; in release()
81 entry->fPrev = nullptr; in attachToHead()
84 fHead->fPrev = entry; in attachToHead()
220 SkASSERT(nullptr == fHead->fPrev); in validate()
240 entry = entry->fPrev; in validate()
|
| /external/skia/src/gpu/gradients/ |
| D | GrGradientBitmapCache.cpp | 19 Entry* fPrev; member
27 : fPrev(nullptr), in Entry()
63 if (entry->fPrev) { in release()
65 entry->fPrev->fNext = entry->fNext; in release()
72 entry->fNext->fPrev = entry->fPrev; in release()
75 fTail = entry->fPrev; in release()
81 entry->fPrev = nullptr; in attachToHead()
84 fHead->fPrev = entry; in attachToHead()
220 SkASSERT(nullptr == fHead->fPrev); in validate()
240 entry = entry->fPrev; in validate()
|
| /external/skia/src/gpu/ |
| D | GrTRecorder.h | 124 block->fPrev = prev; in Alloc()
134 if (block && block->fPrev) { in Free()
135 SkASSERT(block->fPrev->fNext == block); in Free()
136 block->fPrev->fNext = nullptr; in Free()
152 MemBlock* fPrev; member
190 fTailBlock = fTailBlock->fPrev; in pop_back()
310 if (!fBlock->fPrev) { in previous()
314 fBlock = fBlock->fPrev; in previous()
|
| D | GrMemoryPool.cpp | 43 fHead->fPrev = nullptr; in GrMemoryPool()
77 block->fPrev = fTail; in allocate()
125 BlockHeader* prev = block->fPrev; in release()
130 next->fPrev = prev; in release()
181 SkASSERT(prev == block->fPrev); in validate()
|
| /external/skqp/src/gpu/ |
| D | GrTRecorder.h | 124 block->fPrev = prev; in Alloc()
134 if (block && block->fPrev) { in Free()
135 SkASSERT(block->fPrev->fNext == block); in Free()
136 block->fPrev->fNext = nullptr; in Free()
152 MemBlock* fPrev; member
190 fTailBlock = fTailBlock->fPrev; in pop_back()
310 if (!fBlock->fPrev) { in previous()
314 fBlock = fBlock->fPrev; in previous()
|
| D | GrMemoryPool.cpp | 43 fHead->fPrev = nullptr; in GrMemoryPool()
77 block->fPrev = fTail; in allocate()
125 BlockHeader* prev = block->fPrev; in release()
130 next->fPrev = prev; in release()
181 SkASSERT(prev == block->fPrev); in validate()
|
| /external/skqp/src/utils/ |
| D | SkPolyUtils.cpp | 224 OffsetEdge* fPrev; member
288 node->fPrev->fNext = node->fNext; in remove_node()
289 node->fNext->fPrev = node->fPrev; in remove_node()
343 edgeData[curr].fPrev = &edgeData[prev]; in SkInsetConvexPolygon()
352 OffsetEdge* prevEdge = currEdge->fPrev; in SkInsetConvexPolygon()
373 prevEdge = prevEdge->fPrev; in SkInsetConvexPolygon()
402 prevEdge = prevEdge->fPrev; in SkInsetConvexPolygon()
1229 currEdge->fPrev = prevEdge; in SkOffsetSimplePolygon()
1240 currEdge->fPrev = prevEdge; in SkOffsetSimplePolygon()
1253 currEdge->fPrev = prevEdge; in SkOffsetSimplePolygon()
[all …]
|