/* Find an object that is large enough.
Search list in reverse so that more recently freed objects will be
allocated again sooner. */
/* Find an object that is large enough.
Search list in reverse so that more recently freed objects will be
allocated again sooner. */
f = elt_at (h, f_index);
f_size = heap_elt_size (v, f);
if ((s = f_size - size) >= 0)
f = elt_at (h, f_index);
f_size = heap_elt_size (v, f);
if ((s = f_size - size) >= 0)
heap_dealloc (void *v, uword handle)
{
heap_header_t *h = heap_header (v);
heap_dealloc (void *v, uword handle)
{
heap_header_t *h = heap_header (v);