Searched refs:fCount (Results 1 - 25 of 219) sorted by relevance

123456789

/external/skia/src/utils/
H A DSkCountdown.cpp12 : fCount(count) {}
15 fCount = count;
19 if (sk_atomic_dec(&fCount) == 1) {
28 while (fCount > 0) {
/external/chromium_org/third_party/skia/include/core/
H A DSkTDStack.h17 SkTDStack() : fCount(0), fTotalCount(0) {
21 // fCount = kSlotCount;
38 SkASSERT(fCount <= kSlotCount);
39 if (fCount == kSlotCount) {
43 fCount = 0;
46 return &fRec->fSlots[fCount++];
52 SkASSERT(fRec && fCount > idx);
53 return fRec->fSlots[fCount - idx - 1];
57 SkASSERT(fRec && fCount > idx);
58 return fRec->fSlots[fCount
107 int fCount, fTotalCount; member in class:SkTDStack
[all...]
H A DSkTDArray.h18 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;
360 int fCount; member in class:SkTDArray
[all...]
H A DSkTArray.h25 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
29 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
38 for (int i = 0; i < self->fCount; ++i) {
44 for (int i = 0; i < self->fCount; ++i) {
65 fCount = 0;
84 this->init(array.fItemArray, array.fCount, NULL, 0);
100 for (int i = 0; i < fCount; ++i) {
103 fCount = 0;
105 fCount = array.count();
111 for (int i = 0; i < fCount;
456 int fCount; member in class:SkTArray
[all...]
/external/skia/include/core/
H A DSkTDStack.h17 SkTDStack() : fCount(0), fTotalCount(0) {
21 // fCount = kSlotCount;
38 SkASSERT(fCount <= kSlotCount);
39 if (fCount == kSlotCount) {
43 fCount = 0;
46 return &fRec->fSlots[fCount++];
52 SkASSERT(fRec && fCount > idx);
53 return fRec->fSlots[fCount - idx - 1];
57 SkASSERT(fRec && fCount > idx);
58 return fRec->fSlots[fCount
107 int fCount, fTotalCount; member in class:SkTDStack
[all...]
H A DSkTDArray.h18 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;
360 int fCount; member in class:SkTDArray
[all...]
H A DSkTArray.h25 memcpy(self->fMemArray, array, self->fCount * sizeof(T));
29 memcpy(newMemArray, self->fMemArray, self->fCount * sizeof(T));
38 for (int i = 0; i < self->fCount; ++i) {
44 for (int i = 0; i < self->fCount; ++i) {
65 fCount = 0;
84 this->init(array.fItemArray, array.fCount, NULL, 0);
100 for (int i = 0; i < fCount; ++i) {
103 fCount = 0;
105 fCount = array.count();
111 for (int i = 0; i < fCount;
456 int fCount; member in class:SkTArray
[all...]
/external/chromium_org/third_party/skia/src/animator/
H A DSkTypedArray.cpp31 fReserve = fCount = 0;
40 fReserve = fCount = 0;
45 SkDS32Array tmp(src.fArray, src.fCount);
53 fReserve = fCount = 0;
65 fReserve = fCount = SkToU16(count);
73 if (src.fCount > fReserve)
75 SkDS32Array tmp(src.fArray, src.fCount);
80 memcpy(fArray, src.fArray, sizeof(int32_t) * src.fCount);
81 fCount = src.fCount;
[all...]
H A DSkTDArray_Experimental.h53 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
95 uint16_t fReserve, fCount; member in class:SkDS32Array
[all...]
/external/skia/src/animator/
H A DSkTypedArray.cpp31 fReserve = fCount = 0;
40 fReserve = fCount = 0;
45 SkDS32Array tmp(src.fArray, src.fCount);
53 fReserve = fCount = 0;
65 fReserve = fCount = SkToU16(count);
73 if (src.fCount > fReserve)
75 SkDS32Array tmp(src.fArray, src.fCount);
80 memcpy(fArray, src.fArray, sizeof(int32_t) * src.fCount);
81 fCount = src.fCount;
[all...]
H A DSkTDArray_Experimental.h53 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
95 uint16_t fReserve, fCount; member in class:SkDS32Array
[all...]
/external/chromium_org/third_party/icu/source/i18n/
H A Dnfrlist.h36 uint32_t fCount; member in class:NFRuleList
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 >
[all...]
/external/icu/icu4c/source/i18n/
H A Dnfrlist.h36 uint32_t fCount; member in class:NFRuleList
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 >
[all...]
/external/chromium_org/third_party/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h34 : fCount(0)
119 SkASSERT(fCount <= kSlotCount);
120 if (fCount == kSlotCount) {
124 fCount = 0;
128 return &fRec->fSlots[fCount++];
140 SkASSERT(fRec && fCount > 0);
141 return fRec->fSlots[fCount - 1];
148 SkASSERT(fRec && fCount > 0);
149 return fRec->fSlots[fCount - 1];
157 *elem = fRec->fSlots[fCount
200 int fCount; member in class:SkTDStackNester
[all...]
/external/skia/experimental/PdfViewer/src/
H A DSkTDStackNester.h34 : fCount(0)
119 SkASSERT(fCount <= kSlotCount);
120 if (fCount == kSlotCount) {
124 fCount = 0;
128 return &fRec->fSlots[fCount++];
140 SkASSERT(fRec && fCount > 0);
141 return fRec->fSlots[fCount - 1];
148 SkASSERT(fRec && fCount > 0);
149 return fRec->fSlots[fCount - 1];
157 *elem = fRec->fSlots[fCount
200 int fCount; member in class:SkTDStackNester
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkColorTable.cpp22 fCount = SkToU16(count);
42 fCount = SkToU16(count);
77 f16BitCache = (uint16_t*)sk_malloc_throw(fCount * sizeof(uint16_t));
78 build_16bitcache(f16BitCache, fColors, fCount);
93 fCount = buffer.getArrayCount();
94 size_t allocSize = fCount * sizeof(SkPMColor);
98 SkDEBUGCODE(success =) buffer.readColorArray(fColors, fCount);
100 fCount = 0;
104 SkASSERT((unsigned)fCount <= 256);
111 buffer.writeColorArray(fColors, fCount);
[all...]
H A DSkTInternalSList.h56 SkTInternalSList() : fHead(NULL), fCount(0) {}
66 ++fCount;
96 --fCount;
117 SkTSwap(fCount, other->fCount);
124 return fCount;
128 int fCount; member in class:SkTInternalSList
H A DSkVertState.h31 fCount = indexCount;
33 fCount = vCount;
46 int fCount; member in struct:VertState
H A DSkPictureFlat.cpp21 SkTypefacePlayback::SkTypefacePlayback() : fCount(0), fArray(NULL) {}
28 for (int i = 0; i < fCount; i++) {
35 fCount = rec->count();
36 fArray = SkNEW_ARRAY(SkRefCnt*, fCount);
38 for (int i = 0; i < fCount; i++) {
42 fCount = 0;
50 fCount = count;
56 SkASSERT((unsigned)index < (unsigned)fCount);
H A DSkTRefArray.h31 obj->fCount = count;
64 int count() const { return fCount; }
66 const T* end() const { return this->begin() + fCount; }
68 SkASSERT((unsigned)index < (unsigned)fCount);
81 return this->writableBegin() + fCount;
84 SkASSERT((unsigned)index < (unsigned)fCount);
91 int n = fCount;
104 int fCount; member in class:SkTRefArray
/external/skia/src/core/
H A DSkTInternalSList.h56 SkTInternalSList() : fHead(NULL), fCount(0) {}
66 ++fCount;
96 --fCount;
117 SkTSwap(fCount, other->fCount);
124 return fCount;
128 int fCount; member in class:SkTInternalSList
H A DSkVertState.h31 fCount = indexCount;
33 fCount = vCount;
46 int fCount; member in struct:VertState
H A DSkPictureFlat.cpp21 SkTypefacePlayback::SkTypefacePlayback() : fCount(0), fArray(NULL) {}
28 for (int i = 0; i < fCount; i++) {
35 fCount = rec->count();
36 fArray = SkNEW_ARRAY(SkRefCnt*, fCount);
38 for (int i = 0; i < fCount; i++) {
42 fCount = 0;
50 fCount = count;
56 SkASSERT((unsigned)index < (unsigned)fCount);
/external/chromium_org/third_party/skia/include/gpu/
H A DGrBackendProcessorFactory.h27 GrProcessorKeyBuilder(SkTArray<unsigned char, true>* data) : fData(data), fCount(0) {
32 ++fCount;
40 fCount += count;
44 size_t size() const { return sizeof(uint32_t) * fCount; }
48 int fCount; // number of uint32_ts added to fData by the effect. member in class:GrProcessorKeyBuilder
58 GrProcessorKey(const uint32_t* key, int count) : fKey(key), fCount(count) {
64 SkASSERT(index >=0 && index < fCount);
69 int count32() const { return fCount; }
73 int fCount; // number of uint32_ts inserted by the effect into its key. member in class:GrProcessorKey
/external/skia/src/gpu/
H A DGrAllocator.h35 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
150 int fCount; member in class:GrAllocator
[all...]

Completed in 405 milliseconds

123456789