65     heap_offset next_node;  // offset into heap  member
80     freelist->next_node = offset_from_node ( list_end );  in init_heap()
101             p && p != list_end;     prev = p, p = node_from_offset ( p->next_node)) {  in fallback_malloc()
108             q->next_node = 0;  in fallback_malloc()
115                 freelist = node_from_offset(p->next_node);  in fallback_malloc()
117                 prev->next_node = p->next_node;  in fallback_malloc()
118             p->next_node = 0;  in fallback_malloc()
139             p && p != list_end;     prev = p, p = node_from_offset (p->next_node)) {  in fallback_free()
161                 cp->next_node = p->next_node;  in fallback_free()
164                 prev->next_node = offset_from_node(cp);  in fallback_free()
172     cp->next_node = offset_from_node ( freelist );  in fallback_free()
184             p && p != list_end;     prev = p, p = node_from_offset (p->next_node)) {  in print_free_list()
186                 << "\tsize: " << p->len << " Next: " << p->next_node << std::endl;  in print_free_list()