29         fCount = 0;  in SkTArray()
48         this->init(array.fItemArray, array.fCount, NULL, 0);  in SkTArray()
64         for (int i = 0; i < fCount; ++i) {
67         fCount = 0;
69         fCount = array.count();
75         for (int i = 0; i < fCount; ++i) {  in ~SkTArray()
86     void reset() { this->pop_back_n(fCount); }  in reset()
93         for (int i = 0; i < fCount; ++i) {  in reset()
97         fCount = 0;  in reset()
99         fCount = n;  in reset()
100         for (int i = 0; i < fCount; ++i) {  in reset()
109         for (int i = 0; i < fCount; ++i) {  in reset()
112         int delta = count - fCount;  in reset()
114         fCount = count;  in reset()
119         SkASSERT(n < fCount);  in removeShuffle()
120         int newCount = fCount - 1;  in removeShuffle()
121         fCount = newCount;  in removeShuffle()
131     int count() const { return fCount; }  in count()
136     bool empty() const { return !fCount; }  in empty()
201             new (fItemArray + fCount + i) T(t[i]);  in push_back_n()
203         fCount += n;  in push_back_n()
204         return fItemArray + fCount - n;  in push_back_n()
211         SkASSERT(fCount > 0);  in pop_back()
212         --fCount;  in pop_back()
213         fItemArray[fCount].~T();  in pop_back()
222         SkASSERT(fCount >= n);  in pop_back_n()
223         fCount -= n;  in pop_back_n()
225             fItemArray[fCount + i].~T();  in pop_back_n()
237         if (newCount > fCount) {  in resize_back()
238             this->push_back_n(newCount - fCount);  in resize_back()
239         } else if (newCount < fCount) {  in resize_back()
240             this->pop_back_n(fCount - newCount);  in resize_back()
254             SkTSwap(fCount, that->fCount);  in swap()
271         return fItemArray ? fItemArray + fCount : NULL;  in end()
274         return fItemArray ? fItemArray + fCount : NULL;  in end()
281         SkASSERT(i < fCount);
287         SkASSERT(i < fCount);
295     T& front() { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
297     const T& front() const { SkASSERT(fCount > 0); return fItemArray[0];}  in front()
302     T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];}  in back()
304     const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];}  in back()
311         SkASSERT(i < fCount);  in fromBack()
312         return fItemArray[fCount - i - 1];  in fromBack()
317         SkASSERT(i < fCount);  in fromBack()
318         return fItemArray[fCount - i - 1];  in fromBack()
355         this->init(array.fItemArray, array.fCount, storage->get(), N);  in SkTArray()
372         fCount              = count;  in init()
377         if (fReserveCount >= fCount &&  in init()
382             fAllocCount = SkMax32(fCount, fReserveCount);  in init()
394         sk_careful_memcpy(fMemArray, src, fCount * sizeof(T));  in SK_WHEN()
400         sk_careful_memcpy(dst, fMemArray, fCount * sizeof(T));  in SK_WHEN()
404         for (int i = 0; i < fCount; ++i) {  in copy()
413         for (int i = 0; i < fCount; ++i) {  in move()
425         void* ptr = fItemArray + fCount;  in push_back_raw()
426         fCount += n;  in push_back_raw()
431         SkASSERT(fCount >= 0);  in checkRealloc()
434         SkASSERT(-delta <= fCount);  in checkRealloc()
436         int newCount = fCount + delta;  in checkRealloc()
465     int     fCount;  variable