/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 12 Pair* p = fList.begin(); 13 Pair* stop = fList.end(); 18 fList.reset(); 30 int count = fList.count(); 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 38 return fList[index].fIndex; 46 int count = fList.count(); 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 55 *fList.insert(index) = pair; 58 return fList[inde [all...] |
H A D | SkPtrRecorder.h | 44 int count() const { return fList.count(); } 74 return fIndex < fSet.fList.count() ? fSet.fList[fIndex++].fPtr : NULL; 96 SkTDArray<Pair> fList; member in class:SkPtrSet
|
H A D | SkTLList.h | 55 Node* node = iter.init(fList, Iter::kHead_IterStart); 72 fList.addToHead(node); 81 fList.addToHead(node); 90 fList.addToTail(node); 99 fList.addToTail(node); 128 Node* node = fList.head(); 137 Node* node = fList.head(); 202 INHERITED::init(list.fList, start); 206 return this->nodeToObj(INHERITED::init(list.fList, start)); 267 fList 360 NodeList fList; member in class:SkTLList [all...] |
H A D | SkEdgeBuilder.h | 31 SkTDArray<SkEdge*> fList; member in class:SkEdgeBuilder 34 * If we're in general mode, we allcoate the pointers in fList, and this 35 * will point at fList.begin(). If we're in polygon mode, fList will be
|
H A D | SkEdgeBuilder.cpp | 28 fList.push(edge); 37 fList.push(edge); 46 fList.push(edge); 167 fList.reset(); 278 fEdgeList = fList.begin(); 279 return fList.count();
|
/external/skia/src/core/ |
H A D | SkPtrRecorder.cpp | 12 Pair* p = fList.begin(); 13 Pair* stop = fList.end(); 18 fList.reset(); 30 int count = fList.count(); 34 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 38 return fList[index].fIndex; 46 int count = fList.count(); 50 int index = SkTSearch<Pair, Less>(fList.begin(), count, pair, sizeof(pair)); 55 *fList.insert(index) = pair; 58 return fList[inde [all...] |
H A D | SkTLList.h | 55 Node* node = iter.init(fList, Iter::kHead_IterStart); 72 fList.addToHead(node); 81 fList.addToHead(node); 90 fList.addToTail(node); 99 fList.addToTail(node); 128 Node* node = fList.head(); 137 Node* node = fList.head(); 202 INHERITED::init(list.fList, start); 206 return this->nodeToObj(INHERITED::init(list.fList, start)); 267 fList 360 NodeList fList; member in class:SkTLList [all...] |
H A D | SkEdgeBuilder.h | 31 SkTDArray<SkEdge*> fList; member in class:SkEdgeBuilder 34 * If we're in general mode, we allcoate the pointers in fList, and this 35 * will point at fList.begin(). If we're in polygon mode, fList will be
|
H A D | SkPtrRecorder.h | 44 int count() const { return fList.count(); } 75 SkTDArray<Pair> fList; member in class:SkPtrSet
|
H A D | SkEdgeBuilder.cpp | 28 fList.push(edge); 37 fList.push(edge); 46 fList.push(edge); 167 fList.reset(); 278 fEdgeList = fList.begin(); 279 return fList.count();
|
/external/skia/src/utils/ |
H A D | SkNWayCanvas.cpp | 20 *fList.append() = canvas; 25 int index = fList.find(canvas); 28 fList.removeShuffle(index); 33 fList.unrefAll(); 34 fList.reset(); 42 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) { 46 if (fIndex < fList.count()) { 47 fCanvas = fList[fIndex++]; 55 const SkTDArray<SkCanvas*>& fList; member in class:SkNWayCanvas::Iter 61 Iter iter(fList); [all...] |
H A D | SkCanvasStack.cpp | 33 for (int i = fList.count() - 1; i > 0; --i) { 38 fList[i-1]->clipRegion(fCanvasData[i-1].requiredClip); 41 SkASSERT(fList.count() == fCanvasData.count()); 55 SkASSERT(fList.count() == fCanvasData.count()); 56 for (int i = 0; i < fList.count(); ++i) { 57 fList[i]->clipRegion(fCanvasData[i].requiredClip, SkRegion::kIntersect_Op); 69 SkASSERT(fList.count() == fCanvasData.count()); 70 for (int i = 0; i < fList.count(); ++i) { 75 fList[i]->setMatrix(tempMatrix); 96 SkASSERT(fList [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCanvasStack.cpp | 33 for (int i = fList.count() - 1; i > 0; --i) { 38 fList[i-1]->clipRegion(fCanvasData[i-1].requiredClip); 41 SkASSERT(fList.count() == fCanvasData.count()); 55 SkASSERT(fList.count() == fCanvasData.count()); 56 for (int i = 0; i < fList.count(); ++i) { 57 fList[i]->clipRegion(fCanvasData[i].requiredClip, SkRegion::kIntersect_Op); 69 SkASSERT(fList.count() == fCanvasData.count()); 70 for (int i = 0; i < fList.count(); ++i) { 75 fList[i]->setMatrix(tempMatrix); 96 SkASSERT(fList [all...] |
H A D | SkNWayCanvas.cpp | 20 *fList.append() = canvas; 25 int index = fList.find(canvas); 28 fList.removeShuffle(index); 33 fList.unrefAll(); 34 fList.reset(); 42 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) { 46 if (fIndex < fList.count()) { 47 fCanvas = fList[fIndex++]; 55 const SkTDArray<SkCanvas*>& fList; member in class:SkNWayCanvas::Iter 61 Iter iter(fList); [all...] |
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkTInternalLList.h | 34 SkDEBUGCODE(SkPtrWrapper<SkTInternalLList<ClassName> > fList;) \ 70 entry->fList = NULL; 76 SkASSERT(NULL == entry->fList); 89 entry->fList = this; 95 SkASSERT(NULL == entry->fList); 108 entry->fList = this; 137 newEntry->fList = this; 166 newEntry->fList = this; 250 return entry->fList == this;
|
/external/chromium_org/third_party/skia/src/lazy/ |
H A D | SkDiscardableMemoryPool.cpp | 58 SkTInternalLList<PoolDiscardableMemory> fList; member in class:__anon15322::DiscardableMemoryPool 145 SkASSERT(fList.isEmpty()); 157 PoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart); 169 fList.remove(dm); 184 fList.addToHead(dm); 198 fList.remove(dm); 200 SkASSERT(!fList.isInList(dm)); 222 fList.remove(dm); 223 fList.addToHead(dm);
|
/external/skia/include/core/ |
H A D | SkTInternalLList.h | 34 SkDEBUGCODE(SkPtrWrapper<SkTInternalLList<ClassName> > fList;) \ 70 entry->fList = NULL; 76 SkASSERT(NULL == entry->fList); 89 entry->fList = this; 95 SkASSERT(NULL == entry->fList); 108 entry->fList = this; 137 newEntry->fList = this; 166 newEntry->fList = this; 250 return entry->fList == this;
|
/external/skia/src/lazy/ |
H A D | SkDiscardableMemoryPool.cpp | 57 SkTInternalLList<PoolDiscardableMemory> fList; member in class:__anon30735::DiscardableMemoryPool 144 SkASSERT(fList.isEmpty()); 156 PoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart); 168 fList.remove(dm); 183 fList.addToHead(dm); 197 fList.remove(dm); 199 SkASSERT(!fList.isInList(dm)); 221 fList.remove(dm); 222 fList.addToHead(dm);
|
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleDraw.cpp | 262 SkTDArray<Draw*> fList; member in class:DrawView 270 fList.unrefAll(); 285 Draw** first = fList.begin(); 286 for (Draw** iter = fList.end(); iter > first;) { 315 for (Draw** iter = fList.begin(); iter < fList.end(); iter++) { 324 for (Draw** iter = fList.begin(); iter < fList.end(); iter++) { 343 *fList.append() = fDraw; 361 for (Draw** iter = fList [all...] |
/external/skia/samplecode/ |
H A D | SampleDraw.cpp | 262 SkTDArray<Draw*> fList; member in class:DrawView 270 fList.unrefAll(); 285 Draw** first = fList.begin(); 286 for (Draw** iter = fList.end(); iter > first;) { 315 for (Draw** iter = fList.begin(); iter < fList.end(); iter++) { 324 for (Draw** iter = fList.begin(); iter < fList.end(); iter++) { 343 *fList.append() = fDraw; 361 for (Draw** iter = fList [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrResourceCache.cpp | 106 while (GrResourceCacheEntry* entry = fList.head()) { 141 fList.remove(entry); 167 fList.addToHead(entry); 403 GrResourceCacheEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); 446 SkASSERT(fList.isEmpty()); 476 fList.validate(); 495 entry = iter.init(const_cast<EntryList&>(fList), EntryList::Iter::kHead_IterStart); 505 size_t bytes = countBytes(fList); 511 SkASSERT(fList.countEntries() == fEntryCount - fClientDetachedCount); 524 GrResourceCacheEntry* entry = iter.init(fList, EntryLis [all...] |
/external/skia/src/gpu/ |
H A D | GrResourceCache.cpp | 106 while (GrResourceCacheEntry* entry = fList.head()) { 141 fList.remove(entry); 167 fList.addToHead(entry); 403 GrResourceCacheEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart); 446 SkASSERT(fList.isEmpty()); 476 fList.validate(); 495 entry = iter.init(const_cast<EntryList&>(fList), EntryList::Iter::kHead_IterStart); 505 size_t bytes = countBytes(fList); 511 SkASSERT(fList.countEntries() == fEntryCount - fClientDetachedCount); 524 GrResourceCacheEntry* entry = iter.init(fList, EntryLis [all...] |
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | SkAntiEdge.h | 67 SkTDArray<SkAntiEdge*> fList; member in class:SkAntiEdgeBuilder
|
/external/skia/experimental/Intersection/ |
H A D | SkAntiEdge.h | 67 SkTDArray<SkAntiEdge*> fList; member in class:SkAntiEdgeBuilder
|
/external/chromium_org/third_party/skia/include/utils/ |
H A D | SkNWayCanvas.h | 60 SkTDArray<SkCanvas*> fList; member in class:SkNWayCanvas
|