Lines Matching defs:fBlocks
41 fBlocks.push_back() = initialBlock;
54 fBlocks.push_back() = sk_malloc_throw(fBlockSize);
57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
73 if (fBlocks.count() > 1) {
74 sk_free(fBlocks.back());
75 fBlocks.pop_back();
86 for (int i = firstBlockToFree; i < fBlocks.count(); ++i) {
87 sk_free(fBlocks[i]);
90 fBlocks.reset();
94 fBlocks.pop_back_n(fBlocks.count() - 1);
118 return (char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
127 return (const char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
164 return (char*) fAllocator->fBlocks[fBlockIndex] + fIndexInBlock * fAllocator->fItemSize;
179 return (char*)fBlocks[i / fItemsPerBlock] +
188 return (const char*)fBlocks[i / fItemsPerBlock] +
203 SkASSERT(0 == fBlocks.count());
206 fBlocks.push_back() = initialBlock;
216 SkSTArray<NUM_INIT_BLOCK_PTRS, void*, true> fBlocks;
