HomeSort by relevance Sort by last modified time
    Searched refs:fPool (Results 1 - 8 of 8) sorted by null

  /external/skia/src/gpu/
GrTextBlobCache.cpp 26 BitmapTextBlob* cacheBlob = SkNEW_PLACEMENT(fPool.allocate(size), BitmapTextBlob);
38 cacheBlob->fPool = &fPool;
GrTextBlobCache.h 26 : fPool(kPreAllocSize, kMinGrowthSize)
80 if (fPool.size() > kBudget) {
85 while (fPool.size() > kBudget && (lruBlob = iter.get()) && lruBlob != blob) {
102 if (fPool.size() > kBudget) {
138 GrMemoryPool fPool;
GrBatchFontCache.cpp 159 , fPool(9/*start allocations at 512 bytes*/)
188 GrGlyph* glyph = (GrGlyph*)fPool.alloc(sizeof(GrGlyph), SK_MALLOC_THROW);
GrBatchFontCache.h 65 SkVarAlloc fPool;
GrAtlasTextContext.h 198 GrMemoryPool* fPool;
237 blob->fPool->release(p);
  /external/skia/src/lazy/
SkDiscardableMemoryPool.cpp 89 DiscardableMemoryPool* const fPool;
98 : fPool(pool)
102 SkASSERT(fPool != NULL);
105 fPool->ref();
110 fPool->free(this);
111 fPool->unref();
116 return fPool->lock(this);
126 fPool->unlock(this);
  /external/icu/icu4c/source/common/
uresimp.h 40 * to use one UResourceDataEntry pointer for fAlias and fPool, with a separate
49 UResourceDataEntry *fPool;
uresbund.cpp 156 if(entry->fPool != NULL) {
157 --entry->fPool->fCountExisting;
244 (void*)resB->fPool,
375 r->fPool = getPoolEntry(r->fPath, status);
377 const int32_t *poolIndexes = r->fPool->fData.pRoot + 1;
    [all...]

Completed in 366 milliseconds