unbound/validator/val_sigcrypt.c

482 	rbtree_t* sortree = NULL;
505 			dnskey, i, &sortree, reason);
550 	rbtree_t* sortree = NULL;
570 			dnskey, dnskey_idx, i, &sortree, &buf_canon, reason);
584 	struct rbtree_t** sortree, char** reason)
609 			sig_idx, sortree, &buf_canon, reason);
878  * @param sortree: tree to sort into.
883 	rbtree_t* sortree, struct canon_rr* rrs)
891 		if(!rbtree_insert(sortree, &rrs[i].node)) {
1046  * @param sortree: if NULL is passed a new sorted rrset tree is built.
1053 	struct rbtree_t** sortree)
1061 	if(!*sortree) {
1062 		*sortree = (struct rbtree_t*)regional_alloc(region,
1064 		if(!*sortree)
1068 			*sortree = NULL;
1071 		rbtree_init(*sortree, &canonical_tree_compare);
1072 		canonical_sort(k, d, *sortree, rrs);
1079 	RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {
1235 	struct rbtree_t** sortree, int* buf_canon, char** reason)
1334 			18 + signer_len, sortree)) {