Home
last modified time | relevance | path

Searched refs:tree1 (Results 1 – 7 of 7) sorted by relevance

/NextBSD/sys/cddl/contrib/opensolaris/common/avl/
HDavl.c882 avl_swap(avl_tree_t *tree1, avl_tree_t *tree2) in avl_swap() argument
887 ASSERT3P(tree1->avl_compar, ==, tree2->avl_compar); in avl_swap()
888 ASSERT3U(tree1->avl_offset, ==, tree2->avl_offset); in avl_swap()
889 ASSERT3U(tree1->avl_size, ==, tree2->avl_size); in avl_swap()
891 temp_node = tree1->avl_root; in avl_swap()
892 temp_numnodes = tree1->avl_numnodes; in avl_swap()
893 tree1->avl_root = tree2->avl_root; in avl_swap()
894 tree1->avl_numnodes = tree2->avl_numnodes; in avl_swap()
/NextBSD/contrib/ldns/ldns/
HDradix.h205 ldns_status ldns_radix_split(ldns_radix_t* tree1, size_t num,
215 ldns_status ldns_radix_join(ldns_radix_t* tree1, ldns_radix_t* tree2);
HDrbtree.h201 void ldns_rbtree_join(ldns_rbtree_t *tree1, ldns_rbtree_t *tree2);
/NextBSD/contrib/ldns/
HDradix.c643 ldns_radix_join(ldns_radix_t* tree1, ldns_radix_t* tree2) in ldns_radix_join() argument
657 status = ldns_radix_insert(tree1, cur_node->key, in ldns_radix_join()
682 ldns_radix_split(ldns_radix_t* tree1, size_t num, ldns_radix_t** tree2) in ldns_radix_split() argument
687 if (!tree1 || !tree1->root || num == 0) { in ldns_radix_split()
699 cur_node = ldns_radix_first(tree1); in ldns_radix_split()
705 void* cur_data = ldns_radix_delete(tree1, cur_key, in ldns_radix_split()
725 cur_node = ldns_radix_first(tree1); in ldns_radix_split()
HDrbtree.c646 ldns_rbtree_join(ldns_rbtree_t *tree1, ldns_rbtree_t *tree2) in ldns_rbtree_join() argument
648 ldns_traverse_postorder(tree2, ldns_rbtree_insert_vref, tree1); in ldns_rbtree_join()
/NextBSD/sys/cddl/contrib/opensolaris/uts/common/sys/
HDavl.h269 extern void avl_swap(avl_tree_t *tree1, avl_tree_t *tree2);
/NextBSD/contrib/libgnuregex/
HDregcomp.c1331 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local
1348 tree1 = body ? create_tree (dfa, body, cls, CONCAT) : cls; in lower_subexp()
1349 tree = create_tree (dfa, op, tree1, CONCAT); in lower_subexp()
1350 if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0)) in lower_subexp()