Lines Matching refs:blist
32 * Unlike the rlist code, the blist code wires all necessary memory at
35 * on an rlist_free() call. The non-blocking features of the blist code
37 * rlist code uses a little less overall memory then the blist code (but
38 * due to swap interleaving not all that much less), but the blist code
72 #include <sys/blist.h>
99 #include <sys/blist.h>
117 /* #include <sys/blist.h> */
118 #include "blist.h"
154 * blist_create() - create a blist capable of handling up to the specified
159 * The smallest blist consists of a single leaf node capable of
180 bl = malloc(sizeof(struct blist), M_SWAP, M_WAITOK);