Searched refs:tree1 (Results 1 – 7 of 7) sorted by relevance
/dragonfly/contrib/ldns/ldns/ |
H A D | radix.h | 205 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);
|
H A D | rbtree.h | 201 void ldns_rbtree_join(ldns_rbtree_t *tree1, ldns_rbtree_t *tree2);
|
/dragonfly/contrib/ldns/ |
H A D | radix.c | 643 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()
|
H A D | rbtree.c | 646 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()
|
/dragonfly/contrib/diffutils/lib/ |
H A D | regcomp.c | 1360 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local 1377 tree1 = body ? create_tree (dfa, body, cls, CONCAT) : cls; in lower_subexp() 1378 tree = create_tree (dfa, op, tree1, CONCAT); in lower_subexp() 1379 if (__glibc_unlikely (tree == NULL || tree1 == NULL in lower_subexp()
|
/dragonfly/contrib/cvs-1.12/lib/ |
H A D | regcomp.c | 1278 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local 1294 tree1 = body ? create_tree (dfa, body, cls, CONCAT) : cls; in lower_subexp() 1295 tree = create_tree (dfa, op, tree1, CONCAT); in lower_subexp() 1296 if (BE (tree == NULL || tree1 == NULL || op == NULL || cls == NULL, 0)) in lower_subexp()
|
/dragonfly/contrib/grep/lib/ |
H A D | regcomp.c | 1348 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local 1365 tree1 = body ? create_tree (dfa, body, cls, CONCAT) : cls; in lower_subexp() 1366 tree = create_tree (dfa, op, tree1, CONCAT); in lower_subexp() 1367 if (__glibc_unlikely (tree == NULL || tree1 == NULL in lower_subexp()
|