Searched refs:prev_free (Results 1 – 6 of 6) sorted by relevance
78 heap->prev_free = block; in mmInit()84 block->prev_free = heap; in mmInit()116 newblock->prev_free = p; in SliceBlock()117 p->next_free->prev_free = newblock; in SliceBlock()141 newblock->prev_free = p; in SliceBlock()142 p->next_free->prev_free = newblock; in SliceBlock()153 p->next_free->prev_free = p->prev_free; in SliceBlock()154 p->prev_free->next_free = p->next_free; in SliceBlock()157 p->prev_free = 0; in SliceBlock()210 q->next_free->prev_free = q->prev_free; in Join2Blocks()[all …]
36 struct mem_block *next_free, *prev_free; member
90 heap->prev_free = block; in u_mmInit()96 block->prev_free = heap; in u_mmInit()129 newblock->prev_free = p; in SliceBlock()130 p->next_free->prev_free = newblock; in SliceBlock()153 newblock->prev_free = p; in SliceBlock()154 p->next_free->prev_free = newblock; in SliceBlock()165 p->next_free->prev_free = p->prev_free; in SliceBlock()166 p->prev_free->next_free = p->next_free; in SliceBlock()169 p->prev_free = 0; in SliceBlock()246 q->next_free->prev_free = q->prev_free; in Join2Blocks()[all …]
39 struct mem_block *next_free, *prev_free; member
308 auto prev_free_it = sequence_state.prev_free.find({upid, callstack_id}); in AddAllocation()309 if (prev_free_it == sequence_state.prev_free.end()) { in AddAllocation()310 std::tie(prev_free_it, std::ignore) = sequence_state.prev_free.emplace( in AddAllocation()315 tables::HeapProfileAllocationTable::Row& prev_free = prev_free_it->second; in AddAllocation() local326 sequence_state.free_correction[alloc.callstack_id] = prev_free; in AddAllocation()351 free_delta.count -= prev_free.count; in AddAllocation()352 free_delta.size -= prev_free.size; in AddAllocation()373 prev_free = free_row; in AddAllocation()
98 prev_free; member