14 if(!new_rrs)
return NULL;
37 ldns_dnssec_rrs_free_internal(rrs, 0);
43 ldns_dnssec_rrs_free_internal(rrs, 1);
72 new_rrs->
rr = rrs->
rr;
86 fprintf(out,
"; <void>");
109 if(!new_rrsets)
return NULL;
110 new_rrsets->
rrs = NULL;
111 new_rrsets->
type = 0;
113 new_rrsets->
next = NULL;
122 ldns_dnssec_rrs_free_internal(rrsets->
rrs, deep);
125 ldns_dnssec_rrsets_free_internal(rrsets->
next, deep);
128 ldns_dnssec_rrs_free_internal(rrsets->
signatures, deep);
137 ldns_dnssec_rrsets_free_internal(rrsets, 0);
143 ldns_dnssec_rrsets_free_internal(rrsets, 1);
184 new_rrsets->
rrs->
rr = rr;
189 new_rrsets->
type = rr_type;
201 if (!rrsets || !rr) {
215 rrsets->
rrs->
rr = rr;
216 rrsets->
type = rr_type;
220 rrsets->
type = rr_type;
230 rrsets->
next = new_rrsets;
236 new_rrsets->
rrs = rrsets->
rrs;
242 rrsets->
rrs->
rr = rr;
249 rrsets->
type = rr_type;
250 rrsets->
next = new_rrsets;
265 rrsets->
rrs->
rr = rr;
281 fprintf(out,
"; <void>\n");
294 if (follow && rrsets->
next) {
296 rrsets->
next, follow, show_soa);
308 rrsets, follow, show_soa);
375 ldns_dnssec_rrsets_free_internal(name->
rrsets, deep);
377 if (name->
nsec && deep) {
395 ldns_dnssec_name_free_internal(name, 0);
401 ldns_dnssec_name_free_internal(name, 1);
426 if (rrset && dname) {
472 bool hashed_name =
false;
537 if (result->
type == type) {
540 result = result->
next;
553 if (!zone || !dname) {
574 name->
rrsets,
true, show_soa);
576 fprintf(out,
";; Empty nonterminal: ");
588 fprintf(out,
"; <void>\n");
617 if(!zone)
return NULL;
637 #define FASTER_DNSSEC_ZONE_NEW_FRM_FP 1
659 #ifdef FASTER_DNSSEC_ZONE_NEW_FRM_FP
664 uint32_t my_ttl = ttl;
667 if (!newzone || !todo_nsec3s || !todo_nsec3_rrsigs )
goto error;
674 #ifdef FASTER_DNSSEC_ZONE_NEW_FRM_FP
694 if (rr_is_rrsig_covering(cur_rr,
753 #ifdef FASTER_DNSSEC_ZONE_NEW_FRM_FP
900 cur_node->
data = cur_name;
908 fprintf(stderr,
"error adding rr: ");
914 zone->
soa = cur_name;
952 fprintf(out,
";; Zone: ");
955 fprintf(out,
"\n;\n");
988 uint16_t i, cur_label_count, next_label_count;
989 uint16_t soa_label_count = 0;
1015 if (! cur_node->
data || ! next_node->
data) {
1030 for (i = 1; i < next_label_count - soa_label_count; i++) {
1031 lpos = (int)cur_label_count - (
int)next_label_count + (int)i;
1049 if (!new_name->
name) {
1059 new_node->
key = new_name->
name;
1060 new_node->
data = new_name;
1071 cur_node = next_node;