Lines Matching defs:sortree
542 * @param sortree: reused sorted order. Stored in region. Pass NULL at start,
558 struct rbtree_type** sortree,
590 sig_idx, sortree, &buf_canon, reason, reason_bogus,
631 rbtree_type* sortree = NULL;
659 dnskey, i, &sortree, reason, reason_bogus,
713 rbtree_type* sortree = NULL;
736 dnskey, dnskey_idx, i, &sortree, &buf_canon, reason,
1026 * @param sortree: tree to sort into.
1031 rbtree_type* sortree, struct canon_rr* rrs)
1039 if(!rbtree_insert(sortree, &rrs[i].node)) {
1259 * @param sortree: if NULL is passed a new sorted rrset tree is built.
1268 struct rbtree_type** sortree, sldns_pkt_section section,
1277 if(!*sortree) {
1278 *sortree = (struct rbtree_type*)regional_alloc(region,
1280 if(!*sortree)
1286 *sortree = NULL;
1289 rbtree_init(*sortree, &canonical_tree_compare);
1290 canonical_sort(k, d, *sortree, rrs);
1297 RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {
1339 struct rbtree_type* sortree = NULL;
1346 sortree = (struct rbtree_type*)regional_alloc(region,
1348 if(!sortree)
1356 rbtree_init(sortree, &canonical_tree_compare);
1357 canonical_sort(k, d, sortree, rrs);
1360 RBTREE_FOR(walk, struct canon_rr*, sortree) {
1540 struct rbtree_type** sortree, int* buf_canon,
1663 18 + signer_len, sortree, section, qstate)) {