Lines Matching refs:nodes
36 * involved: One for the bitmaps contained in the leaf nodes (typically
37 * 32), and one for the meta nodes (typically 16). Both meta and leaf
38 * nodes have a hint field. This field gives us a hint as to the largest
44 * The radix tree also implements two collapsed states for meta nodes:
62 * sequentially in memory) by BLIST_META_RADIX lower level nodes. This
162 daddr_t nodes, radix, skip;
173 nodes = 1 + blst_radix_init(NULL, radix, skip, blocks);
183 bl->bl_root = malloc(nodes * sizeof(blmeta_t), M_SWAP, flags);
196 (long long)(nodes * sizeof(blmeta_t) + 1023) / 1024
199 (long long)nodes);