3 * - RR-type-specific code, and the machinery to call it
6 * This file is part of adns, which is Copyright (C) 1997-1999 Ian Jackson
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2, or (at your option)
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software Foundation,
20 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
26 #include <sys/types.h>
27 #include <sys/socket.h>
28 #include <netinet/in.h>
29 #include <arpa/inet.h>
33 #define R_NOMEM return adns_s_nomemory
34 #define CSP_ADDSTR(s) do { if (!adns__vbuf_appendstr(vb,(s))) R_NOMEM; } while (0)
40 * _textdata, _qstring (csp)
46 * _addr (pa,di,csp,cs)
49 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +pap_findaddrs)
52 * _inthostaddr (mf,cs)
57 * _mailbox (pap +pap_mailbox822)
62 * within each section:
75 * _textdata, _qstring (csp)
78 static adns_status pap_string(const parseinfo *pai, int *cbyte_io, int max,
79 int *len_r, char **str_r) {
80 /* Neither len_r nor str_r may be null.
81 * End of datagram (overrun) is indicated by returning adns_s_invaliddata;
83 const byte *dgram= pai->dgram;
89 if (cbyte >= max) return adns_s_invaliddata;
91 if (cbyte+l > max) return adns_s_invaliddata;
93 str= adns__alloc_interim(pai->qu, l+1);
97 memcpy(str,dgram+cbyte,l);
106 static adns_status csp_textdata(vbuf *vb, const char *dp, int len) {
112 for (cn=0; cn<len; cn++) {
114 if (ch >= 32 && ch <= 126 && ch != '"' && ch != '\\') {
115 if (!adns__vbuf_append(vb,&ch,1)) R_NOMEM;
116 } else if (ch == '\\') {
119 sprintf(buf,"\\x%02x",ch);
128 static adns_status csp_qstring(vbuf *vb, const char *dp) {
129 return csp_textdata(vb, dp, strlen(dp));
136 static void mf_str(adns_query qu, void *datap) {
139 adns__makefinal_str(qu,rrp);
142 static adns_status cs_str(vbuf *vb, const void *datap) {
143 const char *const *rrp= datap;
145 return csp_qstring(vb,*rrp);
149 * _intstr (mf,csp,cs)
152 static void mf_intstr(adns_query qu, void *datap) {
153 adns_rr_intstr *rrp= datap;
155 adns__makefinal_str(qu,&rrp->str);
158 static adns_status csp_intstr(vbuf *vb, const adns_rr_intstr *rrp) {
161 sprintf(buf,"%u ",rrp->i);
163 return csp_qstring(vb,rrp->str);
166 static adns_status cs_intstr(vbuf *vb, const void *datap) {
167 const adns_rr_intstr *rrp= datap;
169 return csp_intstr(vb,rrp);
176 static void mf_manyistr(adns_query qu, void *datap) {
177 adns_rr_intstr **rrp= datap;
178 adns_rr_intstr *te, *table;
182 for (tc=0, te= *rrp; te->i >= 0; te++, tc++);
184 adns__makefinal_block(qu,&tablev,sizeof(*te)*(tc+1));
186 for (te= *rrp; te->i >= 0; te++)
187 adns__makefinal_str(qu,&te->str);
190 static adns_status cs_manyistr(vbuf *vb, const void *datap) {
191 const adns_rr_intstr *const *rrp= datap;
192 const adns_rr_intstr *current;
196 for (spc=0, current= *rrp; current->i >= 0; current++) {
197 if (spc) CSP_ADDSTR(" ");
198 st= csp_textdata(vb,current->str,current->i); if (st) return st;
207 static adns_status pa_txt(const parseinfo *pai, int cbyte, int max, void *datap) {
208 adns_rr_intstr **rrp= datap, *table, *te;
209 const byte *dgram= pai->dgram;
210 int ti, tc, l, startbyte;
214 if (cbyte >= max) return adns_s_invaliddata;
216 while (cbyte < max) {
221 if (cbyte != max) return adns_s_invaliddata;
223 table= adns__alloc_interim(pai->qu,sizeof(*table)*(tc+1));
226 for (cbyte=startbyte, ti=0, te=table; ti<tc; ti++, te++) {
227 st= pap_string(pai, &cbyte, max, &te->i, &te->str);
230 assert(cbyte == max);
240 * _inaddr (pa,dip,di)
243 static adns_status pa_inaddr(const parseinfo *pai, int cbyte, int max, void *datap) {
244 struct in_addr *storeto= datap;
246 if (max-cbyte != 4) return adns_s_invaliddata;
247 memcpy(storeto, pai->dgram + cbyte, 4);
251 static int search_sortlist(adns_state ads, struct in_addr ad) {
252 const struct sortlist *slp;
255 for (i=0, slp=ads->sortlist;
256 i<ads->nsortlist && !((ad.s_addr & slp->mask.s_addr) == slp->base.s_addr);
261 static int dip_inaddr(adns_state ads, struct in_addr a, struct in_addr b) {
264 if (!ads->nsortlist) return 0;
266 ai= search_sortlist(ads,a);
267 bi= search_sortlist(ads,b);
271 static int di_inaddr(adns_state ads, const void *datap_a, const void *datap_b) {
272 const struct in_addr *ap= datap_a, *bp= datap_b;
274 return dip_inaddr(ads,*ap,*bp);
277 static adns_status cs_inaddr(vbuf *vb, const void *datap) {
278 const struct in_addr *rrp= datap, rr= *rrp;
281 ia= inet_ntoa(rr); assert(ia);
287 * _addr (pa,di,csp,cs)
290 static adns_status pa_addr(const parseinfo *pai, int cbyte, int max, void *datap) {
291 adns_rr_addr *storeto= datap;
292 const byte *dgram= pai->dgram;
294 if (max-cbyte != 4) return adns_s_invaliddata;
295 storeto->len= sizeof(storeto->addr.inet);
296 memset(&storeto->addr,0,sizeof(storeto->addr.inet));
297 storeto->addr.inet.sin_family= AF_INET;
298 memcpy(&storeto->addr.inet.sin_addr,dgram+cbyte,4);
302 static int di_addr(adns_state ads, const void *datap_a, const void *datap_b) {
303 const adns_rr_addr *ap= datap_a, *bp= datap_b;
305 assert(ap->addr.sa.sa_family == AF_INET);
306 return dip_inaddr(ads, ap->addr.inet.sin_addr, bp->addr.inet.sin_addr);
309 static int div_addr(void *context, const void *datap_a, const void *datap_b) {
310 const adns_state ads= context;
312 return di_addr(ads, datap_a, datap_b);
315 static adns_status csp_addr(vbuf *vb, const adns_rr_addr *rrp) {
319 switch (rrp->addr.inet.sin_family) {
321 CSP_ADDSTR("AF_INET ");
322 ia= inet_ntoa(rrp->addr.inet.sin_addr); assert(ia);
326 sprintf(buf,"AF=%u",rrp->addr.sa.sa_family);
333 static adns_status cs_addr(vbuf *vb, const void *datap) {
334 const adns_rr_addr *rrp= datap;
336 return csp_addr(vb,rrp);
343 static adns_status pap_domain(const parseinfo *pai, int *cbyte_io, int max,
344 char **domain_r, parsedomain_flags flags) {
348 st= adns__parse_domain(pai->qu->ads, pai->serv, pai->qu, &pai->qu->vb, flags,
349 pai->dgram,pai->dglen, cbyte_io, max);
351 if (!pai->qu->vb.used) return adns_s_invaliddata;
353 dm= adns__alloc_interim(pai->qu, pai->qu->vb.used+1);
356 dm[pai->qu->vb.used]= 0;
357 memcpy(dm,pai->qu->vb.buf,pai->qu->vb.used);
367 static adns_status pa_host_raw(const parseinfo *pai, int cbyte, int max, void *datap) {
371 st= pap_domain(pai, &cbyte, max, rrp,
372 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
375 if (cbyte != max) return adns_s_invaliddata;
380 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +icb_hostaddr, pap_findaddrs)
383 static adns_status pap_findaddrs(const parseinfo *pai, adns_rr_hostaddr *ha,
384 int *cbyte_io, int count, int dmstart) {
386 int type, class, rdlen, rdstart, ownermatched;
390 for (rri=0, naddrs=-1; rri<count; rri++) {
391 st= adns__findrr_anychk(pai->qu, pai->serv, pai->dgram, pai->dglen, cbyte_io,
392 &type, &class, &ttl, &rdlen, &rdstart,
393 pai->dgram, pai->dglen, dmstart, &ownermatched);
395 if (!ownermatched || class != DNS_CLASS_IN || type != adns_r_a) {
396 if (naddrs>0) break; else continue;
401 if (!adns__vbuf_ensure(&pai->qu->vb, (naddrs+1)*sizeof(adns_rr_addr))) R_NOMEM;
402 adns__update_expires(pai->qu,ttl,pai->now);
403 st= pa_addr(pai, rdstart,rdstart+rdlen,
404 pai->qu->vb.buf + naddrs*sizeof(adns_rr_addr));
409 ha->addrs= adns__alloc_interim(pai->qu, naddrs*sizeof(adns_rr_addr));
410 if (!ha->addrs) R_NOMEM;
411 memcpy(ha->addrs, pai->qu->vb.buf, naddrs*sizeof(adns_rr_addr));
413 ha->astatus= adns_s_ok;
415 adns__isort(ha->addrs, naddrs, sizeof(adns_rr_addr), pai->qu->vb.buf,
421 static void icb_hostaddr(adns_query parent, adns_query child) {
422 adns_answer *cans= child->answer;
423 adns_rr_hostaddr *rrp= child->ctx.info.hostaddr;
425 rrp->astatus= cans->status;
426 rrp->naddrs= cans->nrrs;
427 rrp->addrs= cans->rrs.addr;
428 adns__transfer_interim(child, parent, rrp->addrs, rrp->naddrs*sizeof(adns_rr_addr));
430 if (!parent->children.head) adns__query_done(parent);
433 static adns_status pap_hostaddr(const parseinfo *pai, int *cbyte_io,
434 int max, adns_rr_hostaddr *rrp) {
440 adns_queryflags nflags;
442 dmstart= cbyte= *cbyte_io;
443 st= pap_domain(pai, &cbyte, max, &rrp->host,
444 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
448 rrp->astatus= adns_s_ok;
454 st= pap_findaddrs(pai, rrp, &cbyte, pai->nscount, dmstart);
456 if (rrp->naddrs != -1) return adns_s_ok;
458 st= pap_findaddrs(pai, rrp, &cbyte, pai->arcount, dmstart);
460 if (rrp->naddrs != -1) return adns_s_ok;
462 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
463 pai->dgram, pai->dglen, dmstart,
464 adns_r_addr, adns_qf_quoteok_query);
468 ctx.callback= icb_hostaddr;
469 ctx.info.hostaddr= rrp;
471 nflags= adns_qf_quoteok_query;
472 if (!(pai->qu->flags & adns_qf_cname_loose)) nflags |= adns_qf_cname_forbid;
474 st= adns__internal_submit(pai->ads, &nqu, adns__findtype(adns_r_addr),
475 &pai->qu->vb, id, nflags, pai->now, &ctx);
478 nqu->parent= pai->qu;
479 LIST_LINK_TAIL_PART(pai->qu->children,nqu,siblings.);
484 static adns_status pa_hostaddr(const parseinfo *pai, int cbyte, int max, void *datap) {
485 adns_rr_hostaddr *rrp= datap;
488 st= pap_hostaddr(pai, &cbyte, max, rrp);
490 if (cbyte != max) return adns_s_invaliddata;
495 static int dip_hostaddr(adns_state ads, const adns_rr_hostaddr *ap, const adns_rr_hostaddr *bp) {
496 if (ap->astatus != bp->astatus) return ap->astatus;
497 if (ap->astatus) return 0;
499 assert(ap->addrs[0].addr.sa.sa_family == AF_INET);
500 assert(bp->addrs[0].addr.sa.sa_family == AF_INET);
501 return dip_inaddr(ads,
502 ap->addrs[0].addr.inet.sin_addr,
503 bp->addrs[0].addr.inet.sin_addr);
506 static int di_hostaddr(adns_state ads, const void *datap_a, const void *datap_b) {
507 const adns_rr_hostaddr *ap= datap_a, *bp= datap_b;
509 return dip_hostaddr(ads, ap,bp);
512 static void mfp_hostaddr(adns_query qu, adns_rr_hostaddr *rrp) {
515 adns__makefinal_str(qu,&rrp->host);
517 adns__makefinal_block(qu, &tablev, rrp->naddrs*sizeof(*rrp->addrs));
521 static void mf_hostaddr(adns_query qu, void *datap) {
522 adns_rr_hostaddr *rrp= datap;
524 mfp_hostaddr(qu,rrp);
527 static adns_status csp_hostaddr(vbuf *vb, const adns_rr_hostaddr *rrp) {
532 st= csp_qstring(vb,rrp->host); if (st) return st;
536 CSP_ADDSTR(adns_strerror(rrp->astatus));
538 assert(rrp->naddrs > 0);
539 for (i=0, to_add= ": "; i<rrp->naddrs; i++, to_add= ", ") {
541 st= csp_addr(vb,&rrp->addrs[i]);
547 static adns_status cs_hostaddr(vbuf *vb, const void *datap) {
548 const adns_rr_hostaddr *rrp= datap;
550 return csp_hostaddr(vb,rrp);
557 static adns_status pa_mx_raw(const parseinfo *pai, int cbyte, int max, void *datap) {
558 const byte *dgram= pai->dgram;
559 adns_rr_intstr *rrp= datap;
563 if (cbyte+2 > max) return adns_s_invaliddata;
566 st= pap_domain(pai, &cbyte, max, &rrp->str,
567 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
570 if (cbyte != max) return adns_s_invaliddata;
574 static int di_mx_raw(adns_state ads, const void *datap_a, const void *datap_b) {
575 const adns_rr_intstr *ap= datap_a, *bp= datap_b;
577 if (ap->i < bp->i) return 0;
578 if (ap->i > bp->i) return 1;
586 static adns_status pa_mx(const parseinfo *pai, int cbyte, int max, void *datap) {
587 const byte *dgram= pai->dgram;
588 adns_rr_inthostaddr *rrp= datap;
592 if (cbyte+2 > max) return adns_s_invaliddata;
595 st= pap_hostaddr(pai, &cbyte, max, &rrp->ha);
598 if (cbyte != max) return adns_s_invaliddata;
602 static int di_mx(adns_state ads, const void *datap_a, const void *datap_b) {
603 const adns_rr_inthostaddr *ap= datap_a, *bp= datap_b;
605 if (ap->i < bp->i) return 0;
606 if (ap->i > bp->i) return 1;
607 return dip_hostaddr(ads, &ap->ha, &bp->ha);
611 * _inthostaddr (mf,cs)
614 static void mf_inthostaddr(adns_query qu, void *datap) {
615 adns_rr_inthostaddr *rrp= datap;
617 mfp_hostaddr(qu,&rrp->ha);
620 static adns_status cs_inthostaddr(vbuf *vb, const void *datap) {
621 const adns_rr_inthostaddr *rrp= datap;
624 sprintf(buf,"%u ",rrp->i);
627 return csp_hostaddr(vb,&rrp->ha);
631 * _ptr (pa, +icb_ptr)
634 static void icb_ptr(adns_query parent, adns_query child) {
635 adns_answer *cans= child->answer;
636 const adns_rr_addr *queried, *found;
639 if (cans->status == adns_s_nxdomain || cans->status == adns_s_nodata) {
640 adns__query_fail(parent,adns_s_inconsistent);
642 } else if (cans->status) {
643 adns__query_fail(parent,cans->status);
647 queried= &parent->ctx.info.ptr_parent_addr;
648 for (i=0, found=cans->rrs.addr; i<cans->nrrs; i++, found++) {
649 if (queried->len == found->len &&
650 !memcmp(&queried->addr,&found->addr,queried->len)) {
651 if (!parent->children.head) adns__query_done(parent);
656 adns__query_fail(parent,adns_s_inconsistent);
659 static adns_status pa_ptr(const parseinfo *pai, int dmstart, int max, void *datap) {
660 static const char *(expectdomain[])= { DNS_INADDR_ARPA };
669 int cbyte, i, lablen, labstart, l, id;
674 st= pap_domain(pai, &cbyte, max, rrp,
675 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
677 if (cbyte != max) return adns_s_invaliddata;
679 ap= &pai->qu->ctx.info.ptr_parent_addr;
681 adns__findlabel_start(&fls, pai->ads, -1, pai->qu,
682 pai->qu->query_dgram, pai->qu->query_dglen,
683 pai->qu->query_dglen, DNS_HDRSIZE, 0);
684 for (i=0; i<4; i++) {
685 st= adns__findlabel_next(&fls,&lablen,&labstart); assert(!st);
686 if (lablen<=0 || lablen>3) return adns_s_querydomainwrong;
687 memcpy(labbuf, pai->qu->query_dgram + labstart, lablen); labbuf[lablen]= 0;
688 ipv[3-i]= strtoul(labbuf,&ep,10); if (*ep) return adns_s_querydomainwrong;
689 if (lablen>1 && pai->qu->query_dgram[labstart]=='0')
690 return adns_s_querydomainwrong;
692 for (i=0; i<sizeof(expectdomain)/sizeof(*expectdomain); i++) {
693 st= adns__findlabel_next(&fls,&lablen,&labstart); assert(!st);
694 l= strlen(expectdomain[i]);
695 if (lablen != l || memcmp(pai->qu->query_dgram + labstart, expectdomain[i], l))
696 return adns_s_querydomainwrong;
698 st= adns__findlabel_next(&fls,&lablen,0); assert(!st);
699 if (lablen) return adns_s_querydomainwrong;
701 ap->len= sizeof(struct sockaddr_in);
702 memset(&ap->addr,0,sizeof(ap->addr.inet));
703 ap->addr.inet.sin_family= AF_INET;
704 ap->addr.inet.sin_addr.s_addr=
705 htonl((ipv[0]<<24) | (ipv[1]<<16) | (ipv[2]<<8) | (ipv[3]));
708 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
709 pai->dgram, pai->dglen, dmstart,
710 adns_r_addr, adns_qf_quoteok_query);
714 ctx.callback= icb_ptr;
715 memset(&ctx.info,0,sizeof(ctx.info));
716 st= adns__internal_submit(pai->ads, &nqu, adns__findtype(adns_r_addr),
718 adns_qf_quoteok_query, pai->now, &ctx);
721 nqu->parent= pai->qu;
722 LIST_LINK_TAIL_PART(pai->qu->children,nqu,siblings.);
731 static void mf_strpair(adns_query qu, void *datap) {
732 adns_rr_strpair *rrp= datap;
734 adns__makefinal_str(qu,&rrp->array[0]);
735 adns__makefinal_str(qu,&rrp->array[1]);
738 static adns_status cs_strpair(vbuf *vb, const void *datap) {
739 const adns_rr_strpair *rrp= datap;
742 st= csp_qstring(vb,rrp->array[0]); if (st) return st;
744 st= csp_qstring(vb,rrp->array[1]); if (st) return st;
750 * _intstrpair (mf,cs)
753 static void mf_intstrpair(adns_query qu, void *datap) {
754 adns_rr_intstrpair *rrp= datap;
756 adns__makefinal_str(qu,&rrp->array[0].str);
757 adns__makefinal_str(qu,&rrp->array[1].str);
760 static adns_status cs_intstrpair(vbuf *vb, const void *datap) {
761 const adns_rr_intstrpair *rrp= datap;
764 st= csp_intstr(vb,&rrp->array[0]); if (st) return st;
766 st= csp_intstr(vb,&rrp->array[1]); if (st) return st;
775 static adns_status pa_hinfo(const parseinfo *pai, int cbyte, int max, void *datap) {
776 adns_rr_intstrpair *rrp= datap;
780 for (i=0; i<2; i++) {
781 st= pap_string(pai, &cbyte, max, &rrp->array[i].i, &rrp->array[i].str);
785 if (cbyte != max) return adns_s_invaliddata;
794 static adns_status pap_mailbox822(const parseinfo *pai, int *cbyte_io, int max,
796 int lablen, labstart, i, needquote, c, r, neednorm;
797 const unsigned char *p;
805 adns__findlabel_start(&fls, pai->ads,
807 pai->dgram, pai->dglen, max,
808 *cbyte_io, cbyte_io);
809 st= adns__findlabel_next(&fls,&lablen,&labstart);
811 adns__vbuf_appendstr(vb,"<>");
816 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++) {
818 if ((c&~128) < 32 || (c&~128) == 127) return adns_s_invaliddata;
819 if (c == '.' && !neednorm) neednorm= 1;
820 else if (strchr("()<>@,;:\\\".[]",c)) needquote++;
824 if (needquote || neednorm) {
825 r= adns__vbuf_ensure(vb, lablen+needquote+4); if (!r) R_NOMEM;
826 adns__vbuf_appendq(vb,"\"",1);
827 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++, p++) {
829 if (strchr("()<>@,;:\\\".[]",c)) adns__vbuf_appendq(vb,"\\",1);
830 adns__vbuf_appendq(vb,p,1);
832 adns__vbuf_appendq(vb,"\"",1);
834 r= adns__vbuf_append(vb, pai->dgram+labstart, lablen); if (!r) R_NOMEM;
837 r= adns__vbuf_appendstr(vb,"@"); if (!r) R_NOMEM;
839 st= adns__parse_domain_more(&fls,pai->ads, pai->qu,vb,0, pai->dgram);
843 str= adns__alloc_interim(pai->qu, vb->used+1); if (!str) R_NOMEM;
844 memcpy(str,vb->buf,vb->used);
850 static adns_status pap_mailbox(const parseinfo *pai, int *cbyte_io, int max,
852 if (pai->qu->typei->type & adns__qtf_mail822) {
853 return pap_mailbox822(pai, cbyte_io, max, mb_r);
855 return pap_domain(pai, cbyte_io, max, mb_r,
856 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
864 static adns_status pa_rp(const parseinfo *pai, int cbyte, int max, void *datap) {
865 adns_rr_strpair *rrp= datap;
868 st= pap_mailbox(pai, &cbyte, max, &rrp->array[0]);
871 st= pap_domain(pai, &cbyte, max, &rrp->array[1], pdf_quoteok);
874 if (cbyte != max) return adns_s_invaliddata;
882 static adns_status pa_soa(const parseinfo *pai, int cbyte, int max, void *datap) {
883 adns_rr_soa *rrp= datap;
884 const byte *dgram= pai->dgram;
888 st= pap_domain(pai, &cbyte, max, &rrp->mname,
889 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
892 st= pap_mailbox(pai, &cbyte, max, &rrp->rname);
895 if (cbyte+20 != max) return adns_s_invaliddata;
897 for (i=0; i<5; i++) {
900 (&rrp->serial)[i]= (msw<<16) | lsw;
906 static void mf_soa(adns_query qu, void *datap) {
907 adns_rr_soa *rrp= datap;
909 adns__makefinal_str(qu,&rrp->mname);
910 adns__makefinal_str(qu,&rrp->rname);
913 static adns_status cs_soa(vbuf *vb, const void *datap) {
914 const adns_rr_soa *rrp= datap;
919 st= csp_qstring(vb,rrp->mname); if (st) return st;
921 st= csp_qstring(vb,rrp->rname); if (st) return st;
923 for (i=0; i<5; i++) {
924 sprintf(buf," %lu",(&rrp->serial)[i]);
935 static void mf_flat(adns_query qu, void *data) { }
941 #define TYPESZ_M(member) (sizeof(*((adns_answer*)0)->rrs.member))
943 #define DEEP_MEMB(memb) TYPESZ_M(memb), mf_##memb, cs_##memb
944 #define FLAT_MEMB(memb) TYPESZ_M(memb), mf_flat, cs_##memb
946 #define DEEP_TYPE(code,rrt,fmt,memb,parser,comparer) \
947 { adns_r_##code, rrt, fmt, TYPESZ_M(memb), mf_##memb, cs_##memb, parser, comparer }
948 #define FLAT_TYPE(code,rrt,fmt,memb,parser,comparer) \
949 { adns_r_##code, rrt, fmt, TYPESZ_M(memb), mf_flat, cs_##memb, parser, comparer }
951 static const typeinfo typeinfos[] = {
952 /* Must be in ascending order of rrtype ! */
953 /* mem-mgmt code rrt fmt member parser comparer */
955 FLAT_TYPE(a, "A", 0, inaddr, pa_inaddr, di_inaddr ),
956 DEEP_TYPE(ns_raw, "NS", "raw", str, pa_host_raw, 0 ),
957 DEEP_TYPE(cname, "CNAME", 0, str, pa_host_raw, 0 ),
958 DEEP_TYPE(soa_raw, "SOA", "raw", soa, pa_soa, 0 ),
959 DEEP_TYPE(ptr_raw, "PTR", "raw", str, pa_host_raw, 0 ),
960 DEEP_TYPE(hinfo, "HINFO", 0, intstrpair, pa_hinfo, 0 ),
961 DEEP_TYPE(mx_raw, "MX", "raw", intstr, pa_mx_raw, di_mx_raw ),
962 DEEP_TYPE(txt, "TXT", 0, manyistr, pa_txt, 0 ),
963 DEEP_TYPE(rp_raw, "RP", "raw", strpair, pa_rp, 0 ),
965 FLAT_TYPE(addr, "A", "addr", addr, pa_addr, di_addr ),
966 DEEP_TYPE(ns, "NS", "+addr", hostaddr, pa_hostaddr, di_hostaddr ),
967 DEEP_TYPE(ptr, "PTR","checked", str, pa_ptr, 0 ),
968 DEEP_TYPE(mx, "MX", "+addr", inthostaddr, pa_mx, di_mx ),
970 DEEP_TYPE(soa, "SOA","822", soa, pa_soa, 0 ),
971 DEEP_TYPE(rp, "RP", "822", strpair, pa_rp, 0 ),
974 const typeinfo *adns__findtype(adns_rrtype type) {
975 const typeinfo *begin, *end, *mid;
977 begin= typeinfos; end= typeinfos+(sizeof(typeinfos)/sizeof(typeinfo));
979 while (begin < end) {
980 mid= begin + ((end-begin)>>1);
981 if (mid->type == type) return mid;
982 if (type > mid->type) begin= mid+1;