> part is requiring the array to be contiguous in the > first place, but you can't qsort a linked list.
i've sidestepped this problem a few times by building a linked list and later building an array to sort. then, if necessary, relinking the list. the big allocation is then done only once. even after changing to a power-of-two allocation and starting with 8k items, aux/acidleak still takes 400mb on a 40mb proc with only 155278 bytes actually allocated (in the target process). is the a chance that pool is not packing the small allocations together well? > if upas/fs is allocating arbitrarily large buffers, > then its allocation behavior is broken too. there are a fixed number of large buffers. up to 15 messages and mdir uses dirreadall so it can qsort. the qsort is easy enough to eliminate, but it's more difficult to bound message buffers. - erik
