67   heap_offset next_node; // offset into heap  member
87   freelist->next_node = offset_from_node(list_end);  in init_heap()
110        prev = p, p = node_from_offset(p->next_node)) {  in fallback_malloc()
117       q->next_node = 0;  in fallback_malloc()
124         freelist = node_from_offset(p->next_node);  in fallback_malloc()
126         prev->next_node = p->next_node;  in fallback_malloc()
127       p->next_node = 0;  in fallback_malloc()
148        prev = p, p = node_from_offset(p->next_node)) {  in fallback_free()
168         cp->next_node = p->next_node;  in fallback_free()
170         prev->next_node = offset_from_node(cp);  in fallback_free()
178   cp->next_node = offset_from_node(freelist);  in fallback_free()
190        prev = p, p = node_from_offset(p->next_node)) {  in print_free_list()
192       (prev == 0 ? "" : "  "), offset_from_node(p), p->len, p->next_node);  in print_free_list()