| /external/skia/include/core/ |
| SkTDStack.h | 24 SkTDStack() : fCount(0), fTotalCount(0)
29 // fCount = kSlotCount;
48 SkASSERT(fCount <= kSlotCount);
49 if (fCount == kSlotCount)
54 fCount = 0;
57 return &fRec->fSlots[fCount++];
62 SkASSERT(fRec && fCount > idx);
63 return fRec->fSlots[fCount - idx - 1];
67 SkASSERT(fRec && fCount > idx);
68 return fRec->fSlots[fCount - idx - 1]
[all...] |
| SkTDArray.h | 25 fReserve = fCount = 0;
34 fReserve = fCount = 0;
45 fReserve = fCount = count;
49 fReserve = fCount = 0;
54 SkTDArray<T> tmp(src.fArray, src.fCount);
63 if (src.fCount > fReserve) {
64 SkTDArray<T> tmp(src.fArray, src.fCount);
67 memcpy(fArray, src.fArray, sizeof(T) * src.fCount);
68 fCount = src.fCount;
[all...] |
| SkDeque.h | 28 bool empty() const { return 0 == fCount; }
29 int count() const { return fCount; }
69 int fCount;
|
| SkPerspIter.h | 52 int fCount;
|
| SkTemplates.h | 99 SkDEBUGCODE(fCount = count;)
113 SkASSERT((unsigned)index < fCount);
119 SkDEBUGCODE(size_t fCount;)
136 fCount = count;
140 if (fCount > N) {
144 T* iter = start + fCount;
153 size_t count() const { return fCount; }
162 SkASSERT((unsigned)index < fCount);
167 size_t fCount;
|
| SkDescriptor.h | 45 fCount = 0;
62 fCount += 1;
82 int count = fCount;
130 uint32_t getCount() const { return fCount; }
136 uint32_t fCount;
|
| /external/chromium/third_party/icu/source/i18n/ |
| nfrlist.h | 36 uint32_t fCount;
41 , fCount(0)
45 for(uint32_t i = 0; i < fCount; ++i) {
57 fCount -= 1;
58 for (uint32_t i = index; i < fCount; ++i) { // assumes small arrays
64 if (fCount == fCapacity) {
69 fStuff[fCount++] = thing;
72 fCount = 0;
75 uint32_t size() const { return fCount; }
76 NFRule* last() const { return (fCount > 0 && fStuff != NULL) ? fStuff[fCount-1] : NULL;
[all...] |
| digitlst.cpp | 98 fCount = other.fCount;
101 uprv_strncpy(fDigits, other.fDigits, fCount);
113 fCount == that.fCount &&
116 uprv_strncmp(fDigits, that.fDigits, fCount) == 0));
126 fCount = 0;
130 // Don't bother initializing fDigits because fCount is 0.
195 if (fCount == 0) {
210 *(fDigits+fCount) = 'e'; // add an e after the digits
[all...] |
| sortkey.cpp | 49 : UObject(), fBogus(FALSE), fCount(0), fCapacity(0),
56 : UObject(), fBogus(FALSE), fCount(count), fCapacity(count),
67 uprv_memcpy(fBytes, newValues, fCount);
71 : UObject(other), fBogus(FALSE), fCount(other.fCount), fCapacity(other.fCapacity),
88 uprv_memcpy(fBytes, other.fBytes, other.fCount);
89 if(fCapacity>fCount) {
90 uprv_memset(fBytes+fCount, 0, fCapacity-fCount);
105 fCount = count
[all...] |
| choicfmt.cpp | 75 fCount(0)
90 fCount(0)
104 fCount(0)
132 fCount(0)
144 if (fCount != thatAlias.fCount) return FALSE;
147 for (int32_t i = 0; i < fCount; i++) {
164 fCount = that.fCount;
172 fChoiceLimits = (double*) uprv_malloc( sizeof(double) * fCount);
[all...] |
| digitlst.h | 105 * you hit the decimal point, you set myDigitList.fDecimalAt = myDigitList.fCount;
207 * is > fCount, then trailing zeros between the fDigits[fCount-1] and the
216 * unlimited magnitude. The fCount value contains the number of significant
219 * Zero is represented by any DigitList with fCount == 0 or with each fDigits[i]
220 * for all i <= fCount == '0'.
223 int32_t fCount;
251 if (fCount < MAX_DIGITS)
252 fDigits[fCount++] = digit;
|
| /external/icu4c/i18n/ |
| nfrlist.h | 36 uint32_t fCount;
41 , fCount(0)
45 for(uint32_t i = 0; i < fCount; ++i) {
57 fCount -= 1;
58 for (uint32_t i = index; i < fCount; ++i) { // assumes small arrays
64 if (fCount == fCapacity) {
69 fStuff[fCount++] = thing;
72 fCount = 0;
75 uint32_t size() const { return fCount; }
76 NFRule* last() const { return (fCount > 0 && fStuff != NULL) ? fStuff[fCount-1] : NULL;
[all...] |
| sortkey.cpp | 49 : UObject(), fBogus(FALSE), fCount(0), fCapacity(0),
56 : UObject(), fBogus(FALSE), fCount(count), fCapacity(count),
67 uprv_memcpy(fBytes, newValues, fCount);
71 : UObject(other), fBogus(FALSE), fCount(other.fCount), fCapacity(other.fCapacity),
88 uprv_memcpy(fBytes, other.fBytes, other.fCount);
89 if(fCapacity>fCount) {
90 uprv_memset(fBytes+fCount, 0, fCapacity-fCount);
105 fCount = count
[all...] |
| choicfmt.cpp | 75 fCount(0)
90 fCount(0)
104 fCount(0)
132 fCount(0)
144 if (fCount != thatAlias.fCount) return FALSE;
147 for (int32_t i = 0; i < fCount; i++) {
164 fCount = that.fCount;
172 fChoiceLimits = (double*) uprv_malloc( sizeof(double) * fCount);
[all...] |
| /external/skia/src/animator/ |
| SkTypedArray.cpp | 39 fReserve = fCount = 0;
48 fReserve = fCount = 0;
53 SkDS32Array tmp(src.fArray, src.fCount);
61 fReserve = fCount = 0;
73 fReserve = fCount = SkToU16(count);
81 if (src.fCount > fReserve)
83 SkDS32Array tmp(src.fArray, src.fCount);
88 memcpy(fArray, src.fArray, sizeof(int32_t) * src.fCount);
89 fCount = src.fCount;
[all...] |
| SkTDArray_Experimental.h | 61 bool isEmpty() const { return fCount == 0; }
62 int count() const { return fCount; }
66 SkASSERT(index + count <= fCount);
67 fCount = SkToU16(fCount - count);
68 memmove(fArray + index, fArray + index + count, sizeof(int32_t) * (fCount - index));
80 fReserve = fCount = 0;
84 SkASSERT(fReserve == 0 && fCount == 0);
91 this->growBy(count - fCount);
93 fCount = SkToU16(count)
[all...] |
| /external/skia/src/core/ |
| SkColorTable.cpp | 30 fCount = SkToU16(count);
43 fCount = SkToU16(count);
60 fCount = SkToU16(count);
117 f16BitCache = (uint16_t*)sk_malloc_throw(fCount * sizeof(uint16_t));
118 build_16bitcache(f16BitCache, fColors, fCount);
150 fCount = buffer.readU16();
151 SkASSERT((unsigned)fCount <= 256);
155 fColors = (SkPMColor*)sk_malloc_throw(fCount * sizeof(SkPMColor));
156 buffer.read(fColors, fCount * sizeof(SkPMColor));
|
| SkPictureFlat.h | 57 int count() const { return fCount; }
65 buffer.setRefCntArray(fArray, fCount);
69 int fCount;
76 buffer.setTypefaceArray((SkTypeface**)fArray, fCount);
82 SkFactoryPlayback(int count) : fCount(count) {
93 buffer.setFactoryPlayback(fArray, fCount);
97 int fCount;
|
| /external/skia/src/effects/ |
| SkDashPathEffect.cpp | 44 fCount = count;
71 SkASSERT(fInitialDashIndex >= 0 && fInitialDashIndex < fCount);
129 SkASSERT(index <= fCount);
130 if (index == fCount)
153 buffer.write32(fCount);
158 buffer.writeMul4(fIntervals, fCount * sizeof(fIntervals[0]));
168 fCount = buffer.readS32();
174 fIntervals = (SkScalar*)sk_malloc_throw(sizeof(SkScalar) * fCount);
175 buffer.read(fIntervals, fCount * sizeof(fIntervals[0]));
|
| /external/skia/src/images/ |
| SkImageRefPool.cpp | 8 fCount = 0;
92 fCount += 1;
93 SkASSERT(computeCount() == fCount);
111 fCount += 1;
112 SkASSERT(computeCount() == fCount);
118 SkASSERT(fCount > 0);
135 fCount -= 1;
136 SkASSERT(computeCount() == fCount);
172 (int)fRAMBudget, (int)fRAMUsed, fCount);
|
| SkImageDecoder_libpvjpeg.cpp | 45 MyObserver() : fCount(0) {}
47 if (fCount != 0) {
48 SkDebugf("--- pvjpeg left %d allocations\n", fCount);
53 ++fCount;
56 SkDebugf("--- pvjpeg alloc [%d] %d addr=%p\n", fCount, buffersize, buffer);
60 SkDebugf("--- pvjpeg free [%d] addr=%p\n", fCount, buffer);
61 --fCount;
66 int fCount;
|
| SkImageRefPool.h | 30 int fCount;
|
| /external/skia/src/ports/ |
| SkFontHost_tables.cpp | 75 SfntHeader() : fCount(0), fDir(NULL) {}
78 /** If it returns true, then fCount and fDir are properly initialized.
86 fCount = count_tables(stream, &offsetToDir);
87 if (0 == fCount) {
96 size_t size = fCount * sizeof(SkSFNTDirEntry);
101 int fCount;
129 for (int i = 0; i < header.fCount; i++) {
132 return header.fCount;
147 for (int i = 0; i < header.fCount; i++) {
168 for (int i = 0; i < header.fCount; i++)
[all...] |
| /external/icu4c/layoutex/layout/ |
| RunArrays.h | 218 le_int32 fCount;
223 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0)
229 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0)
235 : UObject(), fClientArrays(TRUE), fLimits(limits), fCount(count), fCapacity(count)
242 return fCount;
247 fCount = 0;
252 if (run < 0 || run >= fCount) {
261 return getLimit(fCount - 1);
|
| /external/skia/include/effects/ |
| SkDashPathEffect.h | 52 int32_t fCount;
|
