Searched refs:name_tree_node (Results 1 - 7 of 7) sorted by relevance
/freebsd-10-stable/contrib/unbound/util/storage/ |
H A D | dnstree.h | 55 struct name_tree_node { struct 59 struct name_tree_node* parent; 108 int name_tree_insert(rbtree_t* tree, struct name_tree_node* node, 127 struct name_tree_node* name_tree_find(rbtree_t* tree, uint8_t* name, 139 struct name_tree_node* name_tree_lookup(rbtree_t* tree, uint8_t* name,
|
H A D | dnstree.c | 49 struct name_tree_node* x = (struct name_tree_node*)k1; 50 struct name_tree_node* y = (struct name_tree_node*)k2; 84 int name_tree_insert(rbtree_t* tree, struct name_tree_node* node, 135 struct name_tree_node* node, *prev = NULL, *p; 137 RBTREE_FOR(node, struct name_tree_node*, tree) { argument 159 struct name_tree_node* name_tree_find(rbtree_t* tree, uint8_t* name, 162 struct name_tree_node key; 168 return (struct name_tree_node*)rbtree_searc [all...] |
/freebsd-10-stable/contrib/unbound/iterator/ |
H A D | iter_hints.h | 60 * uses name_tree_node from dnstree.h. 70 struct name_tree_node node;
|
H A D | iter_priv.c | 113 struct name_tree_node* n; 132 n = (struct name_tree_node*)regional_alloc(priv->region,
|
H A D | iter_utils.c | 115 struct name_tree_node* n; 122 n = (struct name_tree_node*)calloc(1, sizeof(*n));
|
H A D | iterator.c | 108 free(((struct name_tree_node*)n)->name);
|
/freebsd-10-stable/contrib/unbound/services/cache/ |
H A D | infra.h | 126 struct name_tree_node node;
|
Completed in 83 milliseconds