Lines Matching defs:sortree
493 rbtree_type* sortree = NULL;
516 dnskey, i, &sortree, reason, section, qstate);
562 rbtree_type* sortree = NULL;
582 dnskey, dnskey_idx, i, &sortree, &buf_canon, reason,
597 struct rbtree_type** sortree, char** reason, sldns_pkt_section section,
623 sig_idx, sortree, &buf_canon, reason, section, qstate);
893 * @param sortree: tree to sort into.
898 rbtree_type* sortree, struct canon_rr* rrs)
906 if(!rbtree_insert(sortree, &rrs[i].node)) {
1126 * @param sortree: if NULL is passed a new sorted rrset tree is built.
1135 struct rbtree_type** sortree, sldns_pkt_section section,
1144 if(!*sortree) {
1145 *sortree = (struct rbtree_type*)regional_alloc(region,
1147 if(!*sortree)
1153 *sortree = NULL;
1156 rbtree_init(*sortree, &canonical_tree_compare);
1157 canonical_sort(k, d, *sortree, rrs);
1164 RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {
1380 struct rbtree_type** sortree, int* buf_canon, char** reason,
1480 18 + signer_len, sortree, section, qstate)) {