101   heap_node *p, *prev;  in fallback_malloc()  local
109   for (p = freelist, prev = 0; p && p != list_end;  in fallback_malloc()
110        prev = p, p = node_from_offset(p->next_node)) {  in fallback_malloc()
123       if (prev == 0)  in fallback_malloc()
126         prev->next_node = p->next_node;  in fallback_malloc()
139   struct heap_node *p, *prev;  in fallback_free()  local
147   for (p = freelist, prev = 0; p && p != list_end;  in fallback_free()
148        prev = p, p = node_from_offset(p->next_node)) {  in fallback_free()
166       if (prev == 0) {  in fallback_free()
170         prev->next_node = offset_from_node(cp);  in fallback_free()
184   struct heap_node *p, *prev;  in print_free_list()  local
189   for (p = freelist, prev = 0; p && p != list_end;  in print_free_list()
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()