| /external/skqp/src/core/ |
| D | SkTDynamicHash.h | 25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(nullptr) { in SkTDynamicHash()
40 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
41 return fCurrentIndex == fHash->fCapacity; in done()
67 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
68 return fCurrentIndex == fHash->fCapacity; in done()
92 for (int round = 0; round < fCapacity; round++) { in find()
93 SkASSERT(index >= 0 && index < fCapacity); in find()
103 SkASSERT(fCapacity == 0); in find()
124 sk_bzero(fArray, sizeof(T*)* fCapacity); in rewind()
133 fCapacity = 0; in reset()
[all …]
|
| D | SkWriter32.cpp | 76 fCapacity = 4096 + SkTMax(size, fCapacity + (fCapacity / 2)); in growToAtLeast()
77 fInternal.realloc(fCapacity); in growToAtLeast()
|
| D | SkRWBuffer.cpp | 23 const size_t fCapacity; member
25 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {} in SkBufferBlock()
29 size_t avail() const { return fCapacity - fUsed; } in avail()
54 SkASSERT(fCapacity > 0); in validate()
55 SkASSERT(fUsed <= fCapacity); in validate()
174 return SkTMin(fBlock->fCapacity, fRemaining); in size()
|
| D | SkWriter32.h | 50 fCapacity = externalBytes;
60 if (totalRequired > fCapacity) { in reserve()
249 size_t fCapacity; // Number of bytes we can write to fData. variable
|
| /external/skia/src/core/ |
| D | SkTDynamicHash.h | 25 SkTDynamicHash() : fCount(0), fDeleted(0), fCapacity(0), fArray(nullptr) { in SkTDynamicHash()
40 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
41 return fCurrentIndex == fHash->fCapacity; in done()
67 SkASSERT(fCurrentIndex <= fHash->fCapacity); in done()
68 return fCurrentIndex == fHash->fCapacity; in done()
92 for (int round = 0; round < fCapacity; round++) { in find()
93 SkASSERT(index >= 0 && index < fCapacity); in find()
103 SkASSERT(fCapacity == 0); in find()
124 sk_bzero(fArray, sizeof(T*)* fCapacity); in rewind()
133 fCapacity = 0; in reset()
[all …]
|
| D | SkWriter32.cpp | 76 fCapacity = 4096 + SkTMax(size, fCapacity + (fCapacity / 2)); in growToAtLeast()
77 fInternal.realloc(fCapacity); in growToAtLeast()
|
| D | SkRWBuffer.cpp | 23 const size_t fCapacity; member
25 SkBufferBlock(size_t capacity) : fNext(nullptr), fUsed(0), fCapacity(capacity) {} in SkBufferBlock()
29 size_t avail() const { return fCapacity - fUsed; } in avail()
54 SkASSERT(fCapacity > 0); in validate()
55 SkASSERT(fUsed <= fCapacity); in validate()
174 return SkTMin(fBlock->fCapacity, fRemaining); in size()
|
| D | SkWriter32.h | 50 fCapacity = externalBytes;
60 if (totalRequired > fCapacity) { in reserve()
249 size_t fCapacity; // Number of bytes we can write to fData. variable
|
| /external/skia/include/private/ |
| D | SkTHash.h | 27 SkTHashTable() : fCount(0), fCapacity(0) {} in SkTHashTable()
39 size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); } in approxBytesUsed()
54 if (4 * fCount >= 3 * fCapacity) { in set()
55 this->resize(fCapacity > 0 ? fCapacity * 2 : 4); in set()
63 int index = hash & (fCapacity-1); in find()
64 for (int n = 0; n < fCapacity; n++) { in find()
74 SkASSERT(fCapacity == 0); in find()
83 int index = hash & (fCapacity-1); in remove()
84 for (int n = 0; n < fCapacity; n++) { in remove()
113 originalIndex = s.hash & (fCapacity - 1); in remove()
[all …]
|
| /external/skqp/include/private/ |
| D | SkTHash.h | 27 SkTHashTable() : fCount(0), fCapacity(0) {} in SkTHashTable()
39 size_t approxBytesUsed() const { return fCapacity * sizeof(Slot); } in approxBytesUsed()
54 if (4 * fCount >= 3 * fCapacity) { in set()
55 this->resize(fCapacity > 0 ? fCapacity * 2 : 4); in set()
63 int index = hash & (fCapacity-1); in find()
64 for (int n = 0; n < fCapacity; n++) { in find()
74 SkASSERT(fCapacity == 0); in find()
83 int index = hash & (fCapacity-1); in remove()
84 for (int n = 0; n < fCapacity; n++) { in remove()
113 originalIndex = s.hash & (fCapacity - 1); in remove()
[all …]
|
| /external/icu/icu4c/source/tools/genrb/ |
| D | ustr.c | 37 s->fLength = s->fCapacity = 0; in ustr_init()
46 s->fLength = s->fCapacity = 0; in ustr_initChars()
50 if(s->fCapacity < length) { in ustr_initChars()
77 s->fLength = s->fCapacity = 0; in ustr_deinit()
89 if(dst->fCapacity < src->fLength) { in ustr_cpy()
110 if(s->fCapacity < (len + 1)) { in ustr_setlen()
137 if(dst->fCapacity < (dst->fLength + n)) { in ustr_ncat()
157 if(dst->fCapacity < (dst->fLength + 1)) { in ustr_ucat()
189 if(dst->fCapacity < (dst->fLength + len)) { in ustr_uscat()
214 s->fLength = s->fCapacity = 0; in ustr_resize()
[all …]
|
| D | ustr.h | 57 int32_t fCapacity; member
|
| /external/icu/icu4c/source/layoutex/ |
| D | RunArrays.cpp | 22 : fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(initialCapacity) in RunArray()
25 fLimits = LE_NEW_ARRAY(le_int32, fCapacity); in RunArray()
39 if (fCount >= fCapacity) { in ensureCapacity()
40 if (fCapacity == 0) { in ensureCapacity()
41 fCapacity = INITIAL_CAPACITY; in ensureCapacity()
42 init(fCapacity); in ensureCapacity()
44 fCapacity += (fCapacity < CAPACITY_GROW_LIMIT ? fCapacity : CAPACITY_GROW_LIMIT); in ensureCapacity()
45 grow(fCapacity); in ensureCapacity()
|
| /external/icu/icu4c/source/i18n/ |
| D | nfrlist.h | 39 uint32_t fCapacity; variable
44 , fCapacity(capacity) {}
66 if (fCount == fCapacity) { in add()
67 fCapacity += 10; in add()
68 fStuff = (NFRule**)uprv_realloc(fStuff, fCapacity * sizeof(NFRule*)); // assume success in add()
73 fCapacity = 0; in add()
84 fCapacity = 0; in release()
|
| D | sortkey.cpp | 109 fUnion.fFields.fCapacity = newCapacity; in reallocate()
|
| /external/icu/icu4c/source/layoutex/layout/ |
| D | RunArrays.h | 221 le_int32 fCapacity; variable
225 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0) in RunArray()
231 : UObject(), fClientArrays(FALSE), fLimits(NULL), fCount(0), fCapacity(0) in RunArray()
237 : UObject(), fClientArrays(TRUE), fLimits(limits), fCount(count), fCapacity(count) in RunArray()
|
| /external/icu/icu4c/source/common/ |
| D | unistr.cpp | 390 fUnion.fFields.fCapacity = (int32_t)(numBytes / U_SIZEOF_UCHAR); in allocate()
397 fUnion.fFields.fCapacity = 0; in allocate()
533 fUnion.fFields.fCapacity = src.fUnion.fFields.fCapacity; in copyFrom()
543 fUnion.fFields.fCapacity = src.fUnion.fFields.fCapacity; in copyFrom()
568 fUnion.fFields.fCapacity = 0; in copyFrom()
597 fUnion.fFields.fCapacity = src.fUnion.fFields.fCapacity; in copyFieldsFrom()
605 src.fUnion.fFields.fCapacity = 0; in copyFieldsFrom()
1207 fUnion.fFields.fCapacity = 0; in setToBogus()
1431 fUnion.fFields.fCapacity -= length; in doReplace()
1439 fUnion.fFields.fCapacity = start; // not NUL-terminated any more in doReplace()
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | sortkey.h | 265 return (fFlagAndLength >= 0) ? (int32_t)sizeof(fUnion) : fUnion.fFields.fCapacity; in getCapacity()
312 int32_t fCapacity; member
|
| /external/icu/icu4c/source/common/unicode/ |
| D | unistr.h | 3837 int32_t fCapacity; // capacity of fArray (in char16_ts) member
3949 US_STACKBUF_SIZE : fUnion.fFields.fCapacity; in getCapacity()
4616 fUnion.fFields.fCapacity = capacity; in setArray()
|