Lines Matching defs:free
16 * free contiguous range of blocks under the node. It may contain a
95 #define free(a,b) free(a)
123 #define free _FREE
209 free(bl->bl_root, M_SWAP);
210 free(bl, M_SWAP);
237 * blist_free() - free up space in the block bitmap. Return the base
275 * If resizing upwards, should we free the new space or not?
325 * case assumes at least 1 bit is free in the bitmap, so
456 * complete free.
472 * BLST_LEAF_FREE() - free allocated block from leaf bitmap
480 * free some data in this bitmap
494 panic("blst_radix_free: freeing free block");
507 * BLST_META_FREE() - free allocated blocks from radix tree meta info
511 * meta node, we break the range down recursively to free blocks
512 * in subnodes (which means that this code can free an arbitrary
563 panic("blst_meta_free: freeing already free blocks (%d) %d/%d", count, scan->u.bmu_avail, radix);
566 * Break the free down into its components
602 * Locates free space in the source tree and frees it in the destination
603 * tree. The space may not already be free in the destination.
650 * Source all free, free entire dest
915 "f %x %d -free\n"