Home | History | Annotate | Download | only in kern

Lines Matching defs:blist

30  * BLIST.C -	Bitmap allocator/deallocator, using a radix tree with hinting
57  *	Unlike the rlist code, the blist code wires all necessary memory at
60  *	on an rlist_free() call.  The non-blocking features of the blist code
62  *	rlist code uses a little less overall memory than the blist code (but
63  *	due to swap interleaving not all that much less), but the blist code 
98 #include <sys/blist.h>
119 #include "../sys/blist.h"
137 struct blist {
174  * blist_create() - create a blist capable of handling up to the specified
179  *	The smallest blist consists of a single leaf node capable of 
202 	bl = kmem_zalloc(sizeof(struct blist), KM_SLEEP);
213 		"BLIST representing %" PRIu64 " blocks (%" PRIu64 " MB of swap)"
219 	printf("BLIST raw radix tree contains %" PRIu64 " records\n",
232 	kmem_free(bl, sizeof(struct blist));
336 	printf("BLIST {\n");