Lines Matching defs:tree

82 void name_tree_init(rbtree_type* tree)
84 	rbtree_init(tree, &name_tree_compare);
87 void addr_tree_init(rbtree_type* tree)
89 	rbtree_init(tree, &addr_tree_compare);
92 void addr_tree_addrport_init(rbtree_type* tree)
94 	rbtree_init(tree, &addr_tree_addrport_compare);
97 int name_tree_insert(rbtree_type* tree, struct name_tree_node* node, 
106 	return rbtree_insert(tree, &node->node) != NULL;
109 int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,
117 	return rbtree_insert(tree, &node->node) != NULL;
147 void addr_tree_init_parents(rbtree_type* tree)
150 			(struct addr_tree_node*)rbtree_first(tree));
153 void name_tree_init_parents(rbtree_type* tree)
157         RBTREE_FOR(node, struct name_tree_node*, tree) {
179 struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name, 
188 	return (struct name_tree_node*)rbtree_search(tree, &key);
191 struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,
202         if(rbtree_find_less_equal(tree, &key, &res)) {
223 struct addr_tree_node* addr_tree_lookup(rbtree_type* tree, 
233         if(rbtree_find_less_equal(tree, &key, &res)) {
254 struct addr_tree_node* addr_tree_find(rbtree_type* tree,
263 	res = rbtree_search(tree, &key);
268 name_tree_next_root(rbtree_type* tree, uint16_t* dclass)
274 		/* first root item is first item in tree */
275 		n = rbtree_first(tree);
285 		return name_tree_next_root(tree, dclass);
287 	/* find class n in tree, we may get a direct hit, or if we don't
296 	if(rbtree_find_less_equal(tree, &key, &n)) {
313 		return name_tree_next_root(tree, dclass);