/external/chromium_org/third_party/skia/include/core/ |
H A D | SkDeque.h | 36 bool empty() const { return 0 == fCount; } 37 int count() const { return fCount; } 125 int fCount; // number of elements in the deque member in class:SkDeque
|
H A D | SkTemplates.h | 212 SkDEBUGCODE(fCount = 0;) 222 SkDEBUGCODE(fCount = count;) 234 SkDEBUGCODE(fCount = count;) 248 SkASSERT((unsigned)index < (unsigned)fCount); 254 SkDEBUGCODE(int fCount;) 264 fCount = 0; 271 fCount = 0; 282 T* iter = start + fCount; 287 if (fCount != count) { 288 if (fCount > [all...] |
H A D | SkDataTable.h | 28 bool isEmpty() const { return 0 == fCount; } 33 int count() const { return fCount; } 102 int fCount; member in class:SkDataTable
|
/external/chromium_org/third_party/skia/include/ports/ |
H A D | SkRemotableFontMgr.h | 42 int count() const { return fCount; } 48 SkRemotableFontIdentitySet() : fCount(0), fData() { } 51 int fCount; member in class:SkRemotableFontIdentitySet
|
/external/junit/src/org/junit/runner/ |
H A D | Result.java | 19 private AtomicInteger fCount = new AtomicInteger(); field in class:Result 29 return fCount.get(); 81 fCount.getAndIncrement();
|
/external/skia/include/core/ |
H A D | SkDeque.h | 36 bool empty() const { return 0 == fCount; } 37 int count() const { return fCount; } 125 int fCount; // number of elements in the deque member in class:SkDeque
|
H A D | SkTemplates.h | 199 SkDEBUGCODE(fCount = 0;) 209 SkDEBUGCODE(fCount = count;) 221 SkDEBUGCODE(fCount = count;) 235 SkASSERT((unsigned)index < (unsigned)fCount); 241 SkDEBUGCODE(int fCount;) 251 fCount = 0; 258 fCount = 0; 269 T* iter = start + fCount; 274 if (fCount != count) { 275 if (fCount > [all...] |
H A D | SkDataTable.h | 28 bool isEmpty() const { return 0 == fCount; } 33 int count() const { return fCount; } 102 int fCount; member in class:SkDataTable
|
/external/skia/include/ports/ |
H A D | SkRemotableFontMgr.h | 42 int count() const { return fCount; } 48 SkRemotableFontIdentitySet() : fCount(0), fData() { } 51 int fCount; member in class:SkRemotableFontIdentitySet
|
/external/skia/src/core/ |
H A D | SkTDynamicHash.h | 25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(NULL) { 60 int count() const { return fCount; } 127 if (fCount < kLarge * kLarge) { 128 // Are fCount and fDeleted correct, and are all elements findable? 138 SKTDYNAMICHASH_CHECK(count == fCount); 143 if (fCount < kLarge) { 171 fCount++; 187 fCount--; 197 if (100 * (fCount + fDeleted + 1) > fCapacity * kGrowPercent) { 203 SkDEBUGCODE(int oldCount = fCount;) 236 int fCount; // Number of non Empty(), non Deleted() entries in fArray. member in class:SkTDynamicHash [all...] |
H A D | SkRecord.h | 31 : fAlloc(chunkBytes), fCount(0), fReserved(0), kFirstReserveCount(firstReserveCount) {} 41 unsigned count() const { return fCount; } 75 if (fCount == fReserved) { 81 fTypes[fCount] = T::kType; 82 return fRecords[fCount++].set(this->allocCommand<T>()); 228 // fCount and fReserved measure both fRecords and fTypes, which always grow in lock step. 229 unsigned fCount; member in class:SkRecord
|
H A D | SkMipMap.h | 34 int fCount; member in class:SkMipMap
|
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleAnimatedGradient.cpp | 20 int fCount; member in struct:GradientView::GradData 58 pts, data.fColors, data.fPos,data.fCount, 67 s, 100, data.fColors, data.fPos, data.fCount, 74 p, 0, q, 100, data.fColors, data.fPos, data.fCount, 81 100, 100, data.fColors, data.fPos, data.fCount);
|
/external/skia/samplecode/ |
H A D | SampleAnimatedGradient.cpp | 20 int fCount; member in struct:GradientView::GradData 58 pts, data.fColors, data.fPos,data.fCount, 67 s, 100, data.fColors, data.fPos, data.fCount, 74 p, 0, q, 100, data.fColors, data.fPos, data.fCount, 81 100, 100, data.fColors, data.fPos, data.fCount);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | RefCntTest.cpp | 17 InstCounterClass() { fCount = gInstCounter++; } 19 fCount = src.fCount; 25 int fCount; member in class:InstCounterClass 49 REPORTER_ASSERT(reporter, i == src[i].fCount); 58 REPORTER_ASSERT(reporter, i == (*array)[i].fCount); 65 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
|
H A D | AsADashTest.cpp | 42 REPORTER_ASSERT(reporter, 4 == info.fCount); 46 SkAutoTArray<SkScalar> intervals(info.fCount); 55 REPORTER_ASSERT(reporter, 4 == info.fCount);
|
H A D | PackBitsTest.cpp | 26 int fCount; member in struct:__anon15397 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; member in struct:__anon15398 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/skia/tests/ |
H A D | RefCntTest.cpp | 17 InstCounterClass() { fCount = gInstCounter++; } 19 fCount = src.fCount; 25 int fCount; member in class:InstCounterClass 49 REPORTER_ASSERT(reporter, i == src[i].fCount); 58 REPORTER_ASSERT(reporter, i == (*array)[i].fCount); 65 REPORTER_ASSERT(reporter, i == (*array)[i].fCount);
|
H A D | AsADashTest.cpp | 42 REPORTER_ASSERT(reporter, 4 == info.fCount); 46 SkAutoTArray<SkScalar> intervals(info.fCount); 55 REPORTER_ASSERT(reporter, 4 == info.fCount);
|
H A D | PackBitsTest.cpp | 26 int fCount; member in struct:__anon30800 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; member in struct:__anon30801 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/skia/src/effects/ |
H A D | SkDashPathEffect.cpp | 20 fCount = count; 27 SkDashPath::CalcDashParameters(phase, fIntervals, fCount, &fInitialDashLength, 37 return SkDashPath::FilterDashPath(dst, src, rec, cullRect, fIntervals, fCount, 60 if (fCount != 2 || 229 if (info->fCount >= fCount && NULL != info->fIntervals) { 230 memcpy(info->fIntervals, fIntervals, fCount * sizeof(SkScalar)); 232 info->fCount = fCount; 245 buffer.writeScalarArray(fIntervals, fCount); [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRecord.h | 34 SkRecord() : fAlloc(kChunkBytes), fCount(0), fReserved(0) {} 44 unsigned count() const { return fCount; } 79 if (fCount == fReserved) { 85 fTypes[fCount] = T::kType; 86 return fRecords[fCount++].set(this->allocCommand<T>()); 232 // fCount and fReserved measure both fRecords and fTypes, which always grow in lock step. 233 unsigned fCount; member in class:SkRecord
|
H A D | SkMipMap.h | 34 int fCount; member in class:SkMipMap
|
/external/skia/bench/ |
H A D | MemcpyBench.cpp | 17 : fCount(count) 30 fDst.reset(fCount); 31 fSrc.reset(fCount); 34 for (int i = 0; i < fCount; i++) { 41 fMemcpy32(fDst, fSrc, fCount); 48 int fCount; member in class:Memcpy32Bench
|
/external/chromium_org/third_party/skia/src/gpu/gl/ |
H A D | GrGpuGL_program.cpp | 45 : fCount(0) 60 for (int i = 0; i < fCount; ++i){ 80 for (int i = 0; i < fCount; ++i) { 85 fCount = 0; 90 return SkTSearch(fEntries, fCount, desc, sizeof(Entry*), less); 137 if (fCount < kMaxEntries) { 139 purgeIdx = fCount++; 142 SkASSERT(fCount == kMaxEntries); 180 for (int i = 0; i < fCount - 1; ++i) { 195 for (int i = 0; i < fCount; [all...] |