50 static ldns_radix_node_t* ldns_radix_new_node(void* data, uint8_t* key,
53 	radix_strlen_t len, ldns_radix_node_t** result, radix_strlen_t* pos);
54 static int ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte);
55 static int ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need);
62 	radix_strlen_t pos, radix_strlen_t len, ldns_radix_node_t* add);
67 static ldns_radix_node_t* ldns_radix_next_in_subtree(ldns_radix_node_t* node);
68 static ldns_radix_node_t* ldns_radix_prev_from_index(ldns_radix_node_t* node,
70 static ldns_radix_node_t* ldns_radix_last_in_subtree_incl_self(
71 	ldns_radix_node_t* node);
72 static ldns_radix_node_t* ldns_radix_last_in_subtree(ldns_radix_node_t* node);
73 static void ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node);
74 static void ldns_radix_cleanup_onechild(ldns_radix_node_t* node);
75 static void ldns_radix_cleanup_leaf(ldns_radix_node_t* node);
76 static void ldns_radix_node_free(ldns_radix_node_t* node, void* arg);
77 static void ldns_radix_node_array_free(ldns_radix_node_t* node);
78 static void ldns_radix_node_array_free_front(ldns_radix_node_t* node);
79 static void ldns_radix_node_array_free_end(ldns_radix_node_t* node);
80 static void ldns_radix_array_reduce(ldns_radix_node_t* node);
81 static void ldns_radix_self_or_prev(ldns_radix_node_t* node,
82 	ldns_radix_node_t** result);
89 static ldns_radix_node_t*
92 	ldns_radix_node_t* node = LDNS_MALLOC(ldns_radix_node_t);  in ldns_radix_new_node()
172 	ldns_radix_node_t* add = NULL;  in ldns_radix_insert()
173 	ldns_radix_node_t* prefix = NULL;  in ldns_radix_insert()
316     ldns_radix_node_t* del = ldns_radix_search(tree, key, len);  in ldns_radix_delete()
333 ldns_radix_node_t*
336 	ldns_radix_node_t* node = NULL;  in ldns_radix_search()
381 	radix_strlen_t len, ldns_radix_node_t** result)  in ldns_radix_find_less_equal()
383 	ldns_radix_node_t* node = NULL;  in ldns_radix_find_less_equal()
479 ldns_radix_node_t*
482 	ldns_radix_node_t* first = NULL;  in ldns_radix_first()
498 ldns_radix_node_t*
512 ldns_radix_node_t*
513 ldns_radix_next(ldns_radix_node_t* node)  in ldns_radix_next()
520 		ldns_radix_node_t* next = ldns_radix_next_in_subtree(node);  in ldns_radix_next()
532 				ldns_radix_node_t* next;  in ldns_radix_next()
553 ldns_radix_node_t*
554 ldns_radix_prev(ldns_radix_node_t* node)  in ldns_radix_prev()
563 		ldns_radix_node_t* prev;  in ldns_radix_prev()
583 ldns_radix_node_print(FILE* fd, ldns_radix_node_t* node,  in ldns_radix_node_print()
645 	ldns_radix_node_t* cur_node, *next_node;  in ldns_radix_join()
685 	ldns_radix_node_t* cur_node;  in ldns_radix_split()
740 ldns_radix_traverse_postorder(ldns_radix_node_t* node,  in ldns_radix_traverse_postorder()
741 	void (*func)(ldns_radix_node_t*, void*), void* arg)  in ldns_radix_traverse_postorder()  argument
774 	radix_strlen_t len, ldns_radix_node_t** result, radix_strlen_t* respos)  in ldns_radix_find_prefix()
777 	ldns_radix_node_t* n = tree->root;  in ldns_radix_find_prefix()
837 ldns_radix_array_space(ldns_radix_node_t* node, uint8_t byte)  in ldns_radix_array_space()
916 ldns_radix_array_grow(ldns_radix_node_t* node, unsigned need)  in ldns_radix_array_grow()
1000 	radix_strlen_t pos, radix_strlen_t len, ldns_radix_node_t* add)  in ldns_radix_array_split()
1108 		ldns_radix_node_t* common = NULL;  in ldns_radix_array_split()
1234 static ldns_radix_node_t*
1235 ldns_radix_next_in_subtree(ldns_radix_node_t* node)  in ldns_radix_next_in_subtree()
1238 	ldns_radix_node_t* next;  in ldns_radix_next_in_subtree()
1264 static ldns_radix_node_t*
1265 ldns_radix_prev_from_index(ldns_radix_node_t* node, uint8_t index)  in ldns_radix_prev_from_index()
1271 			ldns_radix_node_t* prev =  in ldns_radix_prev_from_index()
1288 static ldns_radix_node_t*
1289 ldns_radix_last_in_subtree_incl_self(ldns_radix_node_t* node)  in ldns_radix_last_in_subtree_incl_self()
1291 	ldns_radix_node_t* last = ldns_radix_last_in_subtree(node);  in ldns_radix_last_in_subtree_incl_self()
1307 static ldns_radix_node_t*
1308 ldns_radix_last_in_subtree(ldns_radix_node_t* node)  in ldns_radix_last_in_subtree()
1316 				ldns_radix_node_t* last =  in ldns_radix_last_in_subtree()
1340 ldns_radix_del_fix(ldns_radix_t* tree, ldns_radix_node_t* node)  in ldns_radix_del_fix()
1352 			ldns_radix_node_t* parent = node->parent;  in ldns_radix_del_fix()
1381 ldns_radix_cleanup_onechild(ldns_radix_node_t* node)  in ldns_radix_cleanup_onechild()
1386 	ldns_radix_node_t* child = node->array[0].edge;  in ldns_radix_cleanup_onechild()
1387 	ldns_radix_node_t* parent = node->parent;  in ldns_radix_cleanup_onechild()
1427 ldns_radix_cleanup_leaf(ldns_radix_node_t* node)  in ldns_radix_cleanup_leaf()
1430 	ldns_radix_node_t* parent = node->parent;  in ldns_radix_cleanup_leaf()
1457 ldns_radix_node_free(ldns_radix_node_t* node, void* arg)  in ldns_radix_node_free()
1481 ldns_radix_node_array_free(ldns_radix_node_t* node)  in ldns_radix_node_array_free()
1498 ldns_radix_node_array_free_front(ldns_radix_node_t* node)  in ldns_radix_node_array_free_front()
1534 ldns_radix_node_array_free_end(ldns_radix_node_t* node)  in ldns_radix_node_array_free_end()
1561 ldns_radix_array_reduce(ldns_radix_node_t* node)  in ldns_radix_array_reduce()
1585 ldns_radix_self_or_prev(ldns_radix_node_t* node, ldns_radix_node_t** result)  in ldns_radix_self_or_prev()