Lines Matching defs:bl
166 blist_t bl;
180 bl = malloc(sizeof(struct blist), M_SWAP, M_WAITOK);
182 bzero(bl, sizeof(*bl));
184 bl->bl_blocks = blocks;
185 bl->bl_radix = radix;
186 bl->bl_skip = skip;
187 bl->bl_rootblks = 1 +
188 blst_radix_init(NULL, bl->bl_radix, bl->bl_skip, blocks);
189 bl->bl_root = malloc(sizeof(blmeta_t) * bl->bl_rootblks, M_SWAP, M_WAITOK);
195 bl->bl_blocks,
196 bl->bl_blocks * 4 / 1024,
197 (bl->bl_rootblks * sizeof(blmeta_t) + 1023) / 1024
199 printf("BLIST raw radix tree contains %d records\n", bl->bl_rootblks);
201 blst_radix_init(bl->bl_root, bl->bl_radix, bl->bl_skip, blocks);
203 return(bl);
207 blist_destroy(blist_t bl)
209 free(bl->bl_root, M_SWAP);
210 free(bl, M_SWAP);
220 blist_alloc(blist_t bl, daddr_t count)
224 if (bl) {
225 if (bl->bl_radix == BLIST_BMAP_RADIX)
226 blk = blst_leaf_alloc(bl->bl_root, 0, count);
228 blk = blst_meta_alloc(bl->bl_root, 0, count,
229 bl->bl_radix, bl->bl_skip);
231 bl->bl_free -= count;
243 blist_free(blist_t bl, daddr_t blkno, daddr_t count)
245 if (bl) {
246 if (bl->bl_radix == BLIST_BMAP_RADIX)
247 blst_leaf_free(bl->bl_root, blkno, count);
249 blst_meta_free(bl->bl_root, blkno, count,
250 bl->bl_radix, bl->bl_skip, 0);
251 bl->bl_free += count;
289 blist_print(blist_t bl)
292 blst_radix_print(bl->bl_root, 0, bl->bl_radix, bl->bl_skip, 4);
860 blist_t bl;
872 bl = blist_create(size);
873 blist_free(bl, 0, size);
881 printf("%d/%d/%d> ", bl->bl_free, size, bl->bl_radix);
888 blist_resize(&bl, count, 1);
893 blist_print(bl);
897 daddr_t blk = blist_alloc(bl, count);
905 blist_free(bl, da, count);