558 	struct rbtree_type** sortree,  in dnskeyset_verify_rrset_sig()  argument
590 			sig_idx, sortree, &buf_canon, reason, reason_bogus,  in dnskeyset_verify_rrset_sig()
631 	rbtree_type* sortree = NULL;  in dnskeyset_verify_rrset()  local
659 			dnskey, i, &sortree, reason, reason_bogus,  in dnskeyset_verify_rrset()
713 	rbtree_type* sortree = NULL;  in dnskey_verify_rrset()  local
736 			dnskey, dnskey_idx, i, &sortree, &buf_canon, reason,  in dnskey_verify_rrset()
1031 	rbtree_type* sortree, struct canon_rr* rrs)  in canonical_sort()  argument
1039 		if(!rbtree_insert(sortree, &rrs[i].node)) {  in canonical_sort()
1268 	struct rbtree_type** sortree, sldns_pkt_section section,  in rrset_canonical()  argument
1277 	if(!*sortree) {  in rrset_canonical()
1278 		*sortree = (struct rbtree_type*)regional_alloc(region,   in rrset_canonical()
1280 		if(!*sortree)  in rrset_canonical()
1286 			*sortree = NULL;  in rrset_canonical()
1289 		rbtree_init(*sortree, &canonical_tree_compare);  in rrset_canonical()
1290 		canonical_sort(k, d, *sortree, rrs);  in rrset_canonical()
1297 	RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {  in rrset_canonical()
1339 	struct rbtree_type* sortree = NULL;  in rrset_canonicalize_to_buffer()  local
1346 	sortree = (struct rbtree_type*)regional_alloc(region,  in rrset_canonicalize_to_buffer()
1348 	if(!sortree)  in rrset_canonicalize_to_buffer()
1356 	rbtree_init(sortree, &canonical_tree_compare);  in rrset_canonicalize_to_buffer()
1357 	canonical_sort(k, d, sortree, rrs);  in rrset_canonicalize_to_buffer()
1360 	RBTREE_FOR(walk, struct canon_rr*, sortree) {  in rrset_canonicalize_to_buffer()
1540 	struct rbtree_type** sortree, int* buf_canon,  in dnskey_verify_rrset_sig()  argument
1663 			18 + signer_len, sortree, section, qstate)) {  in dnskey_verify_rrset_sig()