| /external/chromium_org/third_party/skia/src/core/ |
| SkDescriptor.h | 35 fCount = 0;
52 fCount += 1;
69 int count = fCount;
115 uint32_t getCount() const { return fCount; }
121 uint32_t fCount;
|
| SkTDynamicHash.h | 33 int count() const { return fCount; }
101 fCount = 0;
114 // Is fCount correct?
121 CHECK(count == fCount);
167 fCount++;
183 fCount--;
193 if (fCount + fDeleted + 1 > (fCapacity * kGrowPercent) / 100) {
199 if (fCount < (fCapacity * kShrinkPercent) / 100 && fCapacity / 2 > kMinCapacity) {
205 SkDEBUGCODE(int oldCount = fCount;)
217 SkASSERT(oldCount == fCount);
[all...] |
| SkRTree.h | 82 bool isEmpty() const { return 0 == fCount; }
88 virtual int getCount() const { return fCount; }
181 size_t fCount;
|
| SkTLList.h | 47 SkTLList(int allocCnt = 1) : fCount(0), fAllocCnt(allocCnt) {
143 SkASSERT(0 == fCount);
147 int count() const { return fCount; }
148 bool isEmpty() const { this->validate(); return 0 == fCount; }
154 if (fCount != list.fCount) {
243 ++fCount;
263 --fCount;
269 SkASSERT((0 == fCount) == fList.isEmpty());
270 SkASSERT((0 != fCount) || fFreeList.isEmpty())
[all...] |
| SkDeque.cpp | 32 , fCount(0)
42 , fCount(0)
71 fCount += 1;
111 fCount += 1;
152 SkASSERT(fCount > 0);
153 fCount -= 1;
186 SkASSERT(fCount > 0);
187 fCount -= 1;
|
| /external/skia/src/core/ |
| SkDescriptor.h | 35 fCount = 0;
52 fCount += 1;
69 int count = fCount;
115 uint32_t getCount() const { return fCount; }
121 uint32_t fCount;
|
| SkTDynamicHash.h | 33 int count() const { return fCount; }
101 fCount = 0;
114 // Is fCount correct?
121 CHECK(count == fCount);
167 fCount++;
183 fCount--;
193 if (fCount + fDeleted + 1 > (fCapacity * kGrowPercent) / 100) {
199 if (fCount < (fCapacity * kShrinkPercent) / 100 && fCapacity / 2 > kMinCapacity) {
205 SkDEBUGCODE(int oldCount = fCount;)
217 SkASSERT(oldCount == fCount);
[all...] |
| SkRTree.h | 82 bool isEmpty() const { return 0 == fCount; }
88 virtual int getCount() const { return fCount; }
181 size_t fCount;
|
| SkTLList.h | 47 SkTLList(int allocCnt = 1) : fCount(0), fAllocCnt(allocCnt) {
143 SkASSERT(0 == fCount);
147 int count() const { return fCount; }
148 bool isEmpty() const { this->validate(); return 0 == fCount; }
154 if (fCount != list.fCount) {
243 ++fCount;
263 --fCount;
269 SkASSERT((0 == fCount) == fList.isEmpty());
270 SkASSERT((0 != fCount) || fFreeList.isEmpty())
[all...] |
| /external/skia/tests/ |
| RefCntTest.cpp | 20 InstCounterClass() { fCount = gInstCounter++; }
22 fCount = src.fCount;
28 int fCount;
52 REPORTER_ASSERT(reporter, i == src[i].fCount);
61 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
68 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
|
| PackBitsTest.cpp | 26 int fCount;
37 gTests[i].fCount, dst);
40 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src,
41 gTests[i].fCount * sizeof(uint16_t)) == 0;
76 int fCount;
87 size_t maxSize = SkPackBits::ComputeMaxSize8(gTests[i].fCount);
89 gTests[i].fCount, dst);
93 bool match = gTests[i].fCount == srcCount &&
95 gTests[i].fCount * sizeof(uint8_t)) == 0;
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTemplates.h | 177 SkDEBUGCODE(fCount = 0;)
187 SkDEBUGCODE(fCount = count;)
199 SkDEBUGCODE(fCount = count;)
213 SkASSERT((unsigned)index < (unsigned)fCount);
219 SkDEBUGCODE(int fCount;)
229 fCount = 0;
236 fCount = 0;
247 T* iter = start + fCount;
252 if (fCount != count) {
253 if (fCount > N)
[all...] |
| SkDataTable.h | 29 bool isEmpty() const { return 0 == fCount; }
34 int count() const { return fCount; }
109 int fCount;
|
| /external/skia/include/core/ |
| SkTemplates.h | 177 SkDEBUGCODE(fCount = 0;)
187 SkDEBUGCODE(fCount = count;)
199 SkDEBUGCODE(fCount = count;)
213 SkASSERT((unsigned)index < (unsigned)fCount);
219 SkDEBUGCODE(int fCount;)
229 fCount = 0;
236 fCount = 0;
247 T* iter = start + fCount;
252 if (fCount != count) {
253 if (fCount > N)
[all...] |
| SkDataTable.h | 29 bool isEmpty() const { return 0 == fCount; }
34 int count() const { return fCount; }
109 int fCount;
|
| /external/chromium_org/third_party/skia/include/effects/ |
| SkDashPathEffect.h | 60 int32_t fCount;
|
| /external/skia/include/effects/ |
| SkDashPathEffect.h | 60 int32_t fCount;
|
| /external/chromium_org/third_party/icu/source/i18n/unicode/ |
| sortkey.h | 285 int32_t fCount;
316 count = fCount;
|
| /external/chromium_org/third_party/skia/src/text/ |
| SkTextLayout.cpp | 57 int fCount;
60 SkTextLayout::GlyphRun::GlyphRun() : fLocs(NULL), fGlyphIDs(NULL), fCount(0) {}
|
| /external/skia/src/text/ |
| SkTextLayout.cpp | 57 int fCount;
60 SkTextLayout::GlyphRun::GlyphRun() : fLocs(NULL), fGlyphIDs(NULL), fCount(0) {}
|
| /external/skia/bench/ |
| SortBench.cpp | 103 int fCount;
112 fCount = n;
126 memcpy(fSorted, fUnsorted, fCount * sizeof(int));
127 fSortProc(fSorted, fCount);
129 for (int j = 1; j < fCount; ++j) {
|
| GradientBench.cpp | 19 int fCount;
48 data.fCount, tm, mapper);
59 data.fPos, data.fCount, tm, mapper);
70 data.fPos, data.fCount, mapper);
85 data.fColors, data.fPos, data.fCount, tm, mapper);
99 data.fColors, data.fPos, data.fCount, tm, mapper);
162 int fCount;
190 fCount = SkBENCHLOOP(N * gGrads[gradType].fRepeat);
211 for (int i = 0; i < fCount; i++) {
|
| /external/skia/gm/ |
| gradientDirtyLaundry.cpp | 14 int fCount;
41 data.fCount, tm, mapper);
50 data.fPos, data.fCount, tm, mapper);
59 data.fPos, data.fCount, mapper);
|
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGpuGL_program.cpp | 40 : fCount(0)
55 for (int i = 0; i < fCount; ++i){
73 for (int i = 0; i < fCount; ++i) {
78 fCount = 0;
83 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
128 if (fCount < kMaxEntries) {
130 purgeIdx = fCount++;
133 GrAssert(fCount == kMaxEntries);
171 for (int i = 0; i < fCount - 1; ++i) {
186 for (int i = 0; i < fCount; ++i)
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGpuGL_program.cpp | 40 : fCount(0)
55 for (int i = 0; i < fCount; ++i){
73 for (int i = 0; i < fCount; ++i) {
78 fCount = 0;
83 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less);
128 if (fCount < kMaxEntries) {
130 purgeIdx = fCount++;
133 GrAssert(fCount == kMaxEntries);
171 for (int i = 0; i < fCount - 1; ++i) {
186 for (int i = 0; i < fCount; ++i)
[all...] |
