HomeSort by relevance Sort by last modified time
    Searched refs:fList (Results 1 - 25 of 39) sorted by null

1 2

  /external/chromium_org/third_party/skia/src/core/
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[index].fIndex
    [all...]
SkEdgeBuilder.h 31 SkTDArray<SkEdge*> fList;
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
SkTLList.h 55 Node* node = iter.init(fList, Iter::kHead_IterStart);
72 fList.addToHead(node);
81 fList.addToTail(node);
110 Node* node = fList.head();
119 Node* node = fList.head();
184 INHERITED::init(list.fList, start);
188 return this->nodeToObj(INHERITED::init(list.fList, start));
249 fList.remove(node);
269 SkASSERT((0 == fCount) == fList.isEmpty());
272 fList.validate()
    [all...]
SkPtrRecorder.h 44 int count() const { return fList.count(); }
75 SkTDArray<Pair> fList;
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/
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[index].fIndex
    [all...]
SkEdgeBuilder.h 31 SkTDArray<SkEdge*> fList;
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
SkTLList.h 55 Node* node = iter.init(fList, Iter::kHead_IterStart);
72 fList.addToHead(node);
81 fList.addToTail(node);
110 Node* node = fList.head();
119 Node* node = fList.head();
184 INHERITED::init(list.fList, start);
188 return this->nodeToObj(INHERITED::init(list.fList, start));
249 fList.remove(node);
269 SkASSERT((0 == fCount) == fList.isEmpty());
272 fList.validate()
    [all...]
SkPtrRecorder.h 44 int count() const { return fList.count(); }
75 SkTDArray<Pair> fList;
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/chromium_org/third_party/skia/src/utils/
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);
99 SkASSERT(fList.count() == fCanvasData.count())
    [all...]
SkNWayCanvas.cpp 26 *fList.append() = canvas;
31 int index = fList.find(canvas);
34 fList.removeShuffle(index);
39 fList.unrefAll();
40 fList.reset();
48 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) {
52 if (fIndex < fList.count()) {
53 fCanvas = fList[fIndex++];
61 const SkTDArray<SkCanvas*>& fList;
67 Iter iter(fList);
    [all...]
  /external/skia/src/utils/
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);
99 SkASSERT(fList.count() == fCanvasData.count())
    [all...]
SkNWayCanvas.cpp 26 *fList.append() = canvas;
31 int index = fList.find(canvas);
34 fList.removeShuffle(index);
39 fList.unrefAll();
40 fList.reset();
48 Iter(const SkTDArray<SkCanvas*>& list) : fList(list) {
52 if (fIndex < fList.count()) {
53 fCanvas = fList[fIndex++];
61 const SkTDArray<SkCanvas*>& fList;
67 Iter iter(fList);
    [all...]
  /external/chromium_org/third_party/skia/src/lazy/
SkDiscardableMemoryPool.cpp 86 SkASSERT(fList.isEmpty());
98 SkPoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart);
110 fList.remove(dm);
125 fList.addToHead(dm);
139 fList.remove(dm);
141 SkASSERT(!fList.isInList(dm));
163 fList.remove(dm);
164 fList.addToHead(dm);
SkDiscardableMemoryPool.h 52 SkTInternalLList<SkPoolDiscardableMemory> fList;
  /external/skia/src/lazy/
SkDiscardableMemoryPool.cpp 86 SkASSERT(fList.isEmpty());
98 SkPoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart);
110 fList.remove(dm);
125 fList.addToHead(dm);
139 fList.remove(dm);
141 SkASSERT(!fList.isInList(dm));
163 fList.remove(dm);
164 fList.addToHead(dm);
SkDiscardableMemoryPool.h 52 SkTInternalLList<SkPoolDiscardableMemory> fList;
  /external/chromium_org/third_party/skia/include/core/
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/include/core/
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/gpu/
GrResourceCache.cpp 77 while (GrResourceEntry* entry = fList.head()) {
112 fList.remove(entry);
138 fList.addToHead(entry);
350 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart);
393 SkASSERT(fList.isEmpty());
423 fList.validate();
445 entry = iter.init(const_cast<EntryList&>(fList), EntryList::Iter::kHead_IterStart);
455 size_t bytes = countBytes(fList);
461 SkASSERT(fList.countEntries() == fEntryCount - fClientDetachedCount);
474 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart)
    [all...]
  /external/skia/src/gpu/
GrResourceCache.cpp 77 while (GrResourceEntry* entry = fList.head()) {
112 fList.remove(entry);
138 fList.addToHead(entry);
350 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart);
393 SkASSERT(fList.isEmpty());
423 fList.validate();
445 entry = iter.init(const_cast<EntryList&>(fList), EntryList::Iter::kHead_IterStart);
455 size_t bytes = countBytes(fList);
461 SkASSERT(fList.countEntries() == fEntryCount - fClientDetachedCount);
474 GrResourceEntry* entry = iter.init(fList, EntryList::Iter::kTail_IterStart)
    [all...]
  /frameworks/base/core/tests/coretests/src/android/content/pm/
AppCacheTest.java 63 String fList[] = testDir.list();
64 for(int i = 0; i < fList.length; i++) {
65 File file = new File(testDir, fList[i]);
67 cleanUpDirectory(testDir, fList[i]);
81 String fList[] = testDir.list();
82 if(fList == null) {
86 for(int i = 0; i < fList.length; i++) {
87 File file = new File(testDir, fList[i]);
89 cleanUpDirectory(testDir, fList[i]);
  /frameworks/base/services/java/com/android/server/am/
UsageStatsService.java 286 String fList[] = parentDir.list();
287 if (fList != null) {
289 int i = fList.length;
292 if (fList[i].startsWith(prefix)) {
293 Slog.i(TAG, "Deleting old usage file: " + fList[i]);
294 (new File(parentDir, fList[i])).delete();
453 String fList[] = mDir.list();
454 if (fList == null) {
458 for (String file : fList) {
    [all...]
  /external/chromium_org/third_party/skia/include/utils/
SkNWayCanvas.h 87 SkTDArray<SkCanvas*> fList;

Completed in 149 milliseconds

1 2