Lines Matching refs:free
45 // We want to make it fast to alloc new chunks and to free existing chunks from
65 // Make it easy to track all ranges involved so we know which free()
151 // Returns the next free object,
162 // of the next free chunk.
163 D("store %zu in %p as next free chunk",
177 void free(void* toFree) {
187 D("freeing free %p: no other chunks available.", toFree);
193 D("set next free to %p", nextFree);
197 // To free everything, just reset back to the initial state :p
241 void free(void* ptr) {
242 mBlock.free(ptr);
268 // because Blocks use free space for bookkeeping
332 bool free(void* ptr) {
348 D("found heap to free %p.", ptr)
349 info.heap->free(ptr);
394 ::free(ptr);
421 // Fall back to normal free if it cannot be
423 void Pool::free(void* ptr) {
424 if (mImpl->free(ptr)) return;
426 D("fallback to free for %p", ptr);
428 ::free(ptr);
434 ::free(ptr);
