Lines Matching defs:radix_tree_node
185 * radix_tree_node: an intermediate node
196 struct radix_tree_node {
231 static inline struct radix_tree_node *
299 radix_tree_node_init(struct radix_tree_node *n)
330 struct radix_tree_node *nodes[RADIX_TREE_MAX_HEIGHT];
334 nodes[i] = kmem_intr_alloc(sizeof(struct radix_tree_node),
338 kmem_intr_free(nodes[i], sizeof(struct radix_tree_node));
352 radix_tree_sum_node(const struct radix_tree_node *n)
396 radix_tree_node_count_ptrs(const struct radix_tree_node *n)
406 static struct radix_tree_node *
409 struct radix_tree_node *n;
416 n = kmem_intr_alloc(sizeof(struct radix_tree_node), KM_NOSLEEP);
430 radix_tree_free_node(struct radix_tree_node *n)
435 kmem_intr_free(n, sizeof(struct radix_tree_node));
453 struct radix_tree_node *newnodes[RADIX_TREE_MAX_HEIGHT];
505 struct radix_tree_node *n;
524 struct radix_tree_node *c;
608 struct radix_tree_node ** const pptr =
609 (struct radix_tree_node **)path_pptr(t, &path, i);
610 struct radix_tree_node *n;
715 struct radix_tree_node ** const pptr =
716 (struct radix_tree_node **)path_pptr(t, &path, i);
717 struct radix_tree_node *n;
741 struct radix_tree_node ** const pptr =
742 (struct radix_tree_node **)path_pptr(t, &path, i);
743 struct radix_tree_node *n;
850 struct radix_tree_node *n;
1125 struct radix_tree_node *n = path_node(t, &path, i - 1);
1143 struct radix_tree_node *n;