GuardedHeapChunk
* sizeof(GuardedHeapChunk),
GuardedHeapChunk* chunk = (GuardedHeapChunk*)
guarded_heap_allocate_meta(heap, sizeof(GuardedHeapChunk), flags);
static GuardedHeapChunk*
GuardedHeapChunk* chunk = tree.FindClosest((addr_t)address, false, true);
GuardedHeapChunk* spareChunk = (GuardedHeapChunk*)
guarded_heap_allocate_meta(heap, sizeof(GuardedHeapChunk), flags);
GuardedHeapChunk* freeChunk = NULL;
GuardedHeapChunk* chunk = NULL;
struct GuardedHeapChunk : public SplayTreeLink<GuardedHeapChunk> {
GuardedHeapChunk* tree_list_link;
GuardedHeapChunk* chunk = guarded_heap_find_chunk(heap.live_chunks, (addr_t)address);
GuardedHeapChunk* deadChunk = guarded_heap_find_chunk(heap.dead_chunks, (addr_t)address);
GuardedHeapChunk* freeChunk = guarded_heap_find_chunk(heap.free_chunks, (addr_t)address);
GuardedHeapChunk* joinLower = guarded_heap_find_chunk(tree, chunk->base - 1),
GuardedHeapChunk* chunk = guarded_heap_find_chunk(heap.live_chunks, (addr_t)address);
dump_guarded_heap_stack_trace(GuardedHeapChunk& chunk)
typedef GuardedHeapChunk NodeType;
static addr_t GetKey(const GuardedHeapChunk* node)
GuardedHeapChunk* chunk = guarded_heap_find_chunk(sGuardedHeap.live_chunks, address);
static SplayTreeLink<GuardedHeapChunk>* GetLink(GuardedHeapChunk* node)
static int Compare(const addr_t& key, const GuardedHeapChunk* node)
GuardedHeapChunk* chunk = sGuardedHeap.live_chunks.FindMin();
size_t metaSize = ROUNDUP(((size / B_PAGE_SIZE) / 2) * sizeof(GuardedHeapChunk), B_PAGE_SIZE);
GuardedHeapChunk* chunk = (GuardedHeapChunk*)
guarded_heap_allocate_meta(sGuardedHeap, sizeof(GuardedHeapChunk), 0);
static GuardedHeapChunk** GetListLink(GuardedHeapChunk* node)
GuardedHeapChunk* chunk = sGuardedHeap.live_chunks.FindMin();
GuardedHeapChunk* linkChunk = NULL;