2 * BLIST.C - Bitmap allocator/deallocator, using a radix tree with hinting
4 * Copyright (c) 1998,2004 The DragonFly Project. All rights reserved.
6 * This code is derived from software contributed to The DragonFly Project
7 * by Matthew Dillon <dillon@backplane.com>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in
17 * the documentation and/or other materials provided with the
19 * 3. Neither the name of The DragonFly Project nor the names of its
20 * contributors may be used to endorse or promote products derived
21 * from this software without specific, prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
29 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
31 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
32 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
33 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * This module implements a general bitmap allocator/deallocator. The
38 * allocator eats around 2 bits per 'block'. The module does not
39 * try to interpret the meaning of a 'block' other then to return
40 * SWAPBLK_NONE on an allocation failure.
42 * A radix tree is used to maintain the bitmap. Two radix constants are
43 * involved: One for the bitmaps contained in the leaf nodes (typically
44 * 32), and one for the meta nodes (typically 16). Both meta and leaf
45 * nodes have a hint field. This field gives us a hint as to the largest
46 * free contiguous range of blocks under the node. It may contain a
47 * value that is too high, but will never contain a value that is too
48 * low. When the radix tree is searched, allocation failures in subtrees
51 * The radix tree also implements two collapsed states for meta nodes:
52 * the ALL-ALLOCATED state and the ALL-FREE state. If a meta node is
53 * in either of these two states, all information contained underneath
54 * the node is considered stale. These states are used to optimize
55 * allocation and freeing operations.
57 * The hinting greatly increases code efficiency for allocations while
58 * the general radix structure optimizes both allocations and frees. The
59 * radix tree should be able to operate well no matter how much
60 * fragmentation there is and no matter how large a bitmap is used.
62 * Unlike the rlist code, the blist code wires all necessary memory at
63 * creation time. Neither allocations nor frees require interaction with
64 * the memory subsystem. In contrast, the rlist code may allocate memory
65 * on an rlist_free() call. The non-blocking features of the blist code
66 * are used to great advantage in the swap code (vm/nswap_pager.c). The
67 * rlist code uses a little less overall memory then the blist code (but
68 * due to swap interleaving not all that much less), but the blist code
69 * scales much, much better.
71 * LAYOUT: The radix tree is layed out recursively using a
72 * linear array. Each meta node is immediately followed (layed out
73 * sequentially in memory) by BLIST_META_RADIX lower level nodes. This
74 * is a recursive structure but one that can be easily scanned through
75 * a very simple 'skip' calculation. In order to support large radixes,
76 * portions of the tree may reside outside our memory allocation. We
77 * handle this with an early-termination optimization (when bighint is
78 * set to -1) on the scan. The memory allocation is only large enough
79 * to cover the number of blocks requested at creation time even if it
80 * must be encompassed in larger root-node radix.
82 * NOTE: The allocator cannot currently allocate more then
83 * BLIST_BMAP_RADIX blocks per call. It will panic with 'allocation too
84 * large' if you try. This is an area that could use improvement. The
85 * radix is large enough that this restriction does not effect the swap
86 * system, though. Currently only the allocation code is effected by
87 * this algorithmic unfeature. The freeing code can handle arbitrary
90 * NOTE: The radix may exceed 32 bits in order to support up to 2^31
91 * blocks. The first divison will drop the radix down and fit
92 * it within a signed 32 bit integer.
94 * This code can be compiled stand-alone for debugging.
99 #include <sys/param.h>
100 #include <sys/systm.h>
101 #include <sys/lock.h>
102 #include <sys/kernel.h>
103 #include <sys/blist.h>
104 #include <sys/malloc.h>
108 #ifndef BLIST_NO_DEBUG
112 #define SWAPBLK_NONE ((swblk_t)-1)
114 #include <sys/types.h>
120 #define kmalloc(a,b,c) malloc(a)
121 #define kfree(a,b) free(a)
122 #define kprintf printf
123 #define KKASSERT(exp)
125 #include <sys/blist.h>
127 void panic(const char *ctl, ...);
132 * static support functions
135 static swblk_t blst_leaf_alloc(blmeta_t *scan, swblk_t blk, int count);
136 static swblk_t blst_meta_alloc(blmeta_t *scan, swblk_t blk,
137 swblk_t count, int64_t radix, int skip);
138 static void blst_leaf_free(blmeta_t *scan, swblk_t relblk, int count);
139 static void blst_meta_free(blmeta_t *scan, swblk_t freeBlk, swblk_t count,
140 int64_t radix, int skip, swblk_t blk);
141 static swblk_t blst_leaf_fill(blmeta_t *scan, swblk_t blk, int count);
142 static swblk_t blst_meta_fill(blmeta_t *scan, swblk_t fillBlk, swblk_t count,
143 int64_t radix, int skip, swblk_t blk);
144 static void blst_copy(blmeta_t *scan, swblk_t blk, int64_t radix,
145 swblk_t skip, blist_t dest, swblk_t count);
146 static swblk_t blst_radix_init(blmeta_t *scan, int64_t radix,
147 int skip, swblk_t count);
149 static void blst_radix_print(blmeta_t *scan, swblk_t blk,
150 int64_t radix, int skip, int tab);
154 static MALLOC_DEFINE(M_SWAP, "SWAP", "Swap space");
158 * blist_create() - create a blist capable of handling up to the specified
161 * blocks must be greater then 0
163 * The smallest blist consists of a single leaf node capable of
164 * managing BLIST_BMAP_RADIX blocks.
168 blist_create(swblk_t blocks)
175 * Calculate radix and skip field used for scanning.
177 * Radix can exceed 32 bits even if swblk_t is limited to 32 bits.
179 radix = BLIST_BMAP_RADIX;
181 while (radix < blocks) {
182 radix *= BLIST_META_RADIX;
183 skip = (skip + 1) * BLIST_META_RADIX;
187 bl = kmalloc(sizeof(struct blist), M_SWAP, M_WAITOK | M_ZERO);
189 bl->bl_blocks = blocks;
190 bl->bl_radix = radix;
192 bl->bl_rootblks = 1 +
193 blst_radix_init(NULL, bl->bl_radix, bl->bl_skip, blocks);
194 bl->bl_root = kmalloc(sizeof(blmeta_t) * bl->bl_rootblks, M_SWAP, M_WAITOK);
196 #if defined(BLIST_DEBUG)
198 "BLIST representing %d blocks (%d MB of swap)"
199 ", requiring %dK of ram\n",
201 bl->bl_blocks * 4 / 1024,
202 (bl->bl_rootblks * sizeof(blmeta_t) + 1023) / 1024
204 kprintf("BLIST raw radix tree contains %d records\n", bl->bl_rootblks);
206 blst_radix_init(bl->bl_root, bl->bl_radix, bl->bl_skip, blocks);
212 blist_destroy(blist_t bl)
214 kfree(bl->bl_root, M_SWAP);
219 * blist_alloc() - reserve space in the block bitmap. Return the base
220 * of a contiguous region or SWAPBLK_NONE if space could
225 blist_alloc(blist_t bl, swblk_t count)
227 swblk_t blk = SWAPBLK_NONE;
230 if (bl->bl_radix == BLIST_BMAP_RADIX)
231 blk = blst_leaf_alloc(bl->bl_root, 0, count);
233 blk = blst_meta_alloc(bl->bl_root, 0, count, bl->bl_radix, bl->bl_skip);
234 if (blk != SWAPBLK_NONE)
235 bl->bl_free -= count;
241 * blist_free() - free up space in the block bitmap. Return the base
242 * of a contiguous region. Panic if an inconsistancy is
247 blist_free(blist_t bl, swblk_t blkno, swblk_t count)
250 if (bl->bl_radix == BLIST_BMAP_RADIX)
251 blst_leaf_free(bl->bl_root, blkno, count);
253 blst_meta_free(bl->bl_root, blkno, count, bl->bl_radix, bl->bl_skip, 0);
254 bl->bl_free += count;
259 * blist_fill() - mark a region in the block bitmap as off-limits
260 * to the allocator (i.e. allocate it), ignoring any
261 * existing allocations. Return the number of blocks
262 * actually filled that were free before the call.
266 blist_fill(blist_t bl, swblk_t blkno, swblk_t count)
271 if (bl->bl_radix == BLIST_BMAP_RADIX) {
272 filled = blst_leaf_fill(bl->bl_root, blkno, count);
274 filled = blst_meta_fill(bl->bl_root, blkno, count,
275 bl->bl_radix, bl->bl_skip, 0);
277 bl->bl_free -= filled;
285 * blist_resize() - resize an existing radix tree to handle the
286 * specified number of blocks. This will reallocate
287 * the tree and transfer the previous bitmap to the new
288 * one. When extending the tree you can specify whether
289 * the new blocks are to left allocated or freed.
293 blist_resize(blist_t *pbl, swblk_t count, int freenew)
295 blist_t newbl = blist_create(count);
299 if (count > save->bl_blocks)
300 count = save->bl_blocks;
301 blst_copy(save->bl_root, 0, save->bl_radix, save->bl_skip, newbl, count);
304 * If resizing upwards, should we free the new space or not?
306 if (freenew && count < newbl->bl_blocks) {
307 blist_free(newbl, count, newbl->bl_blocks - count);
315 * blist_print() - dump radix tree
319 blist_print(blist_t bl)
321 kprintf("BLIST {\n");
322 blst_radix_print(bl->bl_root, 0, bl->bl_radix, bl->bl_skip, 4);
328 /************************************************************************
329 * ALLOCATION SUPPORT FUNCTIONS *
330 ************************************************************************
332 * These support functions do all the actual work. They may seem
333 * rather longish, but that's because I've commented them up. The
334 * actual code is straight forward.
339 * blist_leaf_alloc() - allocate at a leaf in the radix tree (a bitmap).
341 * This is the core of the allocator and is optimized for the 1 block
342 * and the BLIST_BMAP_RADIX block allocation cases. Other cases are
343 * somewhat slower. The 1 block allocation case is log2 and extremely
348 blst_leaf_alloc(blmeta_t *scan, swblk_t blk, int count)
350 u_swblk_t orig = scan->u.bmu_bitmap;
354 * Optimize bitmap all-allocated case. Also, count = 1
355 * case assumes at least 1 bit is free in the bitmap, so
356 * we have to take care of this case here.
358 scan->bm_bighint = 0;
359 return(SWAPBLK_NONE);
363 * Optimized code to allocate one bit out of the bitmap
366 int j = BLIST_BMAP_RADIX/2;
369 mask = (u_swblk_t)-1 >> (BLIST_BMAP_RADIX/2);
372 if ((orig & mask) == 0) {
379 scan->u.bmu_bitmap &= ~(1 << r);
382 if (count <= BLIST_BMAP_RADIX) {
384 * non-optimized code to allocate N bits out of the bitmap.
385 * The more bits, the faster the code runs. It will run
386 * the slowest allocating 2 bits, but since there aren't any
387 * memory ops in the core loop (or shouldn't be, anyway),
388 * you probably won't notice the difference.
391 int n = BLIST_BMAP_RADIX - count;
394 mask = (u_swblk_t)-1 >> n;
396 for (j = 0; j <= n; ++j) {
397 if ((orig & mask) == mask) {
398 scan->u.bmu_bitmap &= ~mask;
405 * We couldn't allocate count in this subtree, update bighint.
407 scan->bm_bighint = count - 1;
408 return(SWAPBLK_NONE);
412 * blist_meta_alloc() - allocate at a meta in the radix tree.
414 * Attempt to allocate at a meta node. If we can't, we update
415 * bighint and return a failure. Updating bighint optimize future
416 * calls that hit this node. We have to check for our collapse cases
417 * and we have a few optimizations strewn in as well.
420 blst_meta_alloc(blmeta_t *scan, swblk_t blk, swblk_t count,
421 int64_t radix, int skip)
424 int next_skip = ((u_int)skip / BLIST_META_RADIX);
427 * ALL-ALLOCATED special case
429 if (scan->u.bmu_avail == 0) {
430 scan->bm_bighint = 0;
431 return(SWAPBLK_NONE);
435 * ALL-FREE special case, initialize uninitialized
438 * NOTE: radix may exceed 32 bits until first division.
440 if (scan->u.bmu_avail == radix) {
441 scan->bm_bighint = radix;
443 radix /= BLIST_META_RADIX;
444 for (i = 1; i <= skip; i += next_skip) {
445 if (scan[i].bm_bighint == (swblk_t)-1)
447 if (next_skip == 1) {
448 scan[i].u.bmu_bitmap = (u_swblk_t)-1;
449 scan[i].bm_bighint = BLIST_BMAP_RADIX;
451 scan[i].bm_bighint = (swblk_t)radix;
452 scan[i].u.bmu_avail = (swblk_t)radix;
456 radix /= BLIST_META_RADIX;
459 for (i = 1; i <= skip; i += next_skip) {
460 if (count <= scan[i].bm_bighint) {
462 * count fits in object
465 if (next_skip == 1) {
466 r = blst_leaf_alloc(&scan[i], blk, count);
468 r = blst_meta_alloc(&scan[i], blk, count,
469 radix, next_skip - 1);
471 if (r != SWAPBLK_NONE) {
472 scan->u.bmu_avail -= count;
473 if (scan->bm_bighint > scan->u.bmu_avail)
474 scan->bm_bighint = scan->u.bmu_avail;
477 /* bighint was updated by recursion */
478 } else if (scan[i].bm_bighint == (swblk_t)-1) {
483 } else if (count > (swblk_t)radix) {
485 * count does not fit in object even if it were
488 panic("blist_meta_alloc: allocation too large");
490 blk += (swblk_t)radix;
494 * We couldn't allocate count in this subtree, update bighint.
496 if (scan->bm_bighint >= count)
497 scan->bm_bighint = count - 1;
498 return(SWAPBLK_NONE);
502 * BLST_LEAF_FREE() - free allocated block from leaf bitmap
505 blst_leaf_free(blmeta_t *scan, swblk_t blk, int count)
508 * free some data in this bitmap
511 * 0000111111111110000
515 int n = blk & (BLIST_BMAP_RADIX - 1);
518 mask = ((u_swblk_t)-1 << n) &
519 ((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
521 if (scan->u.bmu_bitmap & mask)
522 panic("blst_radix_free: freeing free block");
523 scan->u.bmu_bitmap |= mask;
526 * We could probably do a better job here. We are required to make
527 * bighint at least as large as the biggest contiguous block of
528 * data. If we just shoehorn it, a little extra overhead will
529 * be incured on the next allocation (but only that one typically).
531 scan->bm_bighint = BLIST_BMAP_RADIX;
535 * BLST_META_FREE() - free allocated blocks from radix tree meta info
537 * This support routine frees a range of blocks from the bitmap.
538 * The range must be entirely enclosed by this radix node. If a
539 * meta node, we break the range down recursively to free blocks
540 * in subnodes (which means that this code can free an arbitrary
541 * range whereas the allocation code cannot allocate an arbitrary
546 blst_meta_free(blmeta_t *scan, swblk_t freeBlk, swblk_t count,
547 int64_t radix, int skip, swblk_t blk)
550 int next_skip = ((u_int)skip / BLIST_META_RADIX);
553 kprintf("FREE (%x,%d) FROM (%x,%lld)\n",
555 blk, (long long)radix
560 * ALL-ALLOCATED special case, initialize for recursion.
562 * We will short-cut the ALL-ALLOCATED -> ALL-FREE case.
564 if (scan->u.bmu_avail == 0) {
565 scan->u.bmu_avail = count;
566 scan->bm_bighint = count;
568 if (count != radix) {
569 for (i = 1; i <= skip; i += next_skip) {
570 if (scan[i].bm_bighint == (swblk_t)-1)
572 scan[i].bm_bighint = 0;
573 if (next_skip == 1) {
574 scan[i].u.bmu_bitmap = 0;
576 scan[i].u.bmu_avail = 0;
582 scan->u.bmu_avail += count;
583 /* scan->bm_bighint = radix; */
587 * ALL-FREE special case.
589 * Set bighint for higher levels to snoop.
591 if (scan->u.bmu_avail == radix) {
592 scan->bm_bighint = radix;
597 * Break the free down into its components
599 if (scan->u.bmu_avail > radix) {
600 panic("blst_meta_free: freeing already "
601 "free blocks (%d) %d/%lld",
602 count, scan->u.bmu_avail, (long long)radix);
605 radix /= BLIST_META_RADIX;
607 i = (freeBlk - blk) / (swblk_t)radix;
608 blk += i * (swblk_t)radix;
609 i = i * next_skip + 1;
611 while (i <= skip && blk < freeBlk + count) {
614 v = blk + (swblk_t)radix - freeBlk;
618 if (scan->bm_bighint == (swblk_t)-1)
619 panic("blst_meta_free: freeing unexpected range");
621 if (next_skip == 1) {
622 blst_leaf_free(&scan[i], freeBlk, v);
624 blst_meta_free(&scan[i], freeBlk, v,
625 radix, next_skip - 1, blk);
629 * After having dealt with the becomes-all-free case any
630 * partial free will not be able to bring us to the
631 * becomes-all-free state.
633 * We can raise bighint to at least the sub-segment's
636 if (scan->bm_bighint < scan[i].bm_bighint) {
637 scan->bm_bighint = scan[i].bm_bighint;
641 blk += (swblk_t)radix;
647 * BLST_LEAF_FILL() - allocate specific blocks in leaf bitmap
649 * Allocates all blocks in the specified range regardless of
650 * any existing allocations in that range. Returns the number
651 * of blocks allocated by the call.
654 blst_leaf_fill(blmeta_t *scan, swblk_t blk, int count)
656 int n = blk & (BLIST_BMAP_RADIX - 1);
658 u_swblk_t mask, bitmap;
660 mask = ((u_swblk_t)-1 << n) &
661 ((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
663 /* Count the number of blocks we're about to allocate */
664 bitmap = scan->u.bmu_bitmap & mask;
665 for (nblks = 0; bitmap != 0; nblks++)
666 bitmap &= bitmap - 1;
668 scan->u.bmu_bitmap &= ~mask;
673 * BLST_META_FILL() - allocate specific blocks at a meta node
675 * Allocates the specified range of blocks, regardless of
676 * any existing allocations in the range. The range must
677 * be within the extent of this node. Returns the number
678 * of blocks allocated by the call.
681 blst_meta_fill(blmeta_t *scan, swblk_t fillBlk, swblk_t count,
682 int64_t radix, int skip, swblk_t blk)
685 int next_skip = ((u_int)skip / BLIST_META_RADIX);
688 if (count == radix || scan->u.bmu_avail == 0) {
690 * ALL-ALLOCATED special case
692 nblks = scan->u.bmu_avail;
693 scan->u.bmu_avail = 0;
694 scan->bm_bighint = count;
698 if (scan->u.bmu_avail == radix) {
699 radix /= BLIST_META_RADIX;
702 * ALL-FREE special case, initialize sublevel
704 for (i = 1; i <= skip; i += next_skip) {
705 if (scan[i].bm_bighint == (swblk_t)-1)
707 if (next_skip == 1) {
708 scan[i].u.bmu_bitmap = (u_swblk_t)-1;
709 scan[i].bm_bighint = BLIST_BMAP_RADIX;
711 scan[i].bm_bighint = (swblk_t)radix;
712 scan[i].u.bmu_avail = (swblk_t)radix;
716 radix /= BLIST_META_RADIX;
719 if (count > (swblk_t)radix)
720 panic("blst_meta_fill: allocation too large");
722 i = (fillBlk - blk) / (swblk_t)radix;
723 blk += i * (swblk_t)radix;
724 i = i * next_skip + 1;
726 while (i <= skip && blk < fillBlk + count) {
729 v = blk + (swblk_t)radix - fillBlk;
733 if (scan->bm_bighint == (swblk_t)-1)
734 panic("blst_meta_fill: filling unexpected range");
736 if (next_skip == 1) {
737 nblks += blst_leaf_fill(&scan[i], fillBlk, v);
739 nblks += blst_meta_fill(&scan[i], fillBlk, v,
740 radix, next_skip - 1, blk);
744 blk += (swblk_t)radix;
747 scan->u.bmu_avail -= nblks;
752 * BLIST_RADIX_COPY() - copy one radix tree to another
754 * Locates free space in the source tree and frees it in the destination
755 * tree. The space may not already be free in the destination.
759 blst_copy(blmeta_t *scan, swblk_t blk, int64_t radix,
760 swblk_t skip, blist_t dest, swblk_t count)
769 if (radix == BLIST_BMAP_RADIX) {
770 u_swblk_t v = scan->u.bmu_bitmap;
772 if (v == (u_swblk_t)-1) {
773 blist_free(dest, blk, count);
777 for (i = 0; i < BLIST_BMAP_RADIX && i < count; ++i) {
779 blist_free(dest, blk + i, 1);
789 if (scan->u.bmu_avail == 0) {
791 * Source all allocated, leave dest allocated
795 if (scan->u.bmu_avail == radix) {
797 * Source all free, free entire dest
800 blist_free(dest, blk, count);
802 blist_free(dest, blk, (swblk_t)radix);
807 radix /= BLIST_META_RADIX;
808 next_skip = ((u_int)skip / BLIST_META_RADIX);
810 for (i = 1; count && i <= skip; i += next_skip) {
811 if (scan[i].bm_bighint == (swblk_t)-1)
814 if (count >= (swblk_t)radix) {
823 count -= (swblk_t)radix;
837 blk += (swblk_t)radix;
842 * BLST_RADIX_INIT() - initialize radix tree
844 * Initialize our meta structures and bitmaps and calculate the exact
845 * amount of space required to manage 'count' blocks - this space may
846 * be considerably less then the calculated radix due to the large
847 * RADIX values we use.
851 blst_radix_init(blmeta_t *scan, int64_t radix, int skip, swblk_t count)
855 swblk_t memindex = 0;
861 if (radix == BLIST_BMAP_RADIX) {
863 scan->bm_bighint = 0;
864 scan->u.bmu_bitmap = 0;
870 * Meta node. If allocating the entire object we can special
871 * case it. However, we need to figure out how much memory
872 * is required to manage 'count' blocks, so we continue on anyway.
876 scan->bm_bighint = 0;
877 scan->u.bmu_avail = 0;
880 radix /= BLIST_META_RADIX;
881 next_skip = ((u_int)skip / BLIST_META_RADIX);
883 for (i = 1; i <= skip; i += next_skip) {
884 if (count >= (swblk_t)radix) {
886 * Allocate the entire object
888 memindex = i + blst_radix_init(
889 ((scan) ? &scan[i] : NULL),
894 count -= (swblk_t)radix;
895 } else if (count > 0) {
897 * Allocate a partial object
899 memindex = i + blst_radix_init(
900 ((scan) ? &scan[i] : NULL),
908 * Add terminator and break out
911 scan[i].bm_bighint = (swblk_t)-1;
923 blst_radix_print(blmeta_t *scan, swblk_t blk, int64_t radix, int skip, int tab)
929 if (radix == BLIST_BMAP_RADIX) {
931 "%*.*s(%04x,%lld): bitmap %08x big=%d\n",
933 blk, (long long)radix,
940 if (scan->u.bmu_avail == 0) {
942 "%*.*s(%04x,%lld) ALL ALLOCATED\n",
949 if (scan->u.bmu_avail == radix) {
951 "%*.*s(%04x,%lld) ALL FREE\n",
960 "%*.*s(%04x,%lld): subtree (%d/%lld) big=%d {\n",
962 blk, (long long)radix,
968 radix /= BLIST_META_RADIX;
969 next_skip = ((u_int)skip / BLIST_META_RADIX);
972 for (i = 1; i <= skip; i += next_skip) {
973 if (scan[i].bm_bighint == (swblk_t)-1) {
975 "%*.*s(%04x,%lld): Terminator\n",
977 blk, (long long)radix
989 blk += (swblk_t)radix;
1004 main(int ac, char **av)
1010 for (i = 1; i < ac; ++i) {
1011 const char *ptr = av[i];
1013 size = strtol(ptr, NULL, 0);
1017 fprintf(stderr, "Bad option: %s\n", ptr - 2);
1020 bl = blist_create(size);
1021 blist_free(bl, 0, size);
1029 kprintf("%d/%d/%lld> ",
1030 bl->bl_free, size, (long long)bl->bl_radix);
1032 if (fgets(buf, sizeof(buf), stdin) == NULL)
1036 if (sscanf(buf + 1, "%d", &count) == 1) {
1037 blist_resize(&bl, count, 1);
1046 if (sscanf(buf + 1, "%d", &count) == 1) {
1047 swblk_t blk = blist_alloc(bl, count);
1048 kprintf(" R=%04x\n", blk);
1054 if (sscanf(buf + 1, "%x %d", &da, &count) == 2) {
1055 blist_free(bl, da, count);
1061 if (sscanf(buf + 1, "%x %d", &da, &count) == 2) {
1063 blist_fill(bl, da, count));
1088 panic(const char *ctl, ...)
1092 __va_start(va, ctl);
1093 vfprintf(stderr, ctl, va);
1094 fprintf(stderr, "\n");