771 struct canon_rr {  struct
1014 	struct canon_rr* r1 = (struct canon_rr*)k1;  in canonical_tree_compare()
1015 	struct canon_rr* r2 = (struct canon_rr*)k2;  in canonical_tree_compare()
1031 	rbtree_type* sortree, struct canon_rr* rrs)  in canonical_sort()
1190 	struct canon_rr *rrs1, *rrs2, *p1, *p2;  in rrset_canonical_equal()
1223 	rrs1 = regional_alloc(region, sizeof(struct canon_rr)*d1->count);  in rrset_canonical_equal()
1224 	rrs2 = regional_alloc(region, sizeof(struct canon_rr)*d2->count);  in rrset_canonical_equal()
1234 	p1 = (struct canon_rr*)rbtree_first(&sortree1);  in rrset_canonical_equal()
1235 	p2 = (struct canon_rr*)rbtree_first(&sortree2);  in rrset_canonical_equal()
1236 	while(p1 != (struct canon_rr*)RBTREE_NULL &&  in rrset_canonical_equal()
1237 		p2 != (struct canon_rr*)RBTREE_NULL) {  in rrset_canonical_equal()
1245 		p1 = (struct canon_rr*)rbtree_next(&p1->node);  in rrset_canonical_equal()
1246 		p2 = (struct canon_rr*)rbtree_next(&p2->node);  in rrset_canonical_equal()
1274 	struct canon_rr* walk;  in rrset_canonical()
1275 	struct canon_rr* rrs;  in rrset_canonical()
1284 		rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);  in rrset_canonical()
1297 	RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {  in rrset_canonical()
1343 	struct canon_rr* walk;  in rrset_canonicalize_to_buffer()
1344 	struct canon_rr* rrs;  in rrset_canonicalize_to_buffer()
1352 	rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);  in rrset_canonicalize_to_buffer()
1360 	RBTREE_FOR(walk, struct canon_rr*, sortree) {  in rrset_canonicalize_to_buffer()