Lines Matching defs:bitmap
30 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
32 * This module implements a general bitmap allocator/deallocator. The
37 * A radix tree is used to maintain the bitmap. Two radix constants are
55 * fragmentation there is and no matter how large a bitmap is used.
132 blist_bitmap_t bmu_bitmap; /* bitmap if we are a leaf */
236 * blist_alloc() - reserve space in the block bitmap. Return the base
258 * blist_free() - free up space in the block bitmap. Return the base
276 * blist_fill() - mark a region in the block bitmap as off-limits
302 * the tree and transfer the previous bitmap to the new
354 * blist_leaf_alloc() - allocate at a leaf in the radix tree (a bitmap).
372 * Optimize bitmap all-allocated case. Also, count = 1
373 * case assumes at least 1 bit is free in the bitmap, so
381 * Optimized code to allocate one bit out of the bitmap
402 * non-optimized code to allocate N bits out of the bitmap.
520 * BLST_LEAF_FREE() - free allocated block from leaf bitmap
531 * free some data in this bitmap
560 * This support routine frees a range of blocks from the bitmap.
756 * BLST_LEAF_FILL() - allocate specific blocks in leaf bitmap
768 blist_bitmap_t mask, bitmap;
774 bitmap = scan->u.bmu_bitmap & mask;
775 for (nblks = 0; bitmap != 0; nblks++)
776 bitmap &= bitmap - 1;
959 "): bitmap %0*" PRIx64 " big=%" PRIu64 "\n",
Indexes created Sat Sep 20 22:09:52 GMT 2025