3 * - RR-type-specific code, and the machinery to call it
6 * This file is part of adns, which is
7 * Copyright (C) 1997-2000,2003,2006 Ian Jackson
8 * Copyright (C) 1999-2000,2003,2006 Tony Finch
9 * Copyright (C) 1991 Massachusetts Institute of Technology
10 * (See the file INSTALL for full details.)
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2, or (at your option)
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software Foundation,
24 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 #include <sys/types.h>
30 #include <sys/socket.h>
31 #include <netinet/in.h>
32 #include <arpa/inet.h>
36 #define R_NOMEM return adns_s_nomemory
37 #define CSP_ADDSTR(s) do { \
38 if (!adns__vbuf_appendstr(vb,(s))) R_NOMEM; \
45 * _textdata, _qstring (csp)
50 * _inaddr (pa,dip,di,cs +search_sortlist)
51 * _addr (pa,di,div,csp,cs)
52 * _domain (pap,csp,cs)
55 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs
56 * +pap_findaddrs, icb_hostaddr)
59 * _inthostaddr (mf,cs)
61 * _ptr (ckl,pa +icb_ptr)
65 * _mailbox (pap,csp +pap_mailbox822)
68 * _srv* (ckl,(pap),pa*2,mf*2,di,(csp),cs*2,postsort)
73 * within each section:
90 static adns_status
pap_qstring(const parseinfo
*pai
, int *cbyte_io
, int max
,
91 int *len_r
, char **str_r
) {
92 /* Neither len_r nor str_r may be null.
93 * End of datagram (overrun) is indicated by returning adns_s_invaliddata;
95 const byte
*dgram
= pai
->dgram
;
101 if (cbyte
>= max
) return adns_s_invaliddata
;
103 if (cbyte
+l
> max
) return adns_s_invaliddata
;
105 str
= adns__alloc_interim(pai
->qu
, l
+1);
109 memcpy(str
,dgram
+cbyte
,l
);
118 static adns_status
csp_qstring(vbuf
*vb
, const char *dp
, int len
) {
124 for (cn
=0; cn
<len
; cn
++) {
128 } else if (ch
== '"') {
130 } else if (ch
>= 32 && ch
<= 126) {
131 if (!adns__vbuf_append(vb
,&ch
,1)) R_NOMEM
;
133 sprintf(buf
,"\\x%02x",ch
);
146 static void mf_str(adns_query qu
, void *datap
) {
149 adns__makefinal_str(qu
,rrp
);
156 static void mf_intstr(adns_query qu
, void *datap
) {
157 adns_rr_intstr
*rrp
= datap
;
159 adns__makefinal_str(qu
,&rrp
->str
);
166 static void mf_manyistr(adns_query qu
, void *datap
) {
167 adns_rr_intstr
**rrp
= datap
;
168 adns_rr_intstr
*te
, *table
;
172 for (tc
=0, te
= *rrp
; te
->i
>= 0; te
++, tc
++);
174 adns__makefinal_block(qu
,&tablev
,sizeof(*te
)*(tc
+1));
176 for (te
= *rrp
; te
->i
>= 0; te
++)
177 adns__makefinal_str(qu
,&te
->str
);
184 static adns_status
pa_txt(const parseinfo
*pai
, int cbyte
,
185 int max
, void *datap
) {
186 adns_rr_intstr
**rrp
= datap
, *table
, *te
;
187 const byte
*dgram
= pai
->dgram
;
188 int ti
, tc
, l
, startbyte
;
192 if (cbyte
>= max
) return adns_s_invaliddata
;
194 while (cbyte
< max
) {
199 if (cbyte
!= max
|| !tc
) return adns_s_invaliddata
;
201 table
= adns__alloc_interim(pai
->qu
,sizeof(*table
)*(tc
+1));
204 for (cbyte
=startbyte
, ti
=0, te
=table
; ti
<tc
; ti
++, te
++) {
205 st
= pap_qstring(pai
, &cbyte
, max
, &te
->i
, &te
->str
);
208 assert(cbyte
== max
);
217 static adns_status
cs_txt(vbuf
*vb
, const void *datap
) {
218 const adns_rr_intstr
*const *rrp
= datap
;
219 const adns_rr_intstr
*current
;
223 for (current
= *rrp
, spc
=0; current
->i
>= 0; current
++, spc
=1) {
224 if (spc
) CSP_ADDSTR(" ");
225 st
= csp_qstring(vb
,current
->str
,current
->i
); if (st
) return st
;
234 static adns_status
cs_hinfo(vbuf
*vb
, const void *datap
) {
235 const adns_rr_intstrpair
*rrp
= datap
;
238 st
= csp_qstring(vb
,rrp
->array
[0].str
,rrp
->array
[0].i
); if (st
) return st
;
240 st
= csp_qstring(vb
,rrp
->array
[1].str
,rrp
->array
[1].i
); if (st
) return st
;
245 * _inaddr (pa,dip,di,cs +search_sortlist)
248 static adns_status
pa_inaddr(const parseinfo
*pai
, int cbyte
,
249 int max
, void *datap
) {
250 struct in_addr
*storeto
= datap
;
252 if (max
-cbyte
!= 4) return adns_s_invaliddata
;
253 memcpy(storeto
, pai
->dgram
+ cbyte
, 4);
257 static int search_sortlist(adns_state ads
, struct in_addr ad
) {
258 const struct sortlist
*slp
;
261 for (i
=0, slp
=ads
->sortlist
;
263 !((ad
.s_addr
& slp
->mask
.s_addr
) == slp
->base
.s_addr
);
268 static int dip_inaddr(adns_state ads
, struct in_addr a
, struct in_addr b
) {
271 if (!ads
->nsortlist
) return 0;
273 ai
= search_sortlist(ads
,a
);
274 bi
= search_sortlist(ads
,b
);
278 static int di_inaddr(adns_state ads
,
279 const void *datap_a
, const void *datap_b
) {
280 const struct in_addr
*ap
= datap_a
, *bp
= datap_b
;
282 return dip_inaddr(ads
,*ap
,*bp
);
285 static adns_status
cs_inaddr(vbuf
*vb
, const void *datap
) {
286 const struct in_addr
*rrp
= datap
, rr
= *rrp
;
289 ia
= inet_ntoa(rr
); assert(ia
);
295 * _addr (pa,di,div,csp,cs)
298 static adns_status
pa_addr(const parseinfo
*pai
, int cbyte
,
299 int max
, void *datap
) {
300 adns_rr_addr
*storeto
= datap
;
301 const byte
*dgram
= pai
->dgram
;
303 if (max
-cbyte
!= 4) return adns_s_invaliddata
;
304 storeto
->len
= sizeof(storeto
->addr
.inet
);
305 memset(&storeto
->addr
,0,sizeof(storeto
->addr
.inet
));
306 storeto
->addr
.inet
.sin_family
= AF_INET
;
307 memcpy(&storeto
->addr
.inet
.sin_addr
,dgram
+cbyte
,4);
311 static int di_addr(adns_state ads
, const void *datap_a
, const void *datap_b
) {
312 const adns_rr_addr
*ap
= datap_a
, *bp
= datap_b
;
314 assert(ap
->addr
.sa
.sa_family
== AF_INET
);
315 return dip_inaddr(ads
, ap
->addr
.inet
.sin_addr
, bp
->addr
.inet
.sin_addr
);
318 static int div_addr(void *context
, const void *datap_a
, const void *datap_b
) {
319 const adns_state ads
= context
;
321 return di_addr(ads
, datap_a
, datap_b
);
324 static adns_status
csp_addr(vbuf
*vb
, const adns_rr_addr
*rrp
) {
328 switch (rrp
->addr
.inet
.sin_family
) {
331 ia
= inet_ntoa(rrp
->addr
.inet
.sin_addr
); assert(ia
);
335 sprintf(buf
,"AF=%u",rrp
->addr
.sa
.sa_family
);
342 static adns_status
cs_addr(vbuf
*vb
, const void *datap
) {
343 const adns_rr_addr
*rrp
= datap
;
345 return csp_addr(vb
,rrp
);
349 * _domain (pap,csp,cs)
353 static adns_status
pap_domain(const parseinfo
*pai
, int *cbyte_io
, int max
,
354 char **domain_r
, parsedomain_flags flags
) {
358 st
= adns__parse_domain(pai
->qu
->ads
, pai
->serv
, pai
->qu
, &pai
->qu
->vb
, flags
,
359 pai
->dgram
,pai
->dglen
, cbyte_io
, max
);
361 if (!pai
->qu
->vb
.used
) return adns_s_invaliddata
;
363 dm
= adns__alloc_interim(pai
->qu
, pai
->qu
->vb
.used
+1);
366 dm
[pai
->qu
->vb
.used
]= 0;
367 memcpy(dm
,pai
->qu
->vb
.buf
,pai
->qu
->vb
.used
);
373 static adns_status
csp_domain(vbuf
*vb
, const char *domain
) {
375 if (!*domain
) CSP_ADDSTR(".");
379 static adns_status
cs_domain(vbuf
*vb
, const void *datap
) {
380 const char *const *domainp
= datap
;
381 return csp_domain(vb
,*domainp
);
384 static adns_status
pa_dom_raw(const parseinfo
*pai
, int cbyte
,
385 int max
, void *datap
) {
389 st
= pap_domain(pai
, &cbyte
, max
, rrp
, pdf_quoteok
);
392 if (cbyte
!= max
) return adns_s_invaliddata
;
400 static adns_status
pa_host_raw(const parseinfo
*pai
, int cbyte
,
401 int max
, void *datap
) {
405 st
= pap_domain(pai
, &cbyte
, max
, rrp
,
406 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
409 if (cbyte
!= max
) return adns_s_invaliddata
;
414 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +pap_findaddrs, icb_hostaddr)
417 static adns_status
pap_findaddrs(const parseinfo
*pai
, adns_rr_hostaddr
*ha
,
418 int *cbyte_io
, int count
, int dmstart
) {
420 int type
, class, rdlen
, rdstart
, ownermatched
;
424 for (rri
=0, naddrs
=-1; rri
<count
; rri
++) {
425 st
= adns__findrr_anychk(pai
->qu
, pai
->serv
, pai
->dgram
,
426 pai
->dglen
, cbyte_io
,
427 &type
, &class, &ttl
, &rdlen
, &rdstart
,
428 pai
->dgram
, pai
->dglen
, dmstart
, &ownermatched
);
430 if (!ownermatched
|| class != DNS_CLASS_IN
|| type
!= adns_r_a
) {
431 if (naddrs
>0) break; else continue;
436 if (!adns__vbuf_ensure(&pai
->qu
->vb
, (naddrs
+1)*sizeof(adns_rr_addr
)))
438 adns__update_expires(pai
->qu
,ttl
,pai
->now
);
439 st
= pa_addr(pai
, rdstart
,rdstart
+rdlen
,
440 pai
->qu
->vb
.buf
+ naddrs
*sizeof(adns_rr_addr
));
445 ha
->addrs
= adns__alloc_interim(pai
->qu
, naddrs
*sizeof(adns_rr_addr
));
446 if (!ha
->addrs
) R_NOMEM
;
447 memcpy(ha
->addrs
, pai
->qu
->vb
.buf
, naddrs
*sizeof(adns_rr_addr
));
449 ha
->astatus
= adns_s_ok
;
451 adns__isort(ha
->addrs
, naddrs
, sizeof(adns_rr_addr
), pai
->qu
->vb
.buf
,
457 static void icb_hostaddr(adns_query parent
, adns_query child
) {
458 adns_answer
*cans
= child
->answer
;
459 adns_rr_hostaddr
*rrp
= child
->ctx
.pinfo
.hostaddr
;
460 adns_state ads
= parent
->ads
;
465 rrp
->naddrs
= (st
>0 && st
<=adns_s_max_tempfail
) ?
-1 : cans
->nrrs
;
466 rrp
->addrs
= cans
->rrs
.addr
;
467 adns__transfer_interim(child
, parent
, rrp
->addrs
,
468 rrp
->naddrs
*sizeof(adns_rr_addr
));
470 if (parent
->children
.head
) {
471 LIST_LINK_TAIL(ads
->childw
,parent
);
473 adns__query_done(parent
);
477 static adns_status
pap_hostaddr(const parseinfo
*pai
, int *cbyte_io
,
478 int max
, adns_rr_hostaddr
*rrp
) {
484 adns_queryflags nflags
;
486 dmstart
= cbyte
= *cbyte_io
;
487 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->host
,
488 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
492 rrp
->astatus
= adns_s_ok
;
498 st
= pap_findaddrs(pai
, rrp
, &cbyte
, pai
->nscount
, dmstart
);
500 if (rrp
->naddrs
!= -1) return adns_s_ok
;
502 st
= pap_findaddrs(pai
, rrp
, &cbyte
, pai
->arcount
, dmstart
);
504 if (rrp
->naddrs
!= -1) return adns_s_ok
;
506 st
= adns__mkquery_frdgram(pai
->ads
, &pai
->qu
->vb
, &id
,
507 pai
->dgram
, pai
->dglen
, dmstart
,
508 adns_r_addr
, adns_qf_quoteok_query
);
512 ctx
.callback
= icb_hostaddr
;
513 ctx
.pinfo
.hostaddr
= rrp
;
514 memset(&ctx
.tinfo
, 0, sizeof(ctx
.tinfo
));
516 nflags
= adns_qf_quoteok_query
;
517 if (!(pai
->qu
->flags
& adns_qf_cname_loose
)) nflags
|= adns_qf_cname_forbid
;
519 st
= adns__internal_submit(pai
->ads
, &nqu
, adns__findtype(adns_r_addr
),
520 &pai
->qu
->vb
, id
, nflags
, pai
->now
, &ctx
);
523 nqu
->parent
= pai
->qu
;
524 LIST_LINK_TAIL_PART(pai
->qu
->children
,nqu
,siblings
.);
529 static adns_status
pa_hostaddr(const parseinfo
*pai
, int cbyte
,
530 int max
, void *datap
) {
531 adns_rr_hostaddr
*rrp
= datap
;
534 st
= pap_hostaddr(pai
, &cbyte
, max
, rrp
);
536 if (cbyte
!= max
) return adns_s_invaliddata
;
541 static int dip_hostaddr(adns_state ads
,
542 const adns_rr_hostaddr
*ap
, const adns_rr_hostaddr
*bp
) {
543 if (ap
->astatus
!= bp
->astatus
) return ap
->astatus
;
544 if (ap
->astatus
) return 0;
546 assert(ap
->addrs
[0].addr
.sa
.sa_family
== AF_INET
);
547 assert(bp
->addrs
[0].addr
.sa
.sa_family
== AF_INET
);
548 return dip_inaddr(ads
,
549 ap
->addrs
[0].addr
.inet
.sin_addr
,
550 bp
->addrs
[0].addr
.inet
.sin_addr
);
553 static int di_hostaddr(adns_state ads
,
554 const void *datap_a
, const void *datap_b
) {
555 const adns_rr_hostaddr
*ap
= datap_a
, *bp
= datap_b
;
557 return dip_hostaddr(ads
, ap
,bp
);
560 static void mfp_hostaddr(adns_query qu
, adns_rr_hostaddr
*rrp
) {
563 adns__makefinal_str(qu
,&rrp
->host
);
565 adns__makefinal_block(qu
, &tablev
, rrp
->naddrs
*sizeof(*rrp
->addrs
));
569 static void mf_hostaddr(adns_query qu
, void *datap
) {
570 adns_rr_hostaddr
*rrp
= datap
;
572 mfp_hostaddr(qu
,rrp
);
575 static adns_status
csp_hostaddr(vbuf
*vb
, const adns_rr_hostaddr
*rrp
) {
581 st
= csp_domain(vb
,rrp
->host
); if (st
) return st
;
584 CSP_ADDSTR(adns_errtypeabbrev(rrp
->astatus
));
586 sprintf(buf
," %d ",rrp
->astatus
);
589 CSP_ADDSTR(adns_errabbrev(rrp
->astatus
));
592 errstr
= adns_strerror(rrp
->astatus
);
593 st
= csp_qstring(vb
,errstr
,strlen(errstr
)); if (st
) return st
;
595 if (rrp
->naddrs
>= 0) {
597 for (i
=0; i
<rrp
->naddrs
; i
++) {
599 st
= csp_addr(vb
,&rrp
->addrs
[i
]);
608 static adns_status
cs_hostaddr(vbuf
*vb
, const void *datap
) {
609 const adns_rr_hostaddr
*rrp
= datap
;
611 return csp_hostaddr(vb
,rrp
);
618 static adns_status
pa_mx_raw(const parseinfo
*pai
, int cbyte
,
619 int max
, void *datap
) {
620 const byte
*dgram
= pai
->dgram
;
621 adns_rr_intstr
*rrp
= datap
;
625 if (cbyte
+2 > max
) return adns_s_invaliddata
;
628 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->str
,
629 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
632 if (cbyte
!= max
) return adns_s_invaliddata
;
636 static int di_mx_raw(adns_state ads
, const void *datap_a
, const void *datap_b
) {
637 const adns_rr_intstr
*ap
= datap_a
, *bp
= datap_b
;
639 if (ap
->i
< bp
->i
) return 0;
640 if (ap
->i
> bp
->i
) return 1;
648 static adns_status
pa_mx(const parseinfo
*pai
, int cbyte
,
649 int max
, void *datap
) {
650 const byte
*dgram
= pai
->dgram
;
651 adns_rr_inthostaddr
*rrp
= datap
;
655 if (cbyte
+2 > max
) return adns_s_invaliddata
;
658 st
= pap_hostaddr(pai
, &cbyte
, max
, &rrp
->ha
);
661 if (cbyte
!= max
) return adns_s_invaliddata
;
665 static int di_mx(adns_state ads
, const void *datap_a
, const void *datap_b
) {
666 const adns_rr_inthostaddr
*ap
= datap_a
, *bp
= datap_b
;
668 if (ap
->i
< bp
->i
) return 0;
669 if (ap
->i
> bp
->i
) return 1;
670 return dip_hostaddr(ads
, &ap
->ha
, &bp
->ha
);
674 * _inthostaddr (mf,cs)
677 static void mf_inthostaddr(adns_query qu
, void *datap
) {
678 adns_rr_inthostaddr
*rrp
= datap
;
680 mfp_hostaddr(qu
,&rrp
->ha
);
683 static adns_status
cs_inthostaddr(vbuf
*vb
, const void *datap
) {
684 const adns_rr_inthostaddr
*rrp
= datap
;
687 sprintf(buf
,"%u ",rrp
->i
);
690 return csp_hostaddr(vb
,&rrp
->ha
);
697 static adns_status
cs_inthost(vbuf
*vb
, const void *datap
) {
698 const adns_rr_intstr
*rrp
= datap
;
701 sprintf(buf
,"%u ",rrp
->i
);
703 return csp_domain(vb
,rrp
->str
);
707 * _ptr (ckl,pa +icb_ptr)
710 static adns_status
ckl_ptr(adns_state ads
, adns_queryflags flags
,
711 union checklabel_state
*cls
, qcontext
*ctx
,
712 int labnum
, const char *label
, int lablen
) {
713 static const char *const (expectdomain
[])= { DNS_INADDR_ARPA
};
720 if (lablen
<=0 || lablen
>3) return adns_s_querydomainwrong
;
721 memcpy(labbuf
, label
, lablen
);
723 cls
->ptr
.ipv
[3-labnum
]= strtoul(labbuf
,&ep
,10);
724 if (*ep
) return adns_s_querydomainwrong
;
725 if (lablen
>1 && *label
=='0') return adns_s_querydomainwrong
;
726 } else if (labnum
< 4 + sizeof(expectdomain
)/sizeof(*expectdomain
)) {
727 ed
= expectdomain
[labnum
-4];
729 if (lablen
!= l
|| memcmp(label
, ed
, l
)) return adns_s_querydomainwrong
;
731 if (lablen
) return adns_s_querydomainwrong
;
732 ctx
->tinfo
.ptr
.addr
.s_addr
=
733 htonl((cls
->ptr
.ipv
[0]<<24) | (cls
->ptr
.ipv
[1]<<16) |
734 (cls
->ptr
.ipv
[2]<< 8) | (cls
->ptr
.ipv
[3]));
739 static void icb_ptr(adns_query parent
, adns_query child
) {
740 adns_answer
*cans
= child
->answer
;
741 const struct in_addr
*queried
;
742 const unsigned char *found
;
743 adns_state ads
= parent
->ads
;
746 if (cans
->status
== adns_s_nxdomain
|| cans
->status
== adns_s_nodata
) {
747 adns__query_fail(parent
,adns_s_inconsistent
);
749 } else if (cans
->status
) {
750 adns__query_fail(parent
,cans
->status
);
754 queried
= &parent
->ctx
.tinfo
.ptr
.addr
;
755 for (i
=0, found
=cans
->rrs
.bytes
; i
<cans
->nrrs
; i
++, found
+=cans
->rrsz
) {
756 if (!memcmp(queried
,found
,cans
->rrsz
)) {
757 if (!parent
->children
.head
) {
758 adns__query_done(parent
);
761 LIST_LINK_TAIL(ads
->childw
,parent
);
767 adns__query_fail(parent
,adns_s_inconsistent
);
770 static adns_status
pa_ptr(const parseinfo
*pai
, int dmstart
,
771 int max
, void *datap
) {
779 st
= pap_domain(pai
, &cbyte
, max
, rrp
,
780 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
782 if (cbyte
!= max
) return adns_s_invaliddata
;
784 st
= adns__mkquery_frdgram(pai
->ads
, &pai
->qu
->vb
, &id
,
785 pai
->dgram
, pai
->dglen
, dmstart
,
786 adns_r_a
, adns_qf_quoteok_query
);
790 ctx
.callback
= icb_ptr
;
791 memset(&ctx
.pinfo
,0,sizeof(ctx
.pinfo
));
792 memset(&ctx
.tinfo
,0,sizeof(ctx
.tinfo
));
793 st
= adns__internal_submit(pai
->ads
, &nqu
, adns__findtype(adns_r_a
),
795 adns_qf_quoteok_query
, pai
->now
, &ctx
);
798 nqu
->parent
= pai
->qu
;
799 LIST_LINK_TAIL_PART(pai
->qu
->children
,nqu
,siblings
.);
807 static void mf_strpair(adns_query qu
, void *datap
) {
808 adns_rr_strpair
*rrp
= datap
;
810 adns__makefinal_str(qu
,&rrp
->array
[0]);
811 adns__makefinal_str(qu
,&rrp
->array
[1]);
818 static void mf_intstrpair(adns_query qu
, void *datap
) {
819 adns_rr_intstrpair
*rrp
= datap
;
821 adns__makefinal_str(qu
,&rrp
->array
[0].str
);
822 adns__makefinal_str(qu
,&rrp
->array
[1].str
);
829 static adns_status
pa_hinfo(const parseinfo
*pai
, int cbyte
,
830 int max
, void *datap
) {
831 adns_rr_intstrpair
*rrp
= datap
;
835 for (i
=0; i
<2; i
++) {
836 st
= pap_qstring(pai
, &cbyte
, max
, &rrp
->array
[i
].i
, &rrp
->array
[i
].str
);
840 if (cbyte
!= max
) return adns_s_invaliddata
;
846 * _mailbox (pap,cs +pap_mailbox822)
849 static adns_status
pap_mailbox822(const parseinfo
*pai
,
850 int *cbyte_io
, int max
, char **mb_r
) {
851 int lablen
, labstart
, i
, needquote
, c
, r
, neednorm
;
852 const unsigned char *p
;
860 adns__findlabel_start(&fls
, pai
->ads
,
862 pai
->dgram
, pai
->dglen
, max
,
863 *cbyte_io
, cbyte_io
);
864 st
= adns__findlabel_next(&fls
,&lablen
,&labstart
);
866 adns__vbuf_appendstr(vb
,".");
871 for (i
=0, needquote
=0, p
= pai
->dgram
+labstart
; i
<lablen
; i
++) {
873 if ((c
&~128) < 32 || (c
&~128) == 127) return adns_s_invaliddata
;
874 if (c
== '.' && !neednorm
) neednorm
= 1;
875 else if (c
==' ' || c
>=127 || ctype_822special(c
)) needquote
++;
879 if (needquote
|| neednorm
) {
880 r
= adns__vbuf_ensure(vb
, lablen
+needquote
+4); if (!r
) R_NOMEM
;
881 adns__vbuf_appendq(vb
,"\"",1);
882 for (i
=0, needquote
=0, p
= pai
->dgram
+labstart
; i
<lablen
; i
++, p
++) {
884 if (c
== '"' || c
=='\\') adns__vbuf_appendq(vb
,"\\",1);
885 adns__vbuf_appendq(vb
,p
,1);
887 adns__vbuf_appendq(vb
,"\"",1);
889 r
= adns__vbuf_append(vb
, pai
->dgram
+labstart
, lablen
); if (!r
) R_NOMEM
;
892 r
= adns__vbuf_appendstr(vb
,"@"); if (!r
) R_NOMEM
;
894 st
= adns__parse_domain_more(&fls
,pai
->ads
, pai
->qu
,vb
,0, pai
->dgram
);
898 str
= adns__alloc_interim(pai
->qu
, vb
->used
+1); if (!str
) R_NOMEM
;
899 memcpy(str
,vb
->buf
,vb
->used
);
905 static adns_status
pap_mailbox(const parseinfo
*pai
, int *cbyte_io
, int max
,
907 if (pai
->qu
->typei
->typekey
& adns__qtf_mail822
) {
908 return pap_mailbox822(pai
, cbyte_io
, max
, mb_r
);
910 return pap_domain(pai
, cbyte_io
, max
, mb_r
, pdf_quoteok
);
914 static adns_status
csp_mailbox(vbuf
*vb
, const char *mailbox
) {
915 return csp_domain(vb
,mailbox
);
922 static adns_status
pa_rp(const parseinfo
*pai
, int cbyte
,
923 int max
, void *datap
) {
924 adns_rr_strpair
*rrp
= datap
;
927 st
= pap_mailbox(pai
, &cbyte
, max
, &rrp
->array
[0]);
930 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->array
[1], pdf_quoteok
);
933 if (cbyte
!= max
) return adns_s_invaliddata
;
937 static adns_status
cs_rp(vbuf
*vb
, const void *datap
) {
938 const adns_rr_strpair
*rrp
= datap
;
941 st
= csp_mailbox(vb
,rrp
->array
[0]); if (st
) return st
;
943 st
= csp_domain(vb
,rrp
->array
[1]); if (st
) return st
;
952 static adns_status
pa_soa(const parseinfo
*pai
, int cbyte
,
953 int max
, void *datap
) {
954 adns_rr_soa
*rrp
= datap
;
955 const byte
*dgram
= pai
->dgram
;
959 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->mname
,
960 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
963 st
= pap_mailbox(pai
, &cbyte
, max
, &rrp
->rname
);
966 if (cbyte
+20 != max
) return adns_s_invaliddata
;
968 for (i
=0; i
<5; i
++) {
971 (&rrp
->serial
)[i
]= (msw
<<16) | lsw
;
977 static void mf_soa(adns_query qu
, void *datap
) {
978 adns_rr_soa
*rrp
= datap
;
980 adns__makefinal_str(qu
,&rrp
->mname
);
981 adns__makefinal_str(qu
,&rrp
->rname
);
984 static adns_status
cs_soa(vbuf
*vb
, const void *datap
) {
985 const adns_rr_soa
*rrp
= datap
;
990 st
= csp_domain(vb
,rrp
->mname
); if (st
) return st
;
992 st
= csp_mailbox(vb
,rrp
->rname
); if (st
) return st
;
994 for (i
=0; i
<5; i
++) {
995 sprintf(buf
," %lu",(&rrp
->serial
)[i
]);
1003 * _srv* (ckl,(pap),pa*2,mf*2,di,(csp),cs*2,postsort)
1006 static adns_status
ckl_srv(adns_state ads
, adns_queryflags flags
,
1007 union checklabel_state
*cls
, qcontext
*ctx
,
1008 int labnum
, const char *label
, int lablen
) {
1009 if (labnum
< 2 && !(flags
& adns_qf_quoteok_query
)) {
1010 if (!lablen
|| label
[0] != '_') return adns_s_querydomaininvalid
;
1013 return adns__ckl_hostname(ads
, flags
, cls
, ctx
, labnum
, label
, lablen
);
1016 static adns_status
pap_srv_begin(const parseinfo
*pai
, int *cbyte_io
, int max
,
1018 /* might be adns_rr_srvraw* */) {
1019 const byte
*dgram
= pai
->dgram
;
1023 if ((*cbyte_io
+= 6) > max
) return adns_s_invaliddata
;
1025 rrp
->priority
= GET_W(cbyte
, ti
);
1026 rrp
->weight
= GET_W(cbyte
, ti
);
1027 rrp
->port
= GET_W(cbyte
, ti
);
1031 static adns_status
pa_srvraw(const parseinfo
*pai
, int cbyte
,
1032 int max
, void *datap
) {
1033 adns_rr_srvraw
*rrp
= datap
;
1036 st
= pap_srv_begin(pai
,&cbyte
,max
,datap
);
1039 st
= pap_domain(pai
, &cbyte
, max
, &rrp
->host
,
1040 pai
->qu
->flags
& adns_qf_quoteok_anshost ? pdf_quoteok
: 0);
1043 if (cbyte
!= max
) return adns_s_invaliddata
;
1047 static adns_status
pa_srvha(const parseinfo
*pai
, int cbyte
,
1048 int max
, void *datap
) {
1049 adns_rr_srvha
*rrp
= datap
;
1052 st
= pap_srv_begin(pai
,&cbyte
,max
,datap
); if (st
) return st
;
1053 st
= pap_hostaddr(pai
, &cbyte
, max
, &rrp
->ha
); if (st
) return st
;
1054 if (cbyte
!= max
) return adns_s_invaliddata
;
1058 static void mf_srvraw(adns_query qu
, void *datap
) {
1059 adns_rr_srvraw
*rrp
= datap
;
1060 adns__makefinal_str(qu
, &rrp
->host
);
1063 static void mf_srvha(adns_query qu
, void *datap
) {
1064 adns_rr_srvha
*rrp
= datap
;
1065 mfp_hostaddr(qu
,&rrp
->ha
);
1068 static int di_srv(adns_state ads
, const void *datap_a
, const void *datap_b
) {
1069 const adns_rr_srvraw
*ap
= datap_a
, *bp
= datap_b
;
1070 /* might be const adns_rr_svhostaddr* */
1072 if (ap
->priority
< bp
->priority
) return 0;
1073 if (ap
->priority
> bp
->priority
) return 1;
1077 static adns_status
csp_srv_begin(vbuf
*vb
, const adns_rr_srvha
*rrp
1078 /* might be adns_rr_srvraw* */) {
1080 sprintf(buf
,"%u %u %u ", rrp
->priority
, rrp
->weight
, rrp
->port
);
1085 static adns_status
cs_srvraw(vbuf
*vb
, const void *datap
) {
1086 const adns_rr_srvraw
*rrp
= datap
;
1089 st
= csp_srv_begin(vb
,(const void*)rrp
); if (st
) return st
;
1090 return csp_domain(vb
,rrp
->host
);
1093 static adns_status
cs_srvha(vbuf
*vb
, const void *datap
) {
1094 const adns_rr_srvha
*rrp
= datap
;
1097 st
= csp_srv_begin(vb
,(const void*)datap
); if (st
) return st
;
1098 return csp_hostaddr(vb
,&rrp
->ha
);
1101 static void postsort_srv(adns_state ads
, void *array
, int nrrs
,
1102 const struct typeinfo
*typei
) {
1103 /* we treat everything in the array as if it were an adns_rr_srvha
1104 * even though the array might be of adns_rr_srvraw. That's OK
1105 * because they have the same prefix, which is all we access.
1106 * We use typei->rrsz, too, rather than naive array indexing, of course.
1108 char *workbegin
, *workend
, *search
, *arrayend
;
1109 const adns_rr_srvha
*rr
;
1110 union { adns_rr_srvha ha
; adns_rr_srvraw raw
; } rrtmp
;
1111 int cpriority
, totalweight
, runtotal
;
1114 for (workbegin
= array
, arrayend
= workbegin
+ typei
->rrsz
* nrrs
;
1115 workbegin
< arrayend
;
1116 workbegin
= workend
) {
1117 cpriority
= (rr
=(void*)workbegin
)->priority
;
1119 for (workend
= workbegin
, totalweight
= 0;
1120 workend
< arrayend
&& (rr
=(void*)workend
)->priority
== cpriority
;
1121 workend
+= typei
->rrsz
) {
1122 totalweight
+= rr
->weight
;
1125 /* Now workbegin..(workend-1) incl. are exactly all of the RRs of
1126 * cpriority. From now on, workbegin points to the `remaining'
1127 * records: we select one record at a time (RFC2782 `Usage rules'
1128 * and `Format of the SRV RR' subsection `Weight') to place at
1129 * workbegin (swapping with the one that was there, and then
1130 * advance workbegin. */
1132 workbegin
+ typei
->rrsz
< workend
; /* don't bother if just one */
1133 workbegin
+= typei
->rrsz
) {
1135 randval
= nrand48(ads
->rand48xsubi
);
1136 randval
%= (totalweight
+ 1);
1137 /* makes it into 0..totalweight inclusive; with 2^10 RRs,
1138 * totalweight must be <= 2^26 so probability nonuniformity is
1139 * no worse than 1 in 2^(31-26) ie 1 in 2^5, ie
1140 * abs(log(P_intended(RR_i) / P_actual(RR_i)) <= log(2^-5).
1143 for (search
=workbegin
, runtotal
=0;
1144 (runtotal
+= (rr
=(void*)search
)->weight
) < randval
;
1145 search
+= typei
->rrsz
);
1146 assert(search
< arrayend
);
1147 totalweight
-= rr
->weight
;
1148 if (search
!= workbegin
) {
1149 memcpy(&rrtmp
, workbegin
, typei
->rrsz
);
1150 memcpy(workbegin
, search
, typei
->rrsz
);
1151 memcpy(search
, &rrtmp
, typei
->rrsz
);
1156 * dig -t srv _srv._tcp.test.iwj.relativity.greenend.org.uk.
1157 * ./adnshost_s -t srv- _sip._udp.voip.net.cam.ac.uk.
1158 * ./adnshost_s -t srv- _jabber._tcp.jabber.org
1166 static void mf_byteblock(adns_query qu
, void *datap
) {
1167 adns_rr_byteblock
*rrp
= datap
;
1168 void *bytes
= rrp
->data
;
1169 adns__makefinal_block(qu
,&bytes
,rrp
->len
);
1177 static adns_status
pa_opaque(const parseinfo
*pai
, int cbyte
,
1178 int max
, void *datap
) {
1179 adns_rr_byteblock
*rrp
= datap
;
1181 rrp
->len
= max
- cbyte
;
1182 rrp
->data
= adns__alloc_interim(pai
->qu
, rrp
->len
);
1183 if (!rrp
->data
) R_NOMEM
;
1184 memcpy(rrp
->data
, pai
->dgram
+ cbyte
, rrp
->len
);
1188 static adns_status
cs_opaque(vbuf
*vb
, const void *datap
) {
1189 const adns_rr_byteblock
*rrp
= datap
;
1194 sprintf(buf
,"\\# %d",rrp
->len
);
1197 for (l
= rrp
->len
, p
= rrp
->data
;
1200 sprintf(buf
," %02x%02x%02x%02x",p
[0],p
[1],p
[2],p
[3]);
1206 sprintf(buf
," %02x",*p
);
1216 static void mf_flat(adns_query qu
, void *data
) { }
1222 #define TYPESZ_M(member) (sizeof(*((adns_answer*)0)->rrs.member))
1224 #define DEEP_TYPE(code,rrt,fmt,memb,parser,comparer,/*printer*/...) \
1225 { adns_r_##code, rrt,fmt,TYPESZ_M(memb), mf_##memb, \
1226 GLUE(cs_, CAR(__VA_ARGS__)),pa_##parser,di_##comparer, \
1227 adns__ckl_hostname, CDR(__VA_ARGS__) }
1228 #define FLAT_TYPE(code,rrt,fmt,memb,parser,comparer,/*printer*/...) \
1229 { adns_r_##code, rrt,fmt,TYPESZ_M(memb), mf_flat, \
1230 GLUE(cs_, CAR(__VA_ARGS__)),pa_##parser,di_##comparer, \
1231 adns__ckl_hostname, CDR(__VA_ARGS__) }
1235 static const typeinfo typeinfos
[] = {
1236 /* Must be in ascending order of rrtype ! */
1237 /* mem-mgmt code rrt fmt member parser comparer printer */
1239 FLAT_TYPE(a
, "A", 0, inaddr
, inaddr
, inaddr
,inaddr
),
1240 DEEP_TYPE(ns_raw
, "NS", "raw",str
, host_raw
,0, domain
),
1241 DEEP_TYPE(cname
, "CNAME", 0, str
, dom_raw
, 0, domain
),
1242 DEEP_TYPE(soa_raw
,"SOA", "raw",soa
, soa
, 0, soa
),
1243 DEEP_TYPE(ptr_raw
,"PTR", "raw",str
, host_raw
,0, domain
),
1244 DEEP_TYPE(hinfo
, "HINFO", 0, intstrpair
,hinfo
, 0, hinfo
),
1245 DEEP_TYPE(mx_raw
, "MX", "raw",intstr
, mx_raw
, mx_raw
,inthost
),
1246 DEEP_TYPE(txt
, "TXT", 0, manyistr
, txt
, 0, txt
),
1247 DEEP_TYPE(rp_raw
, "RP", "raw",strpair
, rp
, 0, rp
),
1248 DEEP_TYPE(srv_raw
,"SRV", "raw",srvraw
, srvraw
, srv
, srvraw
,
1249 .checklabel
= ckl_srv
, .postsort
= postsort_srv
),
1251 FLAT_TYPE(addr
, "A", "addr", addr
, addr
, addr
, addr
),
1252 DEEP_TYPE(ns
, "NS", "+addr",hostaddr
, hostaddr
,hostaddr
,hostaddr
),
1253 DEEP_TYPE(ptr
, "PTR","checked",str
, ptr
, 0, domain
,
1254 .checklabel
= ckl_ptr
),
1255 DEEP_TYPE(mx
, "MX", "+addr",inthostaddr
,mx
, mx
, inthostaddr
, ),
1256 DEEP_TYPE(srv
, "SRV","+addr",srvha
, srvha
, srv
, srvha
,
1257 .checklabel
= ckl_srv
, .postsort
= postsort_srv
),
1259 DEEP_TYPE(soa
, "SOA","822", soa
, soa
, 0, soa
),
1260 DEEP_TYPE(rp
, "RP", "822", strpair
, rp
, 0, rp
),
1263 static const typeinfo typeinfo_unknown
=
1264 DEEP_TYPE(unknown
,0, "unknown",byteblock
,opaque
, 0, opaque
);
1266 const typeinfo
*adns__findtype(adns_rrtype type
) {
1267 const typeinfo
*begin
, *end
, *mid
;
1269 if (type
& adns_r_unknown
) return &typeinfo_unknown
;
1271 begin
= typeinfos
; end
= typeinfos
+(sizeof(typeinfos
)/sizeof(typeinfo
));
1273 while (begin
< end
) {
1274 mid
= begin
+ ((end
-begin
)>>1);
1275 if (mid
->typekey
== type
) return mid
;
1276 if (type
> mid
->typekey
) begin
= mid
+1;