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

  /external/chromium_org/third_party/skia/src/gpu/
GrAllocPool.h 51 GrTAllocPool(int count) : fPool(count * sizeof(T)) {}
53 void reset() { fPool.reset(); }
54 T* alloc() { return (T*)fPool.alloc(sizeof(T)); }
57 GrAllocPool fPool;
GrTextStrike.h 67 GrTAllocPool<GrGlyph> fPool;
GrTextStrike.cpp 232 GrAtlas* atlas) : fPool(64) {
274 GrGlyph* glyph = fPool.alloc();
  /external/skia/src/gpu/
GrAllocPool.h 51 GrTAllocPool(int count) : fPool(count * sizeof(T)) {}
53 void reset() { fPool.reset(); }
54 T* alloc() { return (T*)fPool.alloc(sizeof(T)); }
57 GrAllocPool fPool;
GrTextStrike.h 59 GrTAllocPool<GrGlyph> fPool;
GrTextStrike.cpp 225 GrAtlasMgr* atlasMgr) : fPool(64) {
267 GrGlyph* glyph = fPool.alloc();
  /external/chromium_org/third_party/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/skia/src/lazy/
SkDiscardableMemoryPool.cpp 88 DiscardableMemoryPool* const fPool;
97 : fPool(pool)
101 SkASSERT(fPool != NULL);
104 fPool->ref();
109 fPool->free(this);
110 fPool->unref();
115 return fPool->lock(this);
125 fPool->unlock(this);
  /external/chromium_org/third_party/icu/source/common/
uresimp.h 51 * to use one UResourceDataEntry pointer for fAlias and fPool, with a separate
60 UResourceDataEntry *fPool;
uresbund.cpp 155 if(entry->fPool != NULL) {
156 --entry->fPool->fCountExisting;
243 (void*)resB->fPool,
374 r->fPool = getPoolEntry(r->fPath, status);
376 const int32_t *poolIndexes = r->fPool->fData.pRoot + 1;
    [all...]
  /external/icu/icu4c/source/common/
uresimp.h 51 * to use one UResourceDataEntry pointer for fAlias and fPool, with a separate
60 UResourceDataEntry *fPool;
uresbund.cpp 155 if(entry->fPool != NULL) {
156 --entry->fPool->fCountExisting;
243 (void*)resB->fPool,
374 r->fPool = getPoolEntry(r->fPath, status);
376 const int32_t *poolIndexes = r->fPool->fData.pRoot + 1;
    [all...]

Completed in 586 milliseconds