Cross Reference: /bind-9.11.3/lib/dns/tests/rbt

Lines Matching defs:names
82 /* The full absolute names of the nodes in the tree (the tree also
94  * (for the names in domain_names[] above).
342 			  "Test tree balance, inserting names in random order");
370 	 * following code inserts names such as:
426 			  "Test tree balance, inserting names in sorted order");
454 	 * following code inserts names such as:
734 		/* Check that all names exist in order. */
893 insert_nodes(dns_rbt_t *mytree, char **names,
929 				names[*names_count] = isc_mem_strdup(mctx,
939 remove_nodes(dns_rbt_t *mytree, char **names,
956 		build_name_from_str(names[node], &fname);
962 		isc_mem_free(mctx, names[node]);
964 			names[node] = names[*names_count - 1];
965 			names[*names_count - 1] = NULL;
972 check_tree(dns_rbt_t *mytree, char **names, size_t names_count,
977 	UNUSED(names);
1019 	 * We use an array for storing names instead of a set
1022 	char *names[1024];
1036 	memset(names, 0, sizeof(names));
1051 		insert_nodes(mytree, names, &names_count, num_names);
1052 		check_tree(mytree, names, names_count, __LINE__);
1062 		remove_nodes(mytree, names, &names_count, num_names);
1063 		check_tree(mytree, names, names_count, __LINE__);
1067 	remove_nodes(mytree, names, &names_count, names_count);
1068 	check_tree(mytree, names, names_count, __LINE__);
1071 		if (names[i] != NULL) {
1072 			isc_mem_free(mctx, names[i]);
1095 static dns_name_t **names;
1110 	/* Query 32 million random names from it in each thread */
1114 			result = dns_rbt_findnode(mytree, names[i], NULL,
1150 	names = (dns_name_t **) malloc(4000000 * sizeof(dns_name_t *));
1157 		  names[i] = dns_fixedname_name(&fnames[i]);
1200 	free(names);