radix_tree_node
struct radix_tree_node *n = path_node(t, &path, i - 1);
struct radix_tree_node *n;
static inline struct radix_tree_node *
radix_tree_node_init(struct radix_tree_node *n)
struct radix_tree_node *nodes[RADIX_TREE_MAX_HEIGHT];
nodes[i] = kmem_intr_alloc(sizeof(struct radix_tree_node),
kmem_intr_free(nodes[i], sizeof(struct radix_tree_node));
radix_tree_sum_node(const struct radix_tree_node *n)
radix_tree_node_count_ptrs(const struct radix_tree_node *n)
static struct radix_tree_node *
struct radix_tree_node *n;
n = kmem_intr_alloc(sizeof(struct radix_tree_node), KM_NOSLEEP);
radix_tree_free_node(struct radix_tree_node *n)
kmem_intr_free(n, sizeof(struct radix_tree_node));
struct radix_tree_node *newnodes[RADIX_TREE_MAX_HEIGHT];
struct radix_tree_node *n;
struct radix_tree_node *c;
struct radix_tree_node ** const pptr =
(struct radix_tree_node **)path_pptr(t, &path, i);
struct radix_tree_node *n;
struct radix_tree_node ** const pptr =
(struct radix_tree_node **)path_pptr(t, &path, i);
struct radix_tree_node *n;
struct radix_tree_node ** const pptr =
(struct radix_tree_node **)path_pptr(t, &path, i);
struct radix_tree_node *n;
struct radix_tree_node *n;