Lines Matching defs:bitmap
30 * This module implements a general bitmap allocator/deallocator. The
35 * A radix tree is used to maintain the bitmap. Two radix constants are
53 * fragmentation there is and no matter how large a bitmap is used.
208 * blist_alloc() - reserve space in the block bitmap. Return the base
230 * blist_free() - free up space in the block bitmap. Return the base
248 * blist_fill() - mark a region in the block bitmap as off-limits
274 * the tree and transfer the previous bitmap to the new
326 * blist_leaf_alloc() - allocate at a leaf in the radix tree (a bitmap).
344 * Optimize bitmap all-allocated case. Also, count = 1
345 * case assumes at least 1 bit is free in the bitmap, so
353 * Optimized code to allocate one bit out of the bitmap
374 * non-optimized code to allocate N bits out of the bitmap.
492 * BLST_LEAF_FREE() - free allocated block from leaf bitmap
503 * free some data in this bitmap
532 * This support routine frees a range of blocks from the bitmap.
725 * BLST_LEAF_FILL() - allocate specific blocks in leaf bitmap
737 u_daddr_t mask, bitmap;
743 bitmap = scan->u.bmu_bitmap & mask;
744 for (nblks = 0; bitmap != 0; nblks++)
745 bitmap &= bitmap - 1;
925 "%*.*s(%08llx,%lld): bitmap %08llx big=%lld\n",