3 * - RR-type-specific code, and the machinery to call it
7 * Copyright (C) 1997-1999 Ian Jackson <ian@davenant.greenend.org.uk>
9 * It is part of adns, which is
10 * Copyright (C) 1997-1999 Ian Jackson <ian@davenant.greenend.org.uk>
11 * Copyright (C) 1999 Tony Finch <dot@dotat.at>
13 * This program is free software; you can redistribute it and/or modify
14 * it under the terms of the GNU General Public License as published by
15 * the Free Software Foundation; either version 2, or (at your option)
18 * This program is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 * GNU General Public License for more details.
23 * You should have received a copy of the GNU General Public License
24 * along with this program; if not, write to the Free Software Foundation,
25 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
30 #include <sys/types.h>
31 #include <sys/socket.h>
32 #include <netinet/in.h>
33 #include <arpa/inet.h>
37 #define R_NOMEM return adns_s_nomemory
38 #define CSP_ADDSTR(s) do { if (!adns__vbuf_appendstr(vb,(s))) R_NOMEM; } while (0)
44 * _textdata, _qstring (csp)
50 * _addr (pa,di,csp,cs)
53 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +pap_findaddrs)
56 * _inthostaddr (mf,cs)
61 * _mailbox (pap +pap_mailbox822)
66 * within each section:
81 static adns_status
pap_qstring(const parseinfo
*pai
, int *cbyte_io
, int max
,
82 int *len_r
, char **str_r
) {
83 /* Neither len_r nor str_r may be null.
84 * End of datagram (overrun) is indicated by returning adns_s_invaliddata;
86 const byte
*dgram
= pai
->dgram
;
92 if (cbyte
>= max
) return adns_s_invaliddata
;
94 if (cbyte
+l
> max
) return adns_s_invaliddata
;
96 str
= adns__alloc_interim(pai
->qu
, l
+1);
100 memcpy(str
,dgram
+cbyte
,l
);
109 static adns_status
csp_qstring(vbuf
*vb
, const char *dp
, int len
) {
115 for (cn
=0; cn
<len
; cn
++) {
119 } else if (ch
== '"') {
121 } else if (ch
>= 32 && ch
<= 126) {
122 if (!adns__vbuf_append(vb
,&ch
,1)) R_NOMEM
;
124 sprintf(buf
,"\\x%02x",ch
);
137 static void mf_str(adns_query qu
, void *datap
) {
140 adns__makefinal_str(qu
,rrp
);
147 static void mf_intstr(adns_query qu
, void *datap
) {
148 adns_rr_intstr
*rrp
= datap
;
150 adns__makefinal_str(qu
,&rrp
->str
);
157 static void mf_manyistr(adns_query qu
, void *datap
) {
158 adns_rr_intstr
**rrp
= datap
;
159 adns_rr_intstr
*te
, *table
;
163 for (tc
=0, te
= *rrp
; te
->i
>= 0; te
++, tc
++);
165 adns__makefinal_block(qu
,&tablev
,sizeof(*te
)*(tc
+1));
167 for (te
= *rrp
; te
->i
>= 0; te
++)
168 adns__makefinal_str(qu
,&te
->str
);
175 static adns_status
pa_txt(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
176 adns_rr_intstr
**rrp
= datap
, *table
, *te
;
177 const byte
*dgram
= pai
->dgram
;
178 int ti
, tc
, l
, startbyte
;
182 if (cbyte
>= max
) return adns_s_invaliddata
;
184 while (cbyte
< max
) {
189 if (cbyte
!= max
|| !tc
) return adns_s_invaliddata
;
191 table
= adns__alloc_interim(pai
->qu
,sizeof(*table
)*(tc
+1));
194 for (cbyte
=startbyte
, ti
=0, te
=table
; ti
<tc
; ti
++, te
++) {
195 st
= pap_qstring(pai
, &cbyte
, max
, &te
->i
, &te
->str
);
198 assert(cbyte
== max
);
207 static adns_status
cs_txt(vbuf
*vb
, const void *datap
) {
208 const adns_rr_intstr
*const *rrp
= datap
;
209 const adns_rr_intstr
*current
;
213 for (current
= *rrp
, spc
=0; current
->i
>= 0; current
++, spc
=1) {
214 if (spc
) CSP_ADDSTR(" ");
215 st
= csp_qstring(vb
,current
->str
,current
->i
); if (st
) return st
;
224 static adns_status
cs_hinfo(vbuf
*vb
, const void *datap
) {
225 const adns_rr_intstrpair
*rrp
= datap
;
228 st
= csp_qstring(vb
,rrp
->array
[0].str
,rrp
->array
[0].i
); if (st
) return st
;
230 st
= csp_qstring(vb
,rrp
->array
[1].str
,rrp
->array
[1].i
); if (st
) return st
;
235 * _inaddr (pa,dip,di)
238 static adns_status
pa_inaddr(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
239 struct in_addr
*storeto
= datap
;
241 if (max
-cbyte
!= 4) return adns_s_invaliddata
;
242 memcpy(storeto
, pai
->dgram
+ cbyte
, 4);
246 static int search_sortlist(adns_state ads
, struct in_addr ad
) {
247 const struct sortlist
*slp
;
250 for (i
=0, slp
=ads
->sortlist
;
251 i
<ads
->nsortlist
&& !((ad
.s_addr
& slp
->mask
.s_addr
) == slp
->base
.s_addr
);
256 static int dip_inaddr(adns_state ads
, struct in_addr a
, struct in_addr b
) {
259 if (!ads
->nsortlist
) return 0;
261 ai
= search_sortlist(ads
,a
);
262 bi
= search_sortlist(ads
,b
);
266 static int di_inaddr(adns_state ads
, const void *datap_a
, const void *datap_b
) {
267 const struct in_addr
*ap
= datap_a
, *bp
= datap_b
;
269 return dip_inaddr(ads
,*ap
,*bp
);
272 static adns_status
cs_inaddr(vbuf
*vb
, const void *datap
) {
273 const struct in_addr
*rrp
= datap
, rr
= *rrp
;
276 ia
= inet_ntoa(rr
); assert(ia
);
282 * _addr (pa,di,csp,cs)
285 static adns_status
pa_addr(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
286 adns_rr_addr
*storeto
= datap
;
287 const byte
*dgram
= pai
->dgram
;
289 if (max
-cbyte
!= 4) return adns_s_invaliddata
;
290 storeto
->len
= sizeof(storeto
->addr
.inet
);
291 memset(&storeto
->addr
,0,sizeof(storeto
->addr
.inet
));
292 storeto
->addr
.inet
.sin_family
= AF_INET
;
293 memcpy(&storeto
->addr
.inet
.sin_addr
,dgram
+cbyte
,4);
297 static int di_addr(adns_state ads
, const void *datap_a
, const void *datap_b
) {
298 const adns_rr_addr
*ap
= datap_a
, *bp
= datap_b
;
300 assert(ap
->addr
.sa
.sa_family
== AF_INET
);
301 return dip_inaddr(ads
, ap
->addr
.inet
.sin_addr
, bp
->addr
.inet
.sin_addr
);
304 static int div_addr(void *context
, const void *datap_a
, const void *datap_b
) {
305 const adns_state ads
= context
;
307 return di_addr(ads
, datap_a
, datap_b
);
310 static adns_status
csp_addr(vbuf
*vb
, const adns_rr_addr
*rrp
) {
314 switch (rrp
->addr
.inet
.sin_family
) {
317 ia
= inet_ntoa(rrp
->addr
.inet
.sin_addr
); assert(ia
);
321 sprintf(buf
,"AF=%u",rrp
->addr
.sa
.sa_family
);
328 static adns_status
cs_addr(vbuf
*vb
, const void *datap
) {
329 const adns_rr_addr
*rrp
= datap
;
331 return csp_addr(vb
,rrp
);
335 * _domain (pap,csp,cs)
339 static adns_status
pap_domain(const parseinfo
*pai
, int *cbyte_io
, int max
,
340 char **domain_r
, parsedomain_flags flags
) {
344 st
= adns__parse_domain(pai
->qu
->ads
, pai
->serv
, pai
->qu
, &pai
->qu
->vb
, flags
,
345 pai
->dgram
,pai
->dglen
, cbyte_io
, max
);
347 if (!pai
->qu
->vb
.used
) return adns_s_invaliddata
;
349 dm
= adns__alloc_interim(pai
->qu
, pai
->qu
->vb
.used
+1);
352 dm
[pai
->qu
->vb
.used
]= 0;
353 memcpy(dm
,pai
->qu
->vb
.buf
,pai
->qu
->vb
.used
);
359 static adns_status
csp_domain(vbuf
*vb
, const char *domain
) {
361 if (!*domain
) CSP_ADDSTR(".");
365 static adns_status
cs_domain(vbuf
*vb
, const void *datap
) {
366 const char *const *domainp
= datap
;
367 return csp_domain(vb
,*domainp
);
370 static adns_status
pa_dom_raw(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
374 st
= pap_domain(pai
, &cbyte
, max
, rrp
, pdf_quoteok
);
377 if (cbyte
!= max
) return adns_s_invaliddata
;
385 static adns_status
pa_host_raw(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
389 st
= pap_domain(pai
, &cbyte
, max
, rrp
,
390 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
393 if (cbyte
!= max
) return adns_s_invaliddata
;
398 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +icb_hostaddr, pap_findaddrs)
401 static adns_status
pap_findaddrs(const parseinfo
*pai
, adns_rr_hostaddr
*ha
,
402 int *cbyte_io
, int count
, int dmstart
) {
404 int type
, class, rdlen
, rdstart
, ownermatched
;
408 for (rri
=0, naddrs
=-1; rri
<count
; rri
++) {
409 st
= adns__findrr_anychk(pai
->qu
, pai
->serv
, pai
->dgram
, pai
->dglen
, cbyte_io
,
410 &type
, &class, &ttl
, &rdlen
, &rdstart
,
411 pai
->dgram
, pai
->dglen
, dmstart
, &ownermatched
);
413 if (!ownermatched
|| class != DNS_CLASS_IN
|| type
!= adns_r_a
) {
414 if (naddrs
>0) break; else continue;
419 if (!adns__vbuf_ensure(&pai
->qu
->vb
, (naddrs
+1)*sizeof(adns_rr_addr
))) R_NOMEM
;
420 adns__update_expires(pai
->qu
,ttl
,pai
->now
);
421 st
= pa_addr(pai
, rdstart
,rdstart
+rdlen
,
422 pai
->qu
->vb
.buf
+ naddrs
*sizeof(adns_rr_addr
));
427 ha
->addrs
= adns__alloc_interim(pai
->qu
, naddrs
*sizeof(adns_rr_addr
));
428 if (!ha
->addrs
) R_NOMEM
;
429 memcpy(ha
->addrs
, pai
->qu
->vb
.buf
, naddrs
*sizeof(adns_rr_addr
));
431 ha
->astatus
= adns_s_ok
;
433 adns__isort(ha
->addrs
, naddrs
, sizeof(adns_rr_addr
), pai
->qu
->vb
.buf
,
439 static void icb_hostaddr(adns_query parent
, adns_query child
) {
440 adns_answer
*cans
= child
->answer
;
441 adns_rr_hostaddr
*rrp
= child
->ctx
.info
.hostaddr
;
442 adns_state ads
= parent
->ads
;
447 rrp
->naddrs
= (st
>0 && st
<=adns_s_max_tempfail
) ?
-1 : cans
->nrrs
;
448 rrp
->addrs
= cans
->rrs
.addr
;
449 adns__transfer_interim(child
, parent
, rrp
->addrs
, rrp
->naddrs
*sizeof(adns_rr_addr
));
451 if (parent
->children
.head
) {
452 LIST_LINK_TAIL(ads
->childw
,parent
);
454 adns__query_done(parent
);
458 static adns_status
pap_hostaddr(const parseinfo
*pai
, int *cbyte_io
,
459 int max
, adns_rr_hostaddr
*rrp
) {
465 adns_queryflags nflags
;
467 dmstart
= cbyte
= *cbyte_io
;
468 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->host
,
469 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
473 rrp
->astatus
= adns_s_ok
;
479 st
= pap_findaddrs(pai
, rrp
, &cbyte
, pai
->nscount
, dmstart
);
481 if (rrp
->naddrs
!= -1) return adns_s_ok
;
483 st
= pap_findaddrs(pai
, rrp
, &cbyte
, pai
->arcount
, dmstart
);
485 if (rrp
->naddrs
!= -1) return adns_s_ok
;
487 st
= adns__mkquery_frdgram(pai
->ads
, &pai
->qu
->vb
, &id
,
488 pai
->dgram
, pai
->dglen
, dmstart
,
489 adns_r_addr
, adns_qf_quoteok_query
);
493 ctx
.callback
= icb_hostaddr
;
494 ctx
.info
.hostaddr
= rrp
;
496 nflags
= adns_qf_quoteok_query
;
497 if (!(pai
->qu
->flags
& adns_qf_cname_loose
)) nflags
|= adns_qf_cname_forbid
;
499 st
= adns__internal_submit(pai
->ads
, &nqu
, adns__findtype(adns_r_addr
),
500 &pai
->qu
->vb
, id
, nflags
, pai
->now
, &ctx
);
503 nqu
->parent
= pai
->qu
;
504 LIST_LINK_TAIL_PART(pai
->qu
->children
,nqu
,siblings
.);
509 static adns_status
pa_hostaddr(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
510 adns_rr_hostaddr
*rrp
= datap
;
513 st
= pap_hostaddr(pai
, &cbyte
, max
, rrp
);
515 if (cbyte
!= max
) return adns_s_invaliddata
;
520 static int dip_hostaddr(adns_state ads
, const adns_rr_hostaddr
*ap
, const adns_rr_hostaddr
*bp
) {
521 if (ap
->astatus
!= bp
->astatus
) return ap
->astatus
;
522 if (ap
->astatus
) return 0;
524 assert(ap
->addrs
[0].addr
.sa
.sa_family
== AF_INET
);
525 assert(bp
->addrs
[0].addr
.sa
.sa_family
== AF_INET
);
526 return dip_inaddr(ads
,
527 ap
->addrs
[0].addr
.inet
.sin_addr
,
528 bp
->addrs
[0].addr
.inet
.sin_addr
);
531 static int di_hostaddr(adns_state ads
, const void *datap_a
, const void *datap_b
) {
532 const adns_rr_hostaddr
*ap
= datap_a
, *bp
= datap_b
;
534 return dip_hostaddr(ads
, ap
,bp
);
537 static void mfp_hostaddr(adns_query qu
, adns_rr_hostaddr
*rrp
) {
540 adns__makefinal_str(qu
,&rrp
->host
);
542 adns__makefinal_block(qu
, &tablev
, rrp
->naddrs
*sizeof(*rrp
->addrs
));
546 static void mf_hostaddr(adns_query qu
, void *datap
) {
547 adns_rr_hostaddr
*rrp
= datap
;
549 mfp_hostaddr(qu
,rrp
);
552 static adns_status
csp_hostaddr(vbuf
*vb
, const adns_rr_hostaddr
*rrp
) {
557 st
= csp_domain(vb
,rrp
->host
); if (st
) return st
;
560 CSP_ADDSTR(adns_errabbrev(rrp
->astatus
));
563 errstr
= adns_strerror(rrp
->astatus
);
564 st
= csp_qstring(vb
,errstr
,strlen(errstr
)); if (st
) return st
;
566 if (rrp
->naddrs
>= 0) {
568 for (i
=0; i
<rrp
->naddrs
; i
++) {
570 st
= csp_addr(vb
,&rrp
->addrs
[i
]);
579 static adns_status
cs_hostaddr(vbuf
*vb
, const void *datap
) {
580 const adns_rr_hostaddr
*rrp
= datap
;
582 return csp_hostaddr(vb
,rrp
);
589 static adns_status
pa_mx_raw(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
590 const byte
*dgram
= pai
->dgram
;
591 adns_rr_intstr
*rrp
= datap
;
595 if (cbyte
+2 > max
) return adns_s_invaliddata
;
598 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->str
,
599 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
602 if (cbyte
!= max
) return adns_s_invaliddata
;
606 static int di_mx_raw(adns_state ads
, const void *datap_a
, const void *datap_b
) {
607 const adns_rr_intstr
*ap
= datap_a
, *bp
= datap_b
;
609 if (ap
->i
< bp
->i
) return 0;
610 if (ap
->i
> bp
->i
) return 1;
618 static adns_status
pa_mx(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
619 const byte
*dgram
= pai
->dgram
;
620 adns_rr_inthostaddr
*rrp
= datap
;
624 if (cbyte
+2 > max
) return adns_s_invaliddata
;
627 st
= pap_hostaddr(pai
, &cbyte
, max
, &rrp
->ha
);
630 if (cbyte
!= max
) return adns_s_invaliddata
;
634 static int di_mx(adns_state ads
, const void *datap_a
, const void *datap_b
) {
635 const adns_rr_inthostaddr
*ap
= datap_a
, *bp
= datap_b
;
637 if (ap
->i
< bp
->i
) return 0;
638 if (ap
->i
> bp
->i
) return 1;
639 return dip_hostaddr(ads
, &ap
->ha
, &bp
->ha
);
643 * _inthostaddr (mf,cs)
646 static void mf_inthostaddr(adns_query qu
, void *datap
) {
647 adns_rr_inthostaddr
*rrp
= datap
;
649 mfp_hostaddr(qu
,&rrp
->ha
);
652 static adns_status
cs_inthostaddr(vbuf
*vb
, const void *datap
) {
653 const adns_rr_inthostaddr
*rrp
= datap
;
656 sprintf(buf
,"%u ",rrp
->i
);
659 return csp_hostaddr(vb
,&rrp
->ha
);
666 static adns_status
cs_inthost(vbuf
*vb
, const void *datap
) {
667 const adns_rr_intstr
*rrp
= datap
;
670 sprintf(buf
,"%u ",rrp
->i
);
672 return csp_domain(vb
,rrp
->str
);
676 * _ptr (pa, +icb_ptr)
679 static void icb_ptr(adns_query parent
, adns_query child
) {
680 adns_answer
*cans
= child
->answer
;
681 const adns_rr_addr
*queried
, *found
;
682 adns_state ads
= parent
->ads
;
685 if (cans
->status
== adns_s_nxdomain
|| cans
->status
== adns_s_nodata
) {
686 adns__query_fail(parent
,adns_s_inconsistent
);
688 } else if (cans
->status
) {
689 adns__query_fail(parent
,cans
->status
);
693 queried
= &parent
->ctx
.info
.ptr_parent_addr
;
694 for (i
=0, found
=cans
->rrs
.addr
; i
<cans
->nrrs
; i
++, found
++) {
695 if (queried
->len
== found
->len
&&
696 !memcmp(&queried
->addr
,&found
->addr
,queried
->len
)) {
697 if (!parent
->children
.head
) {
698 adns__query_done(parent
);
701 LIST_LINK_TAIL(ads
->childw
,parent
);
707 adns__query_fail(parent
,adns_s_inconsistent
);
710 static adns_status
pa_ptr(const parseinfo
*pai
, int dmstart
, int max
, void *datap
) {
711 static const char *(expectdomain
[])= { DNS_INADDR_ARPA
};
720 int cbyte
, i
, lablen
, labstart
, l
, id
;
725 st
= pap_domain(pai
, &cbyte
, max
, rrp
,
726 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
728 if (cbyte
!= max
) return adns_s_invaliddata
;
730 ap
= &pai
->qu
->ctx
.info
.ptr_parent_addr
;
732 adns__findlabel_start(&fls
, pai
->ads
, -1, pai
->qu
,
733 pai
->qu
->query_dgram
, pai
->qu
->query_dglen
,
734 pai
->qu
->query_dglen
, DNS_HDRSIZE
, 0);
735 for (i
=0; i
<4; i
++) {
736 st
= adns__findlabel_next(&fls
,&lablen
,&labstart
); assert(!st
);
737 if (lablen
<=0 || lablen
>3) return adns_s_querydomainwrong
;
738 memcpy(labbuf
, pai
->qu
->query_dgram
+ labstart
, lablen
); labbuf
[lablen
]= 0;
739 ipv
[3-i
]= strtoul(labbuf
,&ep
,10); if (*ep
) return adns_s_querydomainwrong
;
740 if (lablen
>1 && pai
->qu
->query_dgram
[labstart
]=='0')
741 return adns_s_querydomainwrong
;
743 for (i
=0; i
<sizeof(expectdomain
)/sizeof(*expectdomain
); i
++) {
744 st
= adns__findlabel_next(&fls
,&lablen
,&labstart
); assert(!st
);
745 l
= strlen(expectdomain
[i
]);
746 if (lablen
!= l
|| memcmp(pai
->qu
->query_dgram
+ labstart
, expectdomain
[i
], l
))
747 return adns_s_querydomainwrong
;
749 st
= adns__findlabel_next(&fls
,&lablen
,0); assert(!st
);
750 if (lablen
) return adns_s_querydomainwrong
;
752 ap
->len
= sizeof(struct sockaddr_in
);
753 memset(&ap
->addr
,0,sizeof(ap
->addr
.inet
));
754 ap
->addr
.inet
.sin_family
= AF_INET
;
755 ap
->addr
.inet
.sin_addr
.s_addr
=
756 htonl((ipv
[0]<<24) | (ipv
[1]<<16) | (ipv
[2]<<8) | (ipv
[3]));
759 st
= adns__mkquery_frdgram(pai
->ads
, &pai
->qu
->vb
, &id
,
760 pai
->dgram
, pai
->dglen
, dmstart
,
761 adns_r_addr
, adns_qf_quoteok_query
);
765 ctx
.callback
= icb_ptr
;
766 memset(&ctx
.info
,0,sizeof(ctx
.info
));
767 st
= adns__internal_submit(pai
->ads
, &nqu
, adns__findtype(adns_r_addr
),
769 adns_qf_quoteok_query
, pai
->now
, &ctx
);
772 nqu
->parent
= pai
->qu
;
773 LIST_LINK_TAIL_PART(pai
->qu
->children
,nqu
,siblings
.);
781 static void mf_strpair(adns_query qu
, void *datap
) {
782 adns_rr_strpair
*rrp
= datap
;
784 adns__makefinal_str(qu
,&rrp
->array
[0]);
785 adns__makefinal_str(qu
,&rrp
->array
[1]);
792 static void mf_intstrpair(adns_query qu
, void *datap
) {
793 adns_rr_intstrpair
*rrp
= datap
;
795 adns__makefinal_str(qu
,&rrp
->array
[0].str
);
796 adns__makefinal_str(qu
,&rrp
->array
[1].str
);
803 static adns_status
pa_hinfo(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
804 adns_rr_intstrpair
*rrp
= datap
;
808 for (i
=0; i
<2; i
++) {
809 st
= pap_qstring(pai
, &cbyte
, max
, &rrp
->array
[i
].i
, &rrp
->array
[i
].str
);
813 if (cbyte
!= max
) return adns_s_invaliddata
;
822 static adns_status
pap_mailbox822(const parseinfo
*pai
, int *cbyte_io
, int max
,
824 int lablen
, labstart
, i
, needquote
, c
, r
, neednorm
;
825 const unsigned char *p
;
833 adns__findlabel_start(&fls
, pai
->ads
,
835 pai
->dgram
, pai
->dglen
, max
,
836 *cbyte_io
, cbyte_io
);
837 st
= adns__findlabel_next(&fls
,&lablen
,&labstart
);
839 adns__vbuf_appendstr(vb
,".");
844 for (i
=0, needquote
=0, p
= pai
->dgram
+labstart
; i
<lablen
; i
++) {
846 if ((c
&~128) < 32 || (c
&~128) == 127) return adns_s_invaliddata
;
847 if (c
== '.' && !neednorm
) neednorm
= 1;
848 else if (c
==' ' || ctype_822special(c
)) needquote
++;
852 if (needquote
|| neednorm
) {
853 r
= adns__vbuf_ensure(vb
, lablen
+needquote
+4); if (!r
) R_NOMEM
;
854 adns__vbuf_appendq(vb
,"\"",1);
855 for (i
=0, needquote
=0, p
= pai
->dgram
+labstart
; i
<lablen
; i
++, p
++) {
857 if (c
== '"' || c
=='\\') adns__vbuf_appendq(vb
,"\\",1);
858 adns__vbuf_appendq(vb
,p
,1);
860 adns__vbuf_appendq(vb
,"\"",1);
862 r
= adns__vbuf_append(vb
, pai
->dgram
+labstart
, lablen
); if (!r
) R_NOMEM
;
865 r
= adns__vbuf_appendstr(vb
,"@"); if (!r
) R_NOMEM
;
867 st
= adns__parse_domain_more(&fls
,pai
->ads
, pai
->qu
,vb
,0, pai
->dgram
);
871 str
= adns__alloc_interim(pai
->qu
, vb
->used
+1); if (!str
) R_NOMEM
;
872 memcpy(str
,vb
->buf
,vb
->used
);
878 static adns_status
pap_mailbox(const parseinfo
*pai
, int *cbyte_io
, int max
,
880 if (pai
->qu
->typei
->type
& adns__qtf_mail822
) {
881 return pap_mailbox822(pai
, cbyte_io
, max
, mb_r
);
883 return pap_domain(pai
, cbyte_io
, max
, mb_r
, pdf_quoteok
);
887 static adns_status
csp_mailbox(vbuf
*vb
, const char *mailbox
) {
888 return csp_domain(vb
,mailbox
);
895 static adns_status
pa_rp(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
896 adns_rr_strpair
*rrp
= datap
;
899 st
= pap_mailbox(pai
, &cbyte
, max
, &rrp
->array
[0]);
902 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->array
[1], pdf_quoteok
);
905 if (cbyte
!= max
) return adns_s_invaliddata
;
909 static adns_status
cs_rp(vbuf
*vb
, const void *datap
) {
910 const adns_rr_strpair
*rrp
= datap
;
913 st
= csp_mailbox(vb
,rrp
->array
[0]); if (st
) return st
;
915 st
= csp_domain(vb
,rrp
->array
[1]); if (st
) return st
;
924 static adns_status
pa_soa(const parseinfo
*pai
, int cbyte
, int max
, void *datap
) {
925 adns_rr_soa
*rrp
= datap
;
926 const byte
*dgram
= pai
->dgram
;
930 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->mname
,
931 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
934 st
= pap_mailbox(pai
, &cbyte
, max
, &rrp
->rname
);
937 if (cbyte
+20 != max
) return adns_s_invaliddata
;
939 for (i
=0; i
<5; i
++) {
942 (&rrp
->serial
)[i
]= (msw
<<16) | lsw
;
948 static void mf_soa(adns_query qu
, void *datap
) {
949 adns_rr_soa
*rrp
= datap
;
951 adns__makefinal_str(qu
,&rrp
->mname
);
952 adns__makefinal_str(qu
,&rrp
->rname
);
955 static adns_status
cs_soa(vbuf
*vb
, const void *datap
) {
956 const adns_rr_soa
*rrp
= datap
;
961 st
= csp_domain(vb
,rrp
->mname
); if (st
) return st
;
963 st
= csp_mailbox(vb
,rrp
->rname
); if (st
) return st
;
965 for (i
=0; i
<5; i
++) {
966 sprintf(buf
," %lu",(&rrp
->serial
)[i
]);
977 static void mf_flat(adns_query qu
, void *data
) { }
983 #define TYPESZ_M(member) (sizeof(*((adns_answer*)0)->rrs.member))
985 #define DEEP_MEMB(memb) TYPESZ_M(memb), mf_##memb, cs_##memb
986 #define FLAT_MEMB(memb) TYPESZ_M(memb), mf_flat, cs_##memb
988 #define DEEP_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
989 { adns_r_##code, rrt, fmt, TYPESZ_M(memb), mf_##memb, printer, parser, comparer }
990 #define FLAT_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
991 { adns_r_##code, rrt, fmt, TYPESZ_M(memb), mf_flat, printer, parser, comparer }
993 static const typeinfo typeinfos
[] = {
994 /* Must be in ascending order of rrtype ! */
995 /* mem-mgmt code rrt fmt member parser comparer printer */
997 FLAT_TYPE(a
, "A", 0, inaddr
, pa_inaddr
, di_inaddr
, cs_inaddr
),
998 DEEP_TYPE(ns_raw
, "NS", "raw", str
, pa_host_raw
,0, cs_domain
),
999 DEEP_TYPE(cname
, "CNAME", 0, str
, pa_dom_raw
, 0, cs_domain
),
1000 DEEP_TYPE(soa_raw
,"SOA", "raw", soa
, pa_soa
, 0, cs_soa
),
1001 DEEP_TYPE(ptr_raw
,"PTR", "raw", str
, pa_host_raw
,0, cs_domain
),
1002 DEEP_TYPE(hinfo
, "HINFO", 0, intstrpair
, pa_hinfo
, 0, cs_hinfo
),
1003 DEEP_TYPE(mx_raw
, "MX", "raw", intstr
, pa_mx_raw
, di_mx_raw
, cs_inthost
),
1004 DEEP_TYPE(txt
, "TXT", 0, manyistr
, pa_txt
, 0, cs_txt
),
1005 DEEP_TYPE(rp_raw
, "RP", "raw", strpair
, pa_rp
, 0, cs_rp
),
1007 FLAT_TYPE(addr
, "A", "addr", addr
, pa_addr
, di_addr
, cs_addr
),
1008 DEEP_TYPE(ns
, "NS", "+addr", hostaddr
, pa_hostaddr
,di_hostaddr
,cs_hostaddr
),
1009 DEEP_TYPE(ptr
, "PTR","checked",str
, pa_ptr
, 0, cs_domain
),
1010 DEEP_TYPE(mx
, "MX", "+addr", inthostaddr
,pa_mx
, di_mx
, cs_inthostaddr
),
1012 DEEP_TYPE(soa
, "SOA","822", soa
, pa_soa
, 0, cs_soa
),
1013 DEEP_TYPE(rp
, "RP", "822", strpair
, pa_rp
, 0, cs_rp
),
1016 const typeinfo
*adns__findtype(adns_rrtype type
) {
1017 const typeinfo
*begin
, *end
, *mid
;
1019 begin
= typeinfos
; end
= typeinfos
+(sizeof(typeinfos
)/sizeof(typeinfo
));
1021 while (begin
< end
) {
1022 mid
= begin
+ ((end
-begin
)>>1);
1023 if (mid
->type
== type
) return mid
;
1024 if (type
> mid
->type
) begin
= mid
+1;