Searched refs:m_pool (Results 1 - 6 of 6) sorted by relevance

/external/deqp/framework/delibs/decpp/
H A DdeMemPool.hpp44 deMemPool* getRawPool (void) { return m_pool; }
46 int getNumChildren (void) const { return deMemPool_getNumChildren(m_pool); }
48 deUintptr getNumAllocatedBytes (bool recurse) const { return deMemPool_getNumAllocatedBytes(m_pool, recurse ? DE_TRUE : DE_FALSE); }
49 deUintptr getCapacity (bool recurse) const { return deMemPool_getCapacity(m_pool, recurse ? DE_TRUE : DE_FALSE); }
58 deMemPool* m_pool; member in class:de::MemPool
69 m_pool = deMemPool_createRoot(util, flags);
70 if (!m_pool)
76 m_pool = deMemPool_create(parent->m_pool);
77 if (!m_pool)
[all...]
H A DdePoolArray.hpp96 MemPool* m_pool; member in class:de::PoolArray
218 : m_pool (pool)
296 void** newPageTable = (void**)m_pool->alloc(newPageTableCapacity * sizeof(void*));
340 m_pageTable[pageTableNdx] = m_pool->alignedAlloc(pageAllocSize, Alignment);
/external/chromium_org/third_party/WebKit/Source/platform/text/
H A DTextBreakIteratorICU.cpp55 for (size_t i = 0; i < m_pool.size(); ++i) {
56 if (m_pool[i].first == locale) {
57 iterator = m_pool[i].second;
58 m_pool.remove(i);
89 if (m_pool.size() == capacity) {
90 delete(m_pool[0].second);
91 m_pool.remove(0);
94 m_pool.append(Entry(m_vendedIterators.take(iterator), iterator));
104 Pool m_pool; member in class:blink::LineBreakIteratorPool
/external/chromium_org/third_party/WebKit/Source/platform/heap/
H A DHeap.cpp988 m_pool[i] = 0;
995 while (PoolEntry* entry = m_pool[index]) {
996 m_pool[index] = entry->next;
1012 PoolEntry* entry = new PoolEntry(memory, m_pool[index]);
1013 m_pool[index] = entry;
1019 while (PoolEntry* entry = m_pool[index]) {
1020 m_pool[index] = entry->next;
1036 while (PoolEntry* entry = m_pool[index]) {
1037 m_pool[index] = entry->next;
1051 PoolEntry* entry = new PoolEntry(page, m_pool[inde
[all...]
H A DHeap.h756 PoolEntry* m_pool[NumberOfHeaps]; member in class:blink::PagePool
/external/chromium_org/third_party/WebKit/Source/wtf/
H A DListHashSet.h285 memset(m_pool.buffer, 0, sizeof(m_pool.buffer));
336 Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.buffer); }
349 AlignedBuffer<sizeof(NodeBase) * m_poolSize, WTF_ALIGN_OF(NodeBase)> m_pool; member in struct:WTF::ListHashSetAllocator

Completed in 281 milliseconds