138   struct heap_node* cp = ((struct heap_node*)ptr) - 1; // retrieve the chunk  in fallback_free()  local
144   std::printf("Freeing item at %d of size %d\n", offset_from_node(cp), cp->len);  in fallback_free()
151       offset_from_node(p), offset_from_node(cp),  in fallback_free()
152       offset_from_node(after(p)), offset_from_node(after(cp)));  in fallback_free()
154     if (after(p) == cp) {  in fallback_free()
159           p->len + cp->len); // make the free heap_node larger  in fallback_free()
161     } else if (after(cp) == p) { // there's a free heap_node right after  in fallback_free()
165       cp->len = static_cast<heap_size>(cp->len + p->len);  in fallback_free()
167         freelist = cp;  in fallback_free()
168         cp->next_node = p->next_node;  in fallback_free()
170         prev->next_node = offset_from_node(cp);  in fallback_free()
176   std::printf("  Making new free list entry %d\n", offset_from_node(cp));  in fallback_free()
178   cp->next_node = offset_from_node(freelist);  in fallback_free()
179   freelist = cp;  in fallback_free()