35 static void radnode_del_postorder(struct region* region, struct radnode* n)  in radnode_del_postorder()
62 static struct radnode*
63 radnode_last_in_subtree(struct radnode* n)  in radnode_last_in_subtree()
71 				struct radnode* s = radnode_last_in_subtree(  in radnode_last_in_subtree()
84 static struct radnode*
85 radnode_last_in_subtree_incl_self(struct radnode* n)  in radnode_last_in_subtree_incl_self()
87 	struct radnode* s = radnode_last_in_subtree(n);  in radnode_last_in_subtree_incl_self()
94 static struct radnode*
95 radnode_first_in_subtree(struct radnode* n)  in radnode_first_in_subtree()
98 	struct radnode* s;  in radnode_first_in_subtree()
114 static struct radnode*
115 radnode_find_prev_from_idx(struct radnode* n, unsigned from)  in radnode_find_prev_from_idx()
121 			struct radnode* s = radnode_last_in_subtree_incl_self(  in radnode_find_prev_from_idx()
140 	radstrlen_type len, struct radnode** result, radstrlen_type* respos)  in radix_find_prefix_node()
142 	struct radnode* n = rt->root;  in radix_find_prefix_node()
184 radnode_array_grow(struct region* region, struct radnode* n, unsigned want)  in radnode_array_grow()
207 radnode_array_space(struct region* region, struct radnode* n, uint8_t byte)  in radnode_array_space()
342 	radstrlen_type pos, radstrlen_type len, struct radnode* add)  in radsel_split()
420 		struct radnode* com;  in radsel_split()
428 		com = (struct radnode*)region_alloc_zero(region, sizeof(*com));  in radsel_split()
494 struct radnode* radix_insert(struct radtree* rt, uint8_t* k,  in radix_insert()
497 	struct radnode* n;  in radix_insert()
500 	struct radnode* add = (struct radnode*)region_alloc_zero(rt->region,  in radix_insert()
513 			n = (struct radnode*)region_alloc_zero(rt->region,  in radix_insert()
613 static void radnode_delete(struct region* region, struct radnode* n)  in radnode_delete()
627 radnode_cleanup_onechild(struct region* region, struct radnode* n,  in radnode_cleanup_onechild()
628 	struct radnode* par)  in radnode_cleanup_onechild()
633 	struct radnode* child = n->array[0].node;  in radnode_cleanup_onechild()
668 radnode_array_clean_all(struct region* region, struct radnode* n)  in radnode_array_clean_all()
680 radnode_array_reduce_if_needed(struct region* region, struct radnode* n)  in radnode_array_reduce_if_needed()
695 radnode_array_clean_front(struct region* region, struct radnode* n)  in radnode_array_clean_front()
724 radnode_array_clean_end(struct region* region, struct radnode* n)  in radnode_array_clean_end()
747 radnode_cleanup_leaf(struct region* region, struct radnode* n,  in radnode_cleanup_leaf()
748 	struct radnode* par)  in radnode_cleanup_leaf()
784 radnode_cleanup(struct radtree* rt, struct radnode* n)  in radnode_cleanup()
793 			struct radnode* par = n->parent;  in radnode_cleanup()
813 void radix_delete(struct radtree* rt, struct radnode* n)  in radix_delete()
824 struct radnode* radix_search(struct radtree* rt, uint8_t* k,  in radix_search()
827 	struct radnode* n = rt->root;  in radix_search()
855 static int ret_self_or_prev(struct radnode* n, struct radnode** result)  in ret_self_or_prev()
864         struct radnode** result)  in radix_find_less_equal()
866 	struct radnode* n = rt->root;  in radix_find_less_equal()
950 struct radnode* radix_first(struct radtree* rt)  in radix_first()
952 	struct radnode* n;  in radix_first()
959 struct radnode* radix_last(struct radtree* rt)  in radix_last()
965 struct radnode* radix_next(struct radnode* n)  in radix_next()
970 		struct radnode* s = radnode_first_in_subtree(n);  in radix_next()
981 				struct radnode* s;  in radix_next()
995 struct radnode* radix_prev(struct radnode* n)  in radix_prev()
1001 		struct radnode* s;  in radix_prev()
1171 struct radnode*
1188 	struct radnode* n = radname_search(rt, d, max);  in radname_delete()
1193 struct radnode* radname_search(struct radtree* rt, const uint8_t* d,  in radname_search()
1199 	struct radnode* n = rt->root;  in radname_search()
1279         struct radnode** result)  in radname_find_less_equal()
1284 	struct radnode* n = rt->root;  in radname_find_less_equal()