Home
last modified time | relevance | path

Searched refs:chunk_t (Results 1 – 4 of 4) sorted by relevance

/hardware/msm7k/libgralloc-qsd8k/
Dallocator.cpp49 chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign); in setSize()
72 chunk_t const * const freed = dealloc(offset); in deallocate()
85 chunk_t* free_chunk = 0; in alloc()
86 chunk_t* cur = mList.head(); in alloc()
111 chunk_t* split = new chunk_t(free_chunk->start, extra); in alloc()
121 chunk_t* split = new chunk_t( in alloc()
131 SimpleBestFitAllocator::chunk_t* SimpleBestFitAllocator::dealloc(size_t start) in dealloc()
134 chunk_t* cur = mList.head(); in dealloc()
142 chunk_t* freed = cur; in dealloc()
145 chunk_t* const p = cur->prev; in dealloc()
[all …]
Dallocator.h110 struct chunk_t { struct
111 chunk_t(size_t start, size_t size) in chunk_t() function
117 mutable chunk_t* prev; argument
118 mutable chunk_t* next; argument
122 chunk_t* dealloc(size_t start);
126 LinkedList<chunk_t> mList;
/hardware/msm7k/libgralloc/
Dallocator.cpp49 chunk_t* node = new chunk_t(0, mHeapSize / kMemoryAlign); in setSize()
72 chunk_t const * const freed = dealloc(offset); in deallocate()
85 chunk_t* free_chunk = 0; in alloc()
86 chunk_t* cur = mList.head(); in alloc()
111 chunk_t* split = new chunk_t(free_chunk->start, extra); in alloc()
121 chunk_t* split = new chunk_t( in alloc()
131 SimpleBestFitAllocator::chunk_t* SimpleBestFitAllocator::dealloc(size_t start) in dealloc()
134 chunk_t* cur = mList.head(); in dealloc()
142 chunk_t* freed = cur; in dealloc()
145 chunk_t* const p = cur->prev; in dealloc()
[all …]
Dallocator.h109 struct chunk_t { struct
110 chunk_t(size_t start, size_t size) in chunk_t() argument
116 mutable chunk_t* prev; argument
117 mutable chunk_t* next; argument
121 chunk_t* dealloc(size_t start);
125 LinkedList<chunk_t> mList;