| /external/skia/src/animator/ |
| SkTDArray_Experimental.h | 53 bool isEmpty() const { return fCount == 0; }
54 int count() const { return fCount; }
58 SkASSERT(index + count <= fCount);
59 fCount = SkToU16(fCount - count);
60 memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
72 fReserve = fCount = 0;
76 SkASSERT(fReserve == 0 && fCount == 0);
83 this->growBy(count - fCount);
85 fCount = SkToU16(count)
[all...] |
| /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;
|
| SkFontStream.cpp | 104 SfntHeader() : fCount(0), fDir(NULL) {}
107 /** If it returns true, then fCount and fDir are properly initialized.
117 fCount = count_tables(stream, ttcIndex, &offsetToDir);
118 if (0 == fCount) {
127 size_t size = fCount * sizeof(SkSFNTDirEntry);
132 int fCount;
163 for (int i = 0; i < header.fCount; i++) {
167 return header.fCount;
178 for (int i = 0; i < header.fCount; i++) {
|
| SkRTree.h | 83 bool isEmpty() const { return 0 == fCount; }
89 virtual int getCount() const { return fCount; }
182 int fCount;
|
| SkTDynamicHash.h | 33 int count() const { return fCount; }
99 fCount = 0;
112 // Is fCount correct?
119 SKTDYNAMICHASH_CHECK(count == fCount);
165 fCount++;
181 fCount--;
191 if (fCount + fDeleted + 1 > (fCapacity * kGrowPercent) / 100) {
197 if (fCount < (fCapacity * kShrinkPercent) / 100 && fCapacity / 2 > kMinCapacity) {
203 SkDEBUGCODE(int oldCount = fCount;)
215 SkASSERT(oldCount == fCount);
[all...] |
| SkGeometry.cpp | 873 int fCount;
886 memcpy(dst, data[i].fData, data[i].fCount * sizeof(dst[0]));
887 int count = collaps_duplicates(dst, data[i].fCount);
[all...] |
| 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/src/gpu/ |
| GrAllocator.h | 35 fCount(0) {
51 SkASSERT(0 == fCount);
64 int indexInBlock = fCount % fItemsPerBlock;
67 if (0 != fCount) {
73 void* ret = (char*)fBlocks[fCount/fItemsPerBlock] +
75 ++fCount;
84 GrUIDivRoundUp(fCount, fItemsPerBlock));
93 fCount = 0;
100 return fCount;
106 bool empty() const { return fCount == 0;
[all...] |
| /external/skia/src/gpu/gl/ |
| GrGLVertexArray.h | 23 GrGLint fCount;
|
| GrGLShaderVar.h | 64 fCount = kNonArray;
75 fCount = arrayCount;
86 , fCount(var.fCount)
114 fCount = kNonArray;
133 fCount = kNonArray;
153 fCount = count;
173 fCount = count;
182 bool isArray() const { return kNonArray != fCount; }
186 bool isUnsizedArray() const { return kUnsizedArray == fCount; }
[all...] |
| /external/chromium_org/third_party/icu/source/tools/genrb/ |
| reslist.h | 107 uint32_t fCount;
117 uint32_t fCount;
145 uint32_t fCount;
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkTArray.h | 21 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
25 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
30 for (int i = 0; i < self->fCount; ++i) {
36 for (int i = 0; i < self->fCount; ++i) {
57 fCount = 0;
76 this->init(array.fItemArray, array.fCount, NULL, 0);
92 for (int i = 0; i < fCount; ++i) {
95 fCount = 0;
97 fCount = array.count();
103 for (int i = 0; i < fCount; ++i)
[all...] |
| SkTDArray.h | 18 fReserve = fCount = 0;
27 fReserve = fCount = 0;
38 fReserve = fCount = count;
42 fReserve = fCount = 0;
47 SkTDArray<T> tmp(src.fArray, src.fCount);
56 if (src.fCount > fReserve) {
57 SkTDArray<T> tmp(src.fArray, src.fCount);
60 memcpy(fArray, src.fArray, sizeof(T) * src.fCount);
61 fCount = src.fCount;
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/gl/ |
| GrGLShaderVar.h | 64 fCount = kNonArray;
75 fCount = arrayCount;
86 , fCount(var.fCount)
114 fCount = kNonArray;
133 fCount = kNonArray;
153 fCount = count;
173 fCount = count;
182 bool isArray() const { return kNonArray != fCount; }
186 bool isUnsizedArray() const { return kUnsizedArray == fCount; }
[all...] |
| /external/icu4c/tools/genrb/ |
| reslist.h | 107 uint32_t fCount;
117 uint32_t fCount;
145 uint32_t fCount;
|
| /external/skia/bench/ |
| GradientBench.cpp | 19 int fCount;
51 data.fCount, tm, mapper);
62 data.fPos, data.fCount, tm, mapper);
73 data.fPos, data.fCount, mapper);
88 data.fColors, data.fPos, data.fCount, tm, mapper);
102 data.fColors, data.fPos, data.fCount, tm, mapper);
|
| /external/skia/gm/ |
| shadertext.cpp | 51 int fCount;
68 data.fCount, tm, mapper);
77 data.fPos, data.fCount, tm, mapper);
86 data.fPos, data.fCount, mapper);
99 data.fColors, data.fPos, data.fCount, tm, mapper);
|
| gradients.cpp | 14 int fCount;
45 data.fCount, tm, mapper);
54 data.fPos, data.fCount, tm, mapper);
63 data.fPos, data.fCount, mapper);
76 data.fColors, data.fPos, data.fCount, tm, mapper);
89 data.fCount, tm, mapper);
|
| /external/skia/include/core/ |
| SkTArray.h | 21 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
25 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
30 for (int i = 0; i < self->fCount; ++i) {
36 for (int i = 0; i < self->fCount; ++i) {
57 fCount = 0;
76 this->init(array.fItemArray, array.fCount, NULL, 0);
92 for (int i = 0; i < fCount; ++i) {
95 fCount = 0;
97 fCount = array.count();
103 for (int i = 0; i < fCount; ++i)
[all...] |
| SkTDArray.h | 18 fReserve = fCount = 0;
27 fReserve = fCount = 0;
38 fReserve = fCount = count;
42 fReserve = fCount = 0;
47 SkTDArray<T> tmp(src.fArray, src.fCount);
56 if (src.fCount > fReserve) {
57 SkTDArray<T> tmp(src.fArray, src.fCount);
60 memcpy(fArray, src.fArray, sizeof(T) * src.fCount);
61 fCount = src.fCount;
[all...] |
| /external/skia/tests/ |
| ScalarTest.cpp | 18 size_t fCount;
46 size_t fCount;
60 r.set(gSets[i].fPts, gSets[i].fCount);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkGeometry.cpp | 873 int fCount;
886 memcpy(dst, data[i].fData, data[i].fCount * sizeof(dst[0]));
887 int count = collaps_duplicates(dst, data[i].fCount);
[all...] |
| 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/chromium_org/third_party/skia/src/effects/gradients/ |
| SkGradientShaderPriv.h | 93 int fCount;
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRedBlackTree.h | 69 bool empty() const {return 0 == fCount;}
74 int count() const {return fCount;}
171 int fCount;
226 fCount = 0;
335 fCount = 0;
342 ++fCount;
379 SkASSERT(1 == fCount);
587 --fCount;
628 SkASSERT(0 == fCount);
847 if (fCount) {
[all...] |
