ff3691b5c103250eb5ec5c5ea835d6ceedc36024
[adns] / src / types.c
1 /*
2 * types.c
3 * - RR-type-specific code, and the machinery to call it
4 */
5 /*
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.)
11 *
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)
15 * any later version.
16 *
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.
21 *
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.
25 */
26
27 #include <stddef.h>
28 #include <stdlib.h>
29
30 #include <sys/types.h>
31 #include <sys/socket.h>
32 #include <netinet/in.h>
33 #include <arpa/inet.h>
34 #include <netdb.h>
35
36 #include "internal.h"
37
38 #define R_NOMEM return adns_s_nomemory
39 #define CSP_ADDSTR(s) do { \
40 if (!adns__vbuf_appendstr(vb,(s))) R_NOMEM; \
41 } while (0)
42
43 /*
44 * order of sections:
45 *
46 * _string (pap)
47 * _textdata, _qstring (csp)
48 * _str (mf,cs)
49 * _intstr (mf,csp,cs)
50 * _manyistr (mf,cs)
51 * _txt (pa)
52 * _inaddr (pa,cs,di, +search_sortlist, dip_genaddr)
53 * _in6addr (pa,cs,di)
54 * _addr (pap,pa,di,csp,cs,gsz,qs, +search_sortlist_sa,
55 * dip_sockaddr, rrtypes)
56 * _domain (pap)
57 * _host_raw (pa)
58 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +pap_findaddrs)
59 * _mx_raw (pa,di)
60 * _mx (pa,di)
61 * _inthostaddr (mf,cs)
62 * _ptr (pa)
63 * _strpair (mf,cs)
64 * _intstrpair (mf,cs)
65 * _hinfo (pa)
66 * _mailbox (pap +pap_mailbox822)
67 * _rp (pa)
68 * _soa (pa,mf,cs)
69 * _srv* (ckl,(pap),pa,mf,di,(csp),cs,postsort)
70 * _byteblock (mf)
71 * _opaque (pa,cs)
72 * _flat (mf)
73 *
74 * within each section:
75 * ckl_*
76 * pap_*
77 * pa_*
78 * dip_*
79 * di_*
80 * mfp_*
81 * mf_*
82 * csp_*
83 * cs_*
84 * postsort_*
85 */
86
87 /*
88 * _qstring (pap,csp)
89 */
90
91 static adns_status pap_qstring(const parseinfo *pai, int *cbyte_io, int max,
92 int *len_r, char **str_r) {
93 /* Neither len_r nor str_r may be null.
94 * End of datagram (overrun) is indicated by returning adns_s_invaliddata;
95 */
96 const byte *dgram= pai->dgram;
97 int l, cbyte;
98 char *str;
99
100 cbyte= *cbyte_io;
101
102 if (cbyte >= max) return adns_s_invaliddata;
103 GET_B(cbyte,l);
104 if (cbyte+l > max) return adns_s_invaliddata;
105
106 str= adns__alloc_interim(pai->qu, l+1);
107 if (!str) R_NOMEM;
108
109 str[l]= 0;
110 memcpy(str,dgram+cbyte,l);
111
112 *len_r= l;
113 *str_r= str;
114 *cbyte_io= cbyte+l;
115
116 return adns_s_ok;
117 }
118
119 static adns_status csp_qstring(vbuf *vb, const char *dp, int len) {
120 unsigned char ch;
121 char buf[10];
122 int cn;
123
124 CSP_ADDSTR("\"");
125 for (cn=0; cn<len; cn++) {
126 ch= *dp++;
127 if (ch == '\\') {
128 CSP_ADDSTR("\\\\");
129 } else if (ch == '"') {
130 CSP_ADDSTR("\\\"");
131 } else if (ch >= 32 && ch <= 126) {
132 if (!adns__vbuf_append(vb,&ch,1)) R_NOMEM;
133 } else {
134 sprintf(buf,"\\x%02x",ch);
135 CSP_ADDSTR(buf);
136 }
137 }
138 CSP_ADDSTR("\"");
139
140 return adns_s_ok;
141 }
142
143 /*
144 * _str (mf)
145 */
146
147 static void mf_str(adns_query qu, void *datap) {
148 char **rrp= datap;
149
150 adns__makefinal_str(qu,rrp);
151 }
152
153 /*
154 * _intstr (mf)
155 */
156
157 static void mf_intstr(adns_query qu, void *datap) {
158 adns_rr_intstr *rrp= datap;
159
160 adns__makefinal_str(qu,&rrp->str);
161 }
162
163 /*
164 * _manyistr (mf)
165 */
166
167 static void mf_manyistr(adns_query qu, void *datap) {
168 adns_rr_intstr **rrp= datap;
169 adns_rr_intstr *te, *table;
170 void *tablev;
171 int tc;
172
173 for (tc=0, te= *rrp; te->i >= 0; te++, tc++);
174 tablev= *rrp;
175 adns__makefinal_block(qu,&tablev,sizeof(*te)*(tc+1));
176 *rrp= table= tablev;
177 for (te= *rrp; te->i >= 0; te++)
178 adns__makefinal_str(qu,&te->str);
179 }
180
181 /*
182 * _txt (pa,cs)
183 */
184
185 static adns_status pa_txt(const parseinfo *pai, int cbyte,
186 int max, void *datap) {
187 adns_rr_intstr **rrp= datap, *table, *te;
188 const byte *dgram= pai->dgram;
189 int ti, tc, l, startbyte;
190 adns_status st;
191
192 startbyte= cbyte;
193 if (cbyte >= max) return adns_s_invaliddata;
194 tc= 0;
195 while (cbyte < max) {
196 GET_B(cbyte,l);
197 cbyte+= l;
198 tc++;
199 }
200 if (cbyte != max || !tc) return adns_s_invaliddata;
201
202 table= adns__alloc_interim(pai->qu,sizeof(*table)*(tc+1));
203 if (!table) R_NOMEM;
204
205 for (cbyte=startbyte, ti=0, te=table; ti<tc; ti++, te++) {
206 st= pap_qstring(pai, &cbyte, max, &te->i, &te->str);
207 if (st) return st;
208 }
209 assert(cbyte == max);
210
211 te->i= -1;
212 te->str= 0;
213
214 *rrp= table;
215 return adns_s_ok;
216 }
217
218 static adns_status cs_txt(vbuf *vb, const void *datap) {
219 const adns_rr_intstr *const *rrp= datap;
220 const adns_rr_intstr *current;
221 adns_status st;
222 int spc;
223
224 for (current= *rrp, spc=0; current->i >= 0; current++, spc=1) {
225 if (spc) CSP_ADDSTR(" ");
226 st= csp_qstring(vb,current->str,current->i); if (st) return st;
227 }
228 return adns_s_ok;
229 }
230
231 /*
232 * _hinfo (cs)
233 */
234
235 static adns_status cs_hinfo(vbuf *vb, const void *datap) {
236 const adns_rr_intstrpair *rrp= datap;
237 adns_status st;
238
239 st= csp_qstring(vb,rrp->array[0].str,rrp->array[0].i); if (st) return st;
240 CSP_ADDSTR(" ");
241 st= csp_qstring(vb,rrp->array[1].str,rrp->array[1].i); if (st) return st;
242 return adns_s_ok;
243 }
244
245 /*
246 * _inaddr (pa,di,cs +search_sortlist, dip_genaddr)
247 */
248
249 static adns_status pa_inaddr(const parseinfo *pai, int cbyte,
250 int max, void *datap) {
251 struct in_addr *storeto= datap;
252
253 if (max-cbyte != 4) return adns_s_invaliddata;
254 memcpy(storeto, pai->dgram + cbyte, 4);
255 return adns_s_ok;
256 }
257
258 static int search_sortlist(adns_state ads, int af, const void *ad) {
259 const struct sortlist *slp;
260 const struct in6_addr *a6;
261 union gen_addr a;
262 int i;
263 int v6mappedp = 0;
264
265 if (af == AF_INET6) {
266 a6 = ad;
267 if (IN6_IS_ADDR_V4MAPPED(a6)) {
268 a.v4.s_addr = htonl(((unsigned long)a6->s6_addr[12] << 24) |
269 ((unsigned long)a6->s6_addr[13] << 16) |
270 ((unsigned long)a6->s6_addr[14] << 8) |
271 ((unsigned long)a6->s6_addr[15] << 0));
272 v6mappedp = 1;
273 }
274 }
275
276 for (i=0, slp=ads->sortlist;
277 i<ads->nsortlist &&
278 !(af == slp->ai->af &&
279 slp->ai->matchp(ad, &slp->base, &slp->mask)) &&
280 !(v6mappedp && slp->ai->af == AF_INET &&
281 slp->ai->matchp(&a, &slp->base, &slp->mask));
282 i++, slp++);
283 return i;
284 }
285
286 static int dip_genaddr(adns_state ads, int af, const void *a, const void *b) {
287 int ai, bi;
288
289 if (!ads->nsortlist) return 0;
290
291 ai= search_sortlist(ads,af,a);
292 bi= search_sortlist(ads,af,b);
293 return bi<ai;
294 }
295
296 static int di_inaddr(adns_state ads,
297 const void *datap_a, const void *datap_b) {
298 return dip_genaddr(ads,AF_INET,datap_a,datap_b);
299 }
300
301 static adns_status cs_inaddr(vbuf *vb, const void *datap) {
302 const struct in_addr *rrp= datap, rr= *rrp;
303 const char *ia;
304
305 ia= inet_ntoa(rr); assert(ia);
306 CSP_ADDSTR(ia);
307 return adns_s_ok;
308 }
309
310 /*
311 * _in6addr (pa,di,cs)
312 */
313
314 static adns_status pa_in6addr(const parseinfo *pai, int cbyte,
315 int max, void *datap) {
316 struct in6_addr *storeto= datap;
317
318 if (max-cbyte != 16) return adns_s_invaliddata;
319 memcpy(storeto->s6_addr, pai->dgram + cbyte, 16);
320 return adns_s_ok;
321 }
322
323 static int di_in6addr(adns_state ads,
324 const void *datap_a, const void *datap_b) {
325 return dip_genaddr(ads,AF_INET6,datap_a,datap_b);
326 }
327
328 static adns_status cs_in6addr(vbuf *vb, const void *datap) {
329 char buf[INET6_ADDRSTRLEN];
330 const char *ia;
331
332 ia= inet_ntop(AF_INET6, datap, buf, sizeof(buf)); assert(ia);
333 CSP_ADDSTR(ia);
334 return adns_s_ok;
335 }
336
337 /*
338 * _addr (pap,pa,di,csp,cs,gsz,qs, +search_sortlist_sa, dip_sockaddr,
339 * addr_rrtypes)
340 */
341
342 static const typeinfo tinfo_addrsub;
343
344 #define ADDR_RRTYPES(_) _(a) _(aaaa)
345
346 static const adns_rrtype addr_all_rrtypes[] = {
347 #define RRTY_CODE(ty) adns_r_##ty,
348 ADDR_RRTYPES(RRTY_CODE)
349 #undef RRTY_CODE
350 };
351
352 enum {
353 #define RRTY_INDEX(ty) addr__ri_##ty,
354 ADDR_RRTYPES(RRTY_INDEX)
355 #undef RRTY_INDEX
356 addr_nrrtypes,
357 #define RRTY_FLAG(ty) addr_rf_##ty = 1 << addr__ri_##ty,
358 ADDR_RRTYPES(RRTY_FLAG)
359 addr__rrty_hunoz
360 #undef RRTY_FLAG
361 };
362
363 static unsigned addr_rrtypeflag(adns_rrtype type)
364 {
365 int i;
366
367 type &= adns_rrt_typemask;
368 for (i = 0; i < addr_nrrtypes && type != addr_all_rrtypes[i]; i++);
369 assert(i < addr_nrrtypes);
370 return 1 << i;
371 }
372
373 /* About CNAME handling in addr queries.
374 *
375 * A user-level addr query is translated into a number of protocol-level
376 * queries, and its job is to reassemble the results. This gets tricky if
377 * the answers aren't consistent. In particular, if the answers report
378 * inconsistent indirection via CNAME records (e.g., different CNAMEs, or
379 * some indirect via a CNAME, and some don't) then we have trouble.
380 *
381 * Once we've received an answer, even if it was NODATA, we set
382 * adns__qf_addr_answer on the parent query. This will let us detect a
383 * conflict between a no-CNAME-with-NODATA reply and a subsequent CNAME.
384 *
385 * If we detect a conflict of any kind, then at least one answer came back
386 * with a CNAME record, so we pick the first such answer (somewhat
387 * arbitrarily) as being the `right' canonical name, and set this in the
388 * parent query's answer->cname slot. We discard address records from the
389 * wrong name. And finally we cancel the outstanding child queries, and
390 * resubmit address queries for the address families we don't yet have, with
391 * adns__qf_addr_cname set so that we know that we're in the fixup state.
392 */
393
394 static adns_status pap_addr(const parseinfo *pai, int rrty, size_t rrsz,
395 int *cbyte_io, int max, adns_rr_addr *storeto)
396 {
397 const byte *dgram= pai->dgram;
398 int af, addrlen, salen;
399 struct in6_addr v6map;
400 const void *oaddr = dgram + *cbyte_io;
401 int avail = max - *cbyte_io;
402 int step = -1;
403 void *addrp = 0;
404
405 switch (rrty) {
406 case adns_r_a:
407 if (pai->qu->flags & adns_qf_domapv4) {
408 if (avail < 4) return adns_s_invaliddata;
409 memset(v6map.s6_addr + 0, 0x00, 10);
410 memset(v6map.s6_addr + 10, 0xff, 2);
411 memcpy(v6map.s6_addr + 12, oaddr, 4);
412 oaddr = v6map.s6_addr; avail = sizeof(v6map.s6_addr);
413 if (step < 0) step = 4;
414 goto aaaa;
415 }
416 af = AF_INET; addrlen = 4;
417 addrp = &storeto->addr.inet.sin_addr;
418 salen = sizeof(storeto->addr.inet);
419 break;
420 case adns_r_aaaa:
421 aaaa:
422 af = AF_INET6; addrlen = 16;
423 addrp = storeto->addr.inet6.sin6_addr.s6_addr;
424 salen = sizeof(storeto->addr.inet6);
425 break;
426 }
427 assert(addrp);
428
429 assert(offsetof(adns_rr_addr, addr) + salen <= rrsz);
430 if (addrlen < avail) return adns_s_invaliddata;
431 if (step < 0) step = addrlen;
432 *cbyte_io += step;
433 memset(&storeto->addr, 0, salen);
434 storeto->len = salen;
435 storeto->addr.sa.sa_family = af;
436 memcpy(addrp, oaddr, addrlen);
437
438 return adns_s_ok;
439 }
440
441 static adns_status pa_addr(const parseinfo *pai, int cbyte,
442 int max, void *datap) {
443 int err = pap_addr(pai, pai->qu->answer->type & adns_rrt_typemask,
444 pai->qu->answer->rrsz, &cbyte, max, datap);
445 if (err) return err;
446 if (cbyte != max) return adns_s_invaliddata;
447 return adns_s_ok;
448 }
449
450 static int search_sortlist_sa(adns_state ads, const struct sockaddr *sa)
451 {
452 const afinfo *ai = 0;
453
454 switch (sa->sa_family) {
455 case AF_INET: ai = &adns__inet_afinfo; break;
456 case AF_INET6: ai = &adns__inet6_afinfo; break;
457 }
458 assert(ai);
459
460 return search_sortlist(ads, sa->sa_family, ai->sockaddr_to_inaddr(sa));
461 }
462
463 static int dip_sockaddr(adns_state ads,
464 const struct sockaddr *sa,
465 const struct sockaddr *sb)
466 {
467 if (!ads->sortlist) return 0;
468 return search_sortlist_sa(ads, sa) > search_sortlist_sa(ads, sb);
469 }
470
471 static int di_addr(adns_state ads, const void *datap_a, const void *datap_b) {
472 const adns_rr_addr *ap= datap_a, *bp= datap_b;
473
474 return dip_sockaddr(ads, &ap->addr.sa, &bp->addr.sa);
475 }
476
477 static int div_addr(void *context, const void *datap_a, const void *datap_b) {
478 const adns_state ads= context;
479
480 return di_addr(ads, datap_a, datap_b);
481 }
482
483 static adns_status csp_addr(vbuf *vb, const adns_rr_addr *rrp) {
484 char buf[128];
485 int err;
486
487 switch (rrp->addr.inet.sin_family) {
488 case AF_INET:
489 CSP_ADDSTR("INET ");
490 goto ntop;
491 case AF_INET6:
492 CSP_ADDSTR("INET6 ");
493 goto ntop;
494 ntop:
495 err= getnameinfo(&rrp->addr.sa, rrp->len, buf, sizeof(buf), 0, 0,
496 NI_NUMERICHOST); assert(!err);
497 CSP_ADDSTR(buf);
498 break;
499 default:
500 sprintf(buf,"AF=%u",rrp->addr.sa.sa_family);
501 CSP_ADDSTR(buf);
502 break;
503 }
504 return adns_s_ok;
505 }
506
507 static adns_status cs_addr(vbuf *vb, const void *datap) {
508 const adns_rr_addr *rrp= datap;
509
510 return csp_addr(vb,rrp);
511 }
512
513 static unsigned addr_rrtypes(adns_state ads, adns_rrtype type,
514 adns_queryflags qf)
515 {
516 adns_queryflags permitaf = 0, hackaf = 0;
517 unsigned want = 0;
518
519 if (!(qf & (adns_qf_ipv4_only | adns_qf_ipv6_only)))
520 qf |= adns_qf_ipv4_only | adns_qf_ipv6_only;
521 if (!(type & adns__qtf_bigaddr) || !(type & adns__qtf_manyaf))
522 qf = (qf & adns__qf_afmask) | adns_qf_ipv4_only;
523 else if (ads->iflags & adns_if_afmask) {
524 if (ads->iflags & adns_if_af_v4only) {
525 permitaf |= adns_qf_ipv4_only;
526 hackaf |= adns_qf_domapv4;
527 }
528 if (ads->iflags & adns_if_af_v6only)
529 permitaf |= adns_qf_ipv6_only;
530 if (qf & permitaf)
531 qf &= hackaf | permitaf | ~adns__qf_afmask;
532 }
533
534 if (qf & adns_qf_ipv4_only) want |= addr_rf_a;
535 if (qf & adns_qf_ipv6_only) want |= addr_rf_aaaa;
536
537 return want;
538 }
539
540 static int gsz_addr(adns_rrtype type)
541 {
542 return type & adns__qtf_bigaddr ?
543 sizeof(adns_rr_addr) : sizeof(adns_rr_addr_v4only);
544 }
545
546 static adns_status append_addrs(adns_query qu, adns_query from, size_t rrsz,
547 adns_rr_addr **dp, int *dlen,
548 const adns_rr_addr *sp, int slen)
549 {
550 size_t drrsz = *dlen*rrsz, srrsz = slen*rrsz;
551 byte *p;
552
553 if (!slen) return adns_s_ok;
554 p = adns__alloc_interim(qu, drrsz + srrsz);
555 if (!p) R_NOMEM;
556 if (*dlen) {
557 memcpy(p, *dp, drrsz);
558 adns__free_interim(qu, *dp);
559 }
560 memcpy(p + drrsz, sp, srrsz);
561 *dlen += slen;
562 *dp = (adns_rr_addr *)p;
563 if (from && qu->expires > from->expires) qu->expires = from->expires;
564 return adns_s_ok;
565 }
566
567 static void icb_addr(adns_query parent, adns_query child);
568
569 static void addr_subqueries(adns_query qu, struct timeval now,
570 adns_queryflags qf_extra,
571 const byte *qd_dgram, int qd_dglen)
572 {
573 int i, err, id;
574 adns_query cqu;
575 adns_queryflags qf = (qu->flags & ~adns_qf_search) | qf_extra;
576 adns_rrtype qtf = qu->answer->type & adns__qtf_deref;
577 unsigned which = qu->ctx.tinfo.addr.want & ~qu->ctx.tinfo.addr.have;
578 qcontext ctx;
579
580 memset(&ctx, 0, sizeof(ctx));
581 ctx.callback = icb_addr;
582 for (i = 0; i < addr_nrrtypes; i++) {
583 if (!(which & (1 << i))) continue;
584 err = adns__mkquery_frdgram(qu->ads, &qu->vb, &id, qd_dgram, qd_dglen,
585 DNS_HDRSIZE, addr_all_rrtypes[i], qf);
586 if (err) goto x_error;
587 err = adns__internal_submit(qu->ads, &cqu, &tinfo_addrsub,
588 addr_all_rrtypes[i] | qtf,
589 &qu->vb, id, qf, now, &ctx);
590 if (err) goto x_error;
591 cqu->answer->rrsz = qu->answer->rrsz;
592 cqu->parent = qu;
593 LIST_LINK_TAIL_PART(qu->children, cqu,siblings.);
594 }
595 qu->state = query_childw;
596 LIST_LINK_TAIL(qu->ads->childw, qu);
597 return;
598
599 x_error:
600 adns__query_fail(qu, err);
601 }
602
603 static adns_status addr_submit(adns_query parent, adns_query *query_r,
604 vbuf *qumsg_vb, int id, unsigned want,
605 adns_queryflags flags, struct timeval now,
606 qcontext *ctx)
607 {
608 /* This is effectively a substitute for adns__internal_submit, intended for
609 * the case where the caller (possibly) only wants a subset of the
610 * available record types. The memory management and callback rules are
611 * the same as for adns__internal_submit.
612 *
613 * Some differences: the query is linked onto the parent's children list
614 * before exit (though the parent's state is not changed, and it is not
615 * linked into the childw list queue); and we fiddle with the `tinfo'
616 * portion of the context structure (yes, modifying *ctx), since this is,
617 * in fact, the main purpose of this function.
618 */
619
620 adns_state ads = parent->ads;
621 adns_query qu;
622 adns_status err;
623 adns_rrtype type =
624 (adns_r_addr & adns_rrt_reprmask) |
625 (parent->answer->type & ~adns_rrt_reprmask);
626
627 ctx->tinfo.addr.want = want;
628 ctx->tinfo.addr.have = 0;
629 err = adns__internal_submit(ads, &qu, adns__findtype(adns_r_addr),
630 type, qumsg_vb, id, flags, now, ctx);
631 if (err) return err;
632
633 qu->parent = parent;
634 LIST_LINK_TAIL_PART(parent->children, qu, siblings.);
635 *query_r = qu;
636 return adns_s_ok;
637 }
638
639 static adns_status copy_cname_from_child(adns_query parent, adns_query child)
640 {
641 adns_answer *pans = parent->answer, *cans = child->answer;
642 size_t n = strlen(cans->cname) + 1;
643
644 pans->cname = adns__alloc_preserved(parent, n);
645 if (!pans->cname) R_NOMEM;
646 memcpy(pans->cname, cans->cname, n);
647 return adns_s_ok;
648 }
649
650 static void done_addr_type(adns_query qu, adns_rrtype type)
651 { qu->ctx.tinfo.addr.have |= addr_rrtypeflag(type); }
652
653 static void icb_addr(adns_query parent, adns_query child)
654 {
655 adns_state ads = parent->ads;
656 adns_answer *pans = parent->answer, *cans = child->answer;
657 struct timeval now;
658 adns_status err;
659 int id;
660
661 if (!(child->flags & adns__qf_addr_cname) &&
662 (parent->flags & adns__qf_addr_answer) &&
663 (!!pans->cname != !!cans->cname ||
664 (pans->cname && strcmp(pans->cname, cans->cname) != 0))) {
665 /* We've detected an inconsistency in CNAME records, and must deploy
666 * countermeasures.
667 */
668
669 if (!pans->cname) {
670 /* The child has a CNAME record, but the parent doesn't. We must
671 * discard all of the parent's addresses, and substitute the child's.
672 */
673
674 assert(pans->rrsz == cans->rrsz);
675 adns__free_interim(parent, pans->rrs.bytes);
676 adns__transfer_interim(child, parent, cans->rrs.bytes);
677 pans->rrs.bytes = cans->rrs.bytes;
678 pans->nrrs = cans->nrrs;
679 parent->ctx.tinfo.addr.have = 0;
680 done_addr_type(parent, cans->type);
681 err = copy_cname_from_child(parent, child); if (err) goto x_err;
682 }
683
684 /* We've settled on the CNAME (now) associated with the parent, which
685 * already has appropriate address records. Build a query datagram for
686 * this name so that we can issue child queries for the missing address
687 * families. The child's vbuf looks handy for this.
688 */
689 err = adns__mkquery(ads, &child->vb, &id, pans->cname,
690 strlen(pans->cname), &tinfo_addrsub,
691 adns_r_addr, parent->flags);
692 if (err) goto x_err;
693
694 /* Now cancel the remaining children, and try again with the CNAME we've
695 * settled on.
696 */
697 adns__cancel_children(parent);
698 if (gettimeofday(&now, 0)) goto x_gtod;
699 addr_subqueries(parent, now, adns__qf_addr_cname,
700 child->vb.buf, child->vb.used);
701 return;
702 }
703
704 if (cans->cname && !pans->cname) {
705 err = copy_cname_from_child(parent, child);
706 if (err) goto x_err;
707 }
708
709 if ((parent->flags & adns_qf_search) &&
710 !pans->cname && cans->status == adns_s_nxdomain) {
711 /* We're searching a list of suffixes, this is the first answer, and it
712 * tells us that the name doesn't exist. Try the next one.
713 */
714
715 if (parent->expires > child->expires) parent->expires = child->expires;
716 adns__cancel_children(parent);
717 adns__free_interim(parent, pans->rrs.bytes);
718 pans->rrs.bytes = 0; pans->nrrs = 0;
719 if (gettimeofday(&now, 0)) goto x_gtod;
720 adns__search_next(ads, parent, now);
721 return;
722 }
723
724 if (cans->status && cans->status != adns_s_nodata)
725 { err = cans->status; goto x_err; }
726
727 assert(pans->rrsz == cans->rrsz);
728 err = append_addrs(parent, child, pans->rrsz,
729 &pans->rrs.addr, &pans->nrrs,
730 cans->rrs.addr, cans->nrrs);
731 if (err) goto x_err;
732 done_addr_type(parent, cans->type);
733
734 if (parent->children.head) LIST_LINK_TAIL(ads->childw, parent);
735 else if (!pans->nrrs) adns__query_fail(parent, adns_s_nodata);
736 else adns__query_done(parent);
737 parent->flags |= adns__qf_addr_answer;
738 return;
739
740 x_gtod:
741 adns__diag(ads, -1, parent, "gettimeofday failed: %s", strerror(errno));
742 err = adns_s_systemfail;
743 goto x_err;
744
745 x_err:
746 adns__query_fail(parent, err);
747 }
748
749 static void qs_addr(adns_query qu, struct timeval now)
750 {
751 if (!qu->ctx.tinfo.addr.want) {
752 qu->ctx.tinfo.addr.want =
753 addr_rrtypes(qu->ads, qu->answer->type, qu->flags);
754 qu->ctx.tinfo.addr.have = 0;
755 }
756 addr_subqueries(qu, now, 0, qu->query_dgram, qu->query_dglen);
757 }
758
759 /*
760 * _domain (pap,csp,cs)
761 * _dom_raw (pa)
762 */
763
764 static adns_status pap_domain(const parseinfo *pai, int *cbyte_io, int max,
765 char **domain_r, parsedomain_flags flags) {
766 adns_status st;
767 char *dm;
768
769 st= adns__parse_domain(pai->qu->ads, pai->serv, pai->qu, &pai->qu->vb, flags,
770 pai->dgram,pai->dglen, cbyte_io, max);
771 if (st) return st;
772 if (!pai->qu->vb.used) return adns_s_invaliddata;
773
774 dm= adns__alloc_interim(pai->qu, pai->qu->vb.used+1);
775 if (!dm) R_NOMEM;
776
777 dm[pai->qu->vb.used]= 0;
778 memcpy(dm,pai->qu->vb.buf,pai->qu->vb.used);
779
780 *domain_r= dm;
781 return adns_s_ok;
782 }
783
784 static adns_status csp_domain(vbuf *vb, const char *domain) {
785 CSP_ADDSTR(domain);
786 if (!*domain) CSP_ADDSTR(".");
787 return adns_s_ok;
788 }
789
790 static adns_status cs_domain(vbuf *vb, const void *datap) {
791 const char *const *domainp= datap;
792 return csp_domain(vb,*domainp);
793 }
794
795 static adns_status pa_dom_raw(const parseinfo *pai, int cbyte,
796 int max, void *datap) {
797 char **rrp= datap;
798 adns_status st;
799
800 st= pap_domain(pai, &cbyte, max, rrp, pdf_quoteok);
801 if (st) return st;
802
803 if (cbyte != max) return adns_s_invaliddata;
804 return adns_s_ok;
805 }
806
807 /*
808 * _host_raw (pa)
809 */
810
811 static adns_status pa_host_raw(const parseinfo *pai, int cbyte,
812 int max, void *datap) {
813 char **rrp= datap;
814 adns_status st;
815
816 st= pap_domain(pai, &cbyte, max, rrp,
817 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
818 if (st) return st;
819
820 if (cbyte != max) return adns_s_invaliddata;
821 return adns_s_ok;
822 }
823
824 /*
825 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +icb_hostaddr, pap_findaddrs)
826 */
827
828 static adns_status pap_findaddrs(const parseinfo *pai, adns_rr_hostaddr *ha,
829 unsigned *want_io, size_t addrsz,
830 int *cbyte_io, int count, int dmstart) {
831 int rri, naddrs;
832 unsigned typef, want = *want_io;
833 int type, class, rdlen, rdend, rdstart, ownermatched;
834 unsigned long ttl;
835 adns_status st;
836
837 for (rri=0, naddrs=0; rri<count; rri++) {
838 st= adns__findrr_anychk(pai->qu, pai->serv, pai->dgram,
839 pai->dglen, cbyte_io,
840 &type, &class, &ttl, &rdlen, &rdstart,
841 pai->dgram, pai->dglen, dmstart, &ownermatched);
842 if (st) return st;
843 if (!ownermatched || class != DNS_CLASS_IN) continue;
844 typef = addr_rrtypeflag(type);
845 if (!(want & typef)) continue;
846 want &= ~typef;
847 if (!adns__vbuf_ensure(&pai->qu->vb, (naddrs+1)*addrsz)) R_NOMEM;
848 adns__update_expires(pai->qu,ttl,pai->now);
849 rdend = rdstart + rdlen;
850 st= pap_addr(pai, type, addrsz, &rdstart, rdend,
851 (adns_rr_addr *)(pai->qu->vb.buf + naddrs*addrsz));
852 if (st) return st;
853 if (rdstart != rdend) return adns_s_invaliddata;
854 naddrs++;
855 }
856 if (naddrs > 0) {
857 st = append_addrs(pai->qu, 0, addrsz, &ha->addrs, &ha->naddrs,
858 (const adns_rr_addr *)pai->qu->vb.buf, naddrs);
859 if (st) return st;
860 ha->astatus= adns_s_ok;
861
862 if (!want) {
863 adns__isort(ha->addrs, naddrs, addrsz, pai->qu->vb.buf,
864 div_addr, pai->ads);
865 }
866 }
867 *want_io = want;
868 return adns_s_ok;
869 }
870
871 static void icb_hostaddr(adns_query parent, adns_query child) {
872 adns_answer *cans= child->answer;
873 adns_rr_hostaddr *rrp= child->ctx.pinfo.hostaddr;
874 adns_state ads= parent->ads;
875 adns_status st;
876 size_t addrsz = gsz_addr(parent->answer->type);
877
878 st= cans->status == adns_s_nodata ? adns_s_ok : cans->status;
879
880 if (st) goto done;
881 assert(addrsz == cans->rrsz);
882 st = append_addrs(parent, child, addrsz,
883 &rrp->addrs, &rrp->naddrs,
884 cans->rrs.addr, cans->nrrs);
885 if (st) goto done;
886 if (!rrp->naddrs) { st = adns_s_nodata; goto done; }
887
888 if (!adns__vbuf_ensure(&parent->vb, addrsz))
889 { st = adns_s_nomemory; goto done; }
890 adns__isort(rrp->addrs, rrp->naddrs, addrsz, parent->vb.buf,
891 div_addr, ads);
892
893 done:
894 if (st) {
895 adns__free_interim(parent, rrp->addrs);
896 rrp->naddrs= (st>0 && st<=adns_s_max_tempfail) ? -1 : 0;
897 }
898
899 rrp->astatus= st;
900 if (parent->children.head) {
901 LIST_LINK_TAIL(ads->childw,parent);
902 } else {
903 adns__query_done(parent);
904 }
905 }
906
907 static adns_status pap_hostaddr(const parseinfo *pai, int *cbyte_io,
908 int max, adns_rr_hostaddr *rrp) {
909 adns_status st;
910 int dmstart, cbyte;
911 qcontext ctx;
912 int id;
913 adns_query nqu;
914 adns_queryflags nflags;
915 unsigned want;
916 size_t addrsz = gsz_addr(pai->qu->answer->type);
917
918 dmstart= cbyte= *cbyte_io;
919 st= pap_domain(pai, &cbyte, max, &rrp->host,
920 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
921 if (st) return st;
922 *cbyte_io= cbyte;
923
924 rrp->astatus= adns_s_ok;
925 rrp->naddrs= 0;
926 rrp->addrs= 0;
927
928 cbyte= pai->nsstart;
929
930 want = addr_rrtypes(pai->ads, pai->qu->answer->type, pai->qu->flags);
931
932 st= pap_findaddrs(pai, rrp, &want, addrsz, &cbyte, pai->nscount, dmstart);
933 if (st) return st;
934 if (!want) return adns_s_ok;
935
936 st= pap_findaddrs(pai, rrp, &want, addrsz, &cbyte, pai->arcount, dmstart);
937 if (st) return st;
938 if (!want) return adns_s_ok;
939
940 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
941 pai->dgram, pai->dglen, dmstart,
942 adns_r_addr, adns_qf_quoteok_query);
943 if (st) return st;
944
945 ctx.ext= 0;
946 ctx.callback= icb_hostaddr;
947 ctx.pinfo.hostaddr= rrp;
948
949 nflags= adns_qf_quoteok_query | (pai->qu->flags & adns__qf_afmask);
950 if (!(pai->qu->flags & adns_qf_cname_loose)) nflags |= adns_qf_cname_forbid;
951
952 st= addr_submit(pai->qu, &nqu, &pai->qu->vb, id, want,
953 nflags, pai->now, &ctx);
954 if (st) return st;
955
956 return adns_s_ok;
957 }
958
959 static adns_status pa_hostaddr(const parseinfo *pai, int cbyte,
960 int max, void *datap) {
961 adns_rr_hostaddr *rrp= datap;
962 adns_status st;
963
964 st= pap_hostaddr(pai, &cbyte, max, rrp);
965 if (st) return st;
966 if (cbyte != max) return adns_s_invaliddata;
967
968 return adns_s_ok;
969 }
970
971 static int dip_hostaddr(adns_state ads,
972 const adns_rr_hostaddr *ap, const adns_rr_hostaddr *bp) {
973 if (ap->astatus != bp->astatus) return ap->astatus;
974 if (ap->astatus) return 0;
975
976 return dip_sockaddr(ads, &ap->addrs[0].addr.sa, &bp->addrs[0].addr.sa);
977 }
978
979 static int di_hostaddr(adns_state ads,
980 const void *datap_a, const void *datap_b) {
981 const adns_rr_hostaddr *ap= datap_a, *bp= datap_b;
982
983 return dip_hostaddr(ads, ap,bp);
984 }
985
986 static void mfp_hostaddr(adns_query qu, adns_rr_hostaddr *rrp) {
987 void *tablev;
988 size_t sz = qu->answer->type & adns__qtf_bigaddr ?
989 sizeof(adns_rr_addr) : sizeof(adns_rr_addr_v4only);
990 adns__makefinal_str(qu,&rrp->host);
991 tablev= rrp->addrs;
992 adns__makefinal_block(qu, &tablev, rrp->naddrs*sz);
993 rrp->addrs= tablev;
994 }
995
996 static void mf_hostaddr(adns_query qu, void *datap) {
997 adns_rr_hostaddr *rrp= datap;
998
999 mfp_hostaddr(qu,rrp);
1000 }
1001
1002 static adns_status csp_hostaddr(vbuf *vb, const adns_rr_hostaddr *rrp) {
1003 const char *errstr;
1004 adns_status st;
1005 char buf[20];
1006 int i;
1007
1008 st= csp_domain(vb,rrp->host); if (st) return st;
1009
1010 CSP_ADDSTR(" ");
1011 CSP_ADDSTR(adns_errtypeabbrev(rrp->astatus));
1012
1013 sprintf(buf," %d ",rrp->astatus);
1014 CSP_ADDSTR(buf);
1015
1016 CSP_ADDSTR(adns_errabbrev(rrp->astatus));
1017 CSP_ADDSTR(" ");
1018
1019 errstr= adns_strerror(rrp->astatus);
1020 st= csp_qstring(vb,errstr,strlen(errstr)); if (st) return st;
1021
1022 if (rrp->naddrs >= 0) {
1023 CSP_ADDSTR(" (");
1024 for (i=0; i<rrp->naddrs; i++) {
1025 CSP_ADDSTR(" ");
1026 st= csp_addr(vb,&rrp->addrs[i]);
1027 }
1028 CSP_ADDSTR(" )");
1029 } else {
1030 CSP_ADDSTR(" ?");
1031 }
1032 return adns_s_ok;
1033 }
1034
1035 static adns_status cs_hostaddr(vbuf *vb, const void *datap) {
1036 const adns_rr_hostaddr *rrp= datap;
1037
1038 return csp_hostaddr(vb,rrp);
1039 }
1040
1041 /*
1042 * _mx_raw (pa,di)
1043 */
1044
1045 static adns_status pa_mx_raw(const parseinfo *pai, int cbyte,
1046 int max, void *datap) {
1047 const byte *dgram= pai->dgram;
1048 adns_rr_intstr *rrp= datap;
1049 adns_status st;
1050 int pref;
1051
1052 if (cbyte+2 > max) return adns_s_invaliddata;
1053 GET_W(cbyte,pref);
1054 rrp->i= pref;
1055 st= pap_domain(pai, &cbyte, max, &rrp->str,
1056 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1057 if (st) return st;
1058
1059 if (cbyte != max) return adns_s_invaliddata;
1060 return adns_s_ok;
1061 }
1062
1063 static int di_mx_raw(adns_state ads, const void *datap_a, const void *datap_b) {
1064 const adns_rr_intstr *ap= datap_a, *bp= datap_b;
1065
1066 if (ap->i < bp->i) return 0;
1067 if (ap->i > bp->i) return 1;
1068 return 0;
1069 }
1070
1071 /*
1072 * _mx (pa,di)
1073 */
1074
1075 static adns_status pa_mx(const parseinfo *pai, int cbyte,
1076 int max, void *datap) {
1077 const byte *dgram= pai->dgram;
1078 adns_rr_inthostaddr *rrp= datap;
1079 adns_status st;
1080 int pref;
1081
1082 if (cbyte+2 > max) return adns_s_invaliddata;
1083 GET_W(cbyte,pref);
1084 rrp->i= pref;
1085 st= pap_hostaddr(pai, &cbyte, max, &rrp->ha);
1086 if (st) return st;
1087
1088 if (cbyte != max) return adns_s_invaliddata;
1089 return adns_s_ok;
1090 }
1091
1092 static int di_mx(adns_state ads, const void *datap_a, const void *datap_b) {
1093 const adns_rr_inthostaddr *ap= datap_a, *bp= datap_b;
1094
1095 if (ap->i < bp->i) return 0;
1096 if (ap->i > bp->i) return 1;
1097 return dip_hostaddr(ads, &ap->ha, &bp->ha);
1098 }
1099
1100 /*
1101 * _inthostaddr (mf,cs)
1102 */
1103
1104 static void mf_inthostaddr(adns_query qu, void *datap) {
1105 adns_rr_inthostaddr *rrp= datap;
1106
1107 mfp_hostaddr(qu,&rrp->ha);
1108 }
1109
1110 static adns_status cs_inthostaddr(vbuf *vb, const void *datap) {
1111 const adns_rr_inthostaddr *rrp= datap;
1112 char buf[10];
1113
1114 sprintf(buf,"%u ",rrp->i);
1115 CSP_ADDSTR(buf);
1116
1117 return csp_hostaddr(vb,&rrp->ha);
1118 }
1119
1120 /*
1121 * _inthost (cs)
1122 */
1123
1124 static adns_status cs_inthost(vbuf *vb, const void *datap) {
1125 const adns_rr_intstr *rrp= datap;
1126 char buf[10];
1127
1128 sprintf(buf,"%u ",rrp->i);
1129 CSP_ADDSTR(buf);
1130 return csp_domain(vb,rrp->str);
1131 }
1132
1133 /*
1134 * _ptr (pa, +icb_ptr)
1135 */
1136
1137 static void icb_ptr(adns_query parent, adns_query child) {
1138 adns_answer *cans= child->answer;
1139 const union gen_addr *queried;
1140 const unsigned char *found;
1141 adns_state ads= parent->ads;
1142 int i;
1143
1144 if (cans->status == adns_s_nxdomain || cans->status == adns_s_nodata) {
1145 adns__query_fail(parent,adns_s_inconsistent);
1146 return;
1147 } else if (cans->status) {
1148 adns__query_fail(parent,cans->status);
1149 return;
1150 }
1151
1152 queried= &parent->ctx.tinfo.ptr.addr.addr;
1153 for (i=0, found=cans->rrs.bytes; i<cans->nrrs; i++, found += cans->rrsz) {
1154 if (!memcmp(queried,found,cans->rrsz)) {
1155 if (!parent->children.head) {
1156 adns__query_done(parent);
1157 return;
1158 } else {
1159 LIST_LINK_TAIL(ads->childw,parent);
1160 return;
1161 }
1162 }
1163 }
1164
1165 adns__query_fail(parent,adns_s_inconsistent);
1166 }
1167
1168 static const struct ptr_expectdomain {
1169 const afinfo *ai;
1170 const char *const tail[3];
1171 } ptr_expectdomain[PTR_NDOMAIN] = {
1172 { &adns__inet_afinfo, { DNS_INADDR_ARPA, 0 } },
1173 { &adns__inet6_afinfo, { DNS_IP6_ARPA, 0 } }
1174 };
1175
1176 static adns_status ckl_ptr(adns_state ads, adns_queryflags flags,
1177 union checklabel_state *css, qcontext *ctx,
1178 int labnum, const char *label, int lablen)
1179 {
1180 int i, found, ac;
1181 unsigned f = labnum ? css->ptr.domainmap : (1 << PTR_NDOMAIN) - 1;
1182 unsigned d;
1183 const char *tp;
1184 const struct ptr_expectdomain *ed;
1185 struct afinfo_addr *ap;
1186
1187 if (lablen) {
1188 for (ed = ptr_expectdomain, i = 0, d = 1;
1189 i < PTR_NDOMAIN;
1190 ed++, i++, d <<= 1) {
1191 if (!(f & d)) continue;
1192 if (labnum < ed->ai->nrevcomp) {
1193 ac = ed->ai->rev_parsecomp(label, lablen);
1194 if (ac < 0) goto mismatch;
1195 assert(labnum < sizeof(css->ptr.ipv[i]));
1196 css->ptr.ipv[i][labnum] = ac;
1197 } else {
1198 tp = ed->tail[labnum - ed->ai->nrevcomp];
1199 if (!tp || strncmp(label, tp, lablen) != 0 || tp[lablen])
1200 goto mismatch;
1201 }
1202 continue;
1203
1204 mismatch:
1205 f &= ~d;
1206 if (!f) return adns_s_querydomainwrong;
1207 }
1208 } else {
1209 found = -1;
1210 for (ed = ptr_expectdomain, i = 0, d = 1;
1211 i < PTR_NDOMAIN;
1212 ed++, i++, d <<= 1) {
1213 if (!(f & d)) continue;
1214 if (labnum >= ed->ai->nrevcomp && !ed->tail[labnum - ed->ai->nrevcomp])
1215 { found = i; continue; }
1216 f &= ~d;
1217 if (!f) return adns_s_querydomainwrong;
1218 }
1219 assert(found >= 0 && f == (1 << found));
1220
1221 ed = &ptr_expectdomain[found];
1222 ap = &ctx->tinfo.ptr.addr;
1223 ap->ai = ed->ai;
1224 ed->ai->rev_mkaddr(&ap->addr, css->ptr.ipv[found]);
1225 }
1226
1227 css->ptr.domainmap = f;
1228 return adns_s_ok;
1229 }
1230
1231 static adns_status pa_ptr(const parseinfo *pai, int dmstart,
1232 int max, void *datap) {
1233 char **rrp= datap;
1234 adns_status st;
1235 struct afinfo_addr *ap;
1236 int cbyte, id;
1237 adns_query nqu;
1238 qcontext ctx;
1239
1240 cbyte= dmstart;
1241 st= pap_domain(pai, &cbyte, max, rrp,
1242 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1243 if (st) return st;
1244 if (cbyte != max) return adns_s_invaliddata;
1245
1246 ap= &pai->qu->ctx.tinfo.ptr.addr;
1247 assert(ap->ai);
1248
1249 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
1250 pai->dgram, pai->dglen, dmstart,
1251 ap->ai->rrtype, adns_qf_quoteok_query);
1252 if (st) return st;
1253
1254 ctx.ext= 0;
1255 ctx.callback= icb_ptr;
1256 memset(&ctx.pinfo,0,sizeof(ctx.pinfo));
1257 memset(&ctx.tinfo,0,sizeof(ctx.tinfo));
1258 st= adns__internal_submit(pai->ads, &nqu, adns__findtype(ap->ai->rrtype),
1259 ap->ai->rrtype, &pai->qu->vb, id,
1260 adns_qf_quoteok_query, pai->now, &ctx);
1261 if (st) return st;
1262
1263 nqu->parent= pai->qu;
1264 LIST_LINK_TAIL_PART(pai->qu->children,nqu,siblings.);
1265 return adns_s_ok;
1266 }
1267
1268 /*
1269 * _strpair (mf)
1270 */
1271
1272 static void mf_strpair(adns_query qu, void *datap) {
1273 adns_rr_strpair *rrp= datap;
1274
1275 adns__makefinal_str(qu,&rrp->array[0]);
1276 adns__makefinal_str(qu,&rrp->array[1]);
1277 }
1278
1279 /*
1280 * _intstrpair (mf)
1281 */
1282
1283 static void mf_intstrpair(adns_query qu, void *datap) {
1284 adns_rr_intstrpair *rrp= datap;
1285
1286 adns__makefinal_str(qu,&rrp->array[0].str);
1287 adns__makefinal_str(qu,&rrp->array[1].str);
1288 }
1289
1290 /*
1291 * _hinfo (pa)
1292 */
1293
1294 static adns_status pa_hinfo(const parseinfo *pai, int cbyte,
1295 int max, void *datap) {
1296 adns_rr_intstrpair *rrp= datap;
1297 adns_status st;
1298 int i;
1299
1300 for (i=0; i<2; i++) {
1301 st= pap_qstring(pai, &cbyte, max, &rrp->array[i].i, &rrp->array[i].str);
1302 if (st) return st;
1303 }
1304
1305 if (cbyte != max) return adns_s_invaliddata;
1306
1307 return adns_s_ok;
1308 }
1309
1310 /*
1311 * _mailbox (pap,cs)
1312 */
1313
1314 static adns_status pap_mailbox822(const parseinfo *pai,
1315 int *cbyte_io, int max, char **mb_r) {
1316 int lablen, labstart, i, needquote, c, r, neednorm;
1317 const unsigned char *p;
1318 char *str;
1319 findlabel_state fls;
1320 adns_status st;
1321 vbuf *vb;
1322
1323 vb= &pai->qu->vb;
1324 vb->used= 0;
1325 adns__findlabel_start(&fls, pai->ads,
1326 -1, pai->qu,
1327 pai->dgram, pai->dglen, max,
1328 *cbyte_io, cbyte_io);
1329 st= adns__findlabel_next(&fls,&lablen,&labstart);
1330 if (!lablen) {
1331 adns__vbuf_appendstr(vb,".");
1332 goto x_ok;
1333 }
1334
1335 neednorm= 1;
1336 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++) {
1337 c= *p++;
1338 if ((c&~128) < 32 || (c&~128) == 127) return adns_s_invaliddata;
1339 if (c == '.' && !neednorm) neednorm= 1;
1340 else if (c==' ' || c>=127 || ctype_822special(c)) needquote++;
1341 else neednorm= 0;
1342 }
1343
1344 if (needquote || neednorm) {
1345 r= adns__vbuf_ensure(vb, lablen+needquote+4); if (!r) R_NOMEM;
1346 adns__vbuf_appendq(vb,"\"",1);
1347 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++, p++) {
1348 c= *p;
1349 if (c == '"' || c=='\\') adns__vbuf_appendq(vb,"\\",1);
1350 adns__vbuf_appendq(vb,p,1);
1351 }
1352 adns__vbuf_appendq(vb,"\"",1);
1353 } else {
1354 r= adns__vbuf_append(vb, pai->dgram+labstart, lablen); if (!r) R_NOMEM;
1355 }
1356
1357 r= adns__vbuf_appendstr(vb,"@"); if (!r) R_NOMEM;
1358
1359 st= adns__parse_domain_more(&fls,pai->ads, pai->qu,vb,0, pai->dgram);
1360 if (st) return st;
1361
1362 x_ok:
1363 str= adns__alloc_interim(pai->qu, vb->used+1); if (!str) R_NOMEM;
1364 memcpy(str,vb->buf,vb->used);
1365 str[vb->used]= 0;
1366 *mb_r= str;
1367 return adns_s_ok;
1368 }
1369
1370 static adns_status pap_mailbox(const parseinfo *pai, int *cbyte_io, int max,
1371 char **mb_r) {
1372 if (pai->qu->typei->typekey & adns__qtf_mail822) {
1373 return pap_mailbox822(pai, cbyte_io, max, mb_r);
1374 } else {
1375 return pap_domain(pai, cbyte_io, max, mb_r, pdf_quoteok);
1376 }
1377 }
1378
1379 static adns_status csp_mailbox(vbuf *vb, const char *mailbox) {
1380 return csp_domain(vb,mailbox);
1381 }
1382
1383 /*
1384 * _rp (pa,cs)
1385 */
1386
1387 static adns_status pa_rp(const parseinfo *pai, int cbyte,
1388 int max, void *datap) {
1389 adns_rr_strpair *rrp= datap;
1390 adns_status st;
1391
1392 st= pap_mailbox(pai, &cbyte, max, &rrp->array[0]);
1393 if (st) return st;
1394
1395 st= pap_domain(pai, &cbyte, max, &rrp->array[1], pdf_quoteok);
1396 if (st) return st;
1397
1398 if (cbyte != max) return adns_s_invaliddata;
1399 return adns_s_ok;
1400 }
1401
1402 static adns_status cs_rp(vbuf *vb, const void *datap) {
1403 const adns_rr_strpair *rrp= datap;
1404 adns_status st;
1405
1406 st= csp_mailbox(vb,rrp->array[0]); if (st) return st;
1407 CSP_ADDSTR(" ");
1408 st= csp_domain(vb,rrp->array[1]); if (st) return st;
1409
1410 return adns_s_ok;
1411 }
1412
1413 /*
1414 * _soa (pa,mf,cs)
1415 */
1416
1417 static adns_status pa_soa(const parseinfo *pai, int cbyte,
1418 int max, void *datap) {
1419 adns_rr_soa *rrp= datap;
1420 const byte *dgram= pai->dgram;
1421 adns_status st;
1422 int msw, lsw, i;
1423
1424 st= pap_domain(pai, &cbyte, max, &rrp->mname,
1425 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1426 if (st) return st;
1427
1428 st= pap_mailbox(pai, &cbyte, max, &rrp->rname);
1429 if (st) return st;
1430
1431 if (cbyte+20 != max) return adns_s_invaliddata;
1432
1433 for (i=0; i<5; i++) {
1434 GET_W(cbyte,msw);
1435 GET_W(cbyte,lsw);
1436 (&rrp->serial)[i]= (msw<<16) | lsw;
1437 }
1438
1439 return adns_s_ok;
1440 }
1441
1442 static void mf_soa(adns_query qu, void *datap) {
1443 adns_rr_soa *rrp= datap;
1444
1445 adns__makefinal_str(qu,&rrp->mname);
1446 adns__makefinal_str(qu,&rrp->rname);
1447 }
1448
1449 static adns_status cs_soa(vbuf *vb, const void *datap) {
1450 const adns_rr_soa *rrp= datap;
1451 char buf[20];
1452 int i;
1453 adns_status st;
1454
1455 st= csp_domain(vb,rrp->mname); if (st) return st;
1456 CSP_ADDSTR(" ");
1457 st= csp_mailbox(vb,rrp->rname); if (st) return st;
1458
1459 for (i=0; i<5; i++) {
1460 sprintf(buf," %lu",(&rrp->serial)[i]);
1461 CSP_ADDSTR(buf);
1462 }
1463
1464 return adns_s_ok;
1465 }
1466
1467 /*
1468 * _srv* (pa*2,di,cs*2,ckl,postsort)
1469 */
1470
1471 static adns_status ckl_srv(adns_state ads, adns_queryflags flags,
1472 union checklabel_state *css, qcontext *ctx,
1473 int labnum, const char *label, int lablen)
1474 {
1475 if (labnum < 2 && !(flags & adns_qf_quoteok_query)) {
1476 if (!lablen || label[0] != '_') return adns_s_querydomaininvalid;
1477 label++; lablen--;
1478 }
1479 return adns__ckl_hostname(ads, flags, css, ctx, labnum, label, lablen);
1480 }
1481
1482 static adns_status pap_srv_begin(const parseinfo *pai, int *cbyte_io, int max,
1483 adns_rr_srvha *rrp
1484 /* might be adns_rr_srvraw* */) {
1485 const byte *dgram= pai->dgram;
1486 int ti, cbyte;
1487
1488 cbyte= *cbyte_io;
1489 if ((*cbyte_io += 6) > max) return adns_s_invaliddata;
1490
1491 rrp->priority= GET_W(cbyte, ti);
1492 rrp->weight= GET_W(cbyte, ti);
1493 rrp->port= GET_W(cbyte, ti);
1494 return adns_s_ok;
1495 }
1496
1497 static adns_status pa_srvraw(const parseinfo *pai, int cbyte,
1498 int max, void *datap) {
1499 adns_rr_srvraw *rrp= datap;
1500 adns_status st;
1501
1502 st= pap_srv_begin(pai,&cbyte,max,datap);
1503 if (st) return st;
1504
1505 st= pap_domain(pai, &cbyte, max, &rrp->host,
1506 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1507 if (st) return st;
1508
1509 if (cbyte != max) return adns_s_invaliddata;
1510 return adns_s_ok;
1511 }
1512
1513 static adns_status pa_srvha(const parseinfo *pai, int cbyte,
1514 int max, void *datap) {
1515 adns_rr_srvha *rrp= datap;
1516 adns_status st;
1517
1518 st= pap_srv_begin(pai,&cbyte,max,datap); if (st) return st;
1519 st= pap_hostaddr(pai, &cbyte, max, &rrp->ha); if (st) return st;
1520 if (cbyte != max) return adns_s_invaliddata;
1521 return adns_s_ok;
1522 }
1523
1524 static void mf_srvraw(adns_query qu, void *datap) {
1525 adns_rr_srvraw *rrp= datap;
1526 adns__makefinal_str(qu, &rrp->host);
1527 }
1528
1529 static void mf_srvha(adns_query qu, void *datap) {
1530 adns_rr_srvha *rrp= datap;
1531 mfp_hostaddr(qu,&rrp->ha);
1532 }
1533
1534 static int di_srv(adns_state ads, const void *datap_a, const void *datap_b) {
1535 const adns_rr_srvraw *ap= datap_a, *bp= datap_b;
1536 /* might be const adns_rr_svhostaddr* */
1537
1538 if (ap->priority < bp->priority) return 0;
1539 if (ap->priority > bp->priority) return 1;
1540 return 0;
1541 }
1542
1543 static adns_status csp_srv_begin(vbuf *vb, const adns_rr_srvha *rrp
1544 /* might be adns_rr_srvraw* */) {
1545 char buf[30];
1546 sprintf(buf,"%u %u %u ", rrp->priority, rrp->weight, rrp->port);
1547 CSP_ADDSTR(buf);
1548 return adns_s_ok;
1549 }
1550
1551 static adns_status cs_srvraw(vbuf *vb, const void *datap) {
1552 const adns_rr_srvraw *rrp= datap;
1553 adns_status st;
1554
1555 st= csp_srv_begin(vb,(const void*)rrp); if (st) return st;
1556 return csp_domain(vb,rrp->host);
1557 }
1558
1559 static adns_status cs_srvha(vbuf *vb, const void *datap) {
1560 const adns_rr_srvha *rrp= datap;
1561 adns_status st;
1562
1563 st= csp_srv_begin(vb,(const void*)datap); if (st) return st;
1564 return csp_hostaddr(vb,&rrp->ha);
1565 }
1566
1567 static void postsort_srv(adns_state ads, void *array, int nrrs,
1568 const struct typeinfo *typei) {
1569 /* we treat everything in the array as if it were an adns_rr_srvha
1570 * even though the array might be of adns_rr_srvraw. That's OK
1571 * because they have the same prefix, which is all we access.
1572 * We use typei->rrsz, too, rather than naive array indexing, of course.
1573 */
1574 char *workbegin, *workend, *search, *arrayend;
1575 const adns_rr_srvha *rr;
1576 union { adns_rr_srvha ha; adns_rr_srvraw raw; } rrtmp;
1577 int cpriority, totalweight, runtotal;
1578 long randval;
1579
1580 for (workbegin= array, arrayend= workbegin + typei->rrsz * nrrs;
1581 workbegin < arrayend;
1582 workbegin= workend) {
1583 cpriority= (rr=(void*)workbegin)->priority;
1584
1585 for (workend= workbegin, totalweight= 0;
1586 workend < arrayend && (rr=(void*)workend)->priority == cpriority;
1587 workend += typei->rrsz) {
1588 totalweight += rr->weight;
1589 }
1590
1591 /* Now workbegin..(workend-1) incl. are exactly all of the RRs of
1592 * cpriority. From now on, workbegin points to the `remaining'
1593 * records: we select one record at a time (RFC2782 `Usage rules'
1594 * and `Format of the SRV RR' subsection `Weight') to place at
1595 * workbegin (swapping with the one that was there, and then
1596 * advance workbegin. */
1597 for (;
1598 workbegin + typei->rrsz < workend; /* don't bother if just one */
1599 workbegin += typei->rrsz) {
1600
1601 randval= nrand48(ads->rand48xsubi);
1602 randval %= (totalweight + 1);
1603 /* makes it into 0..totalweight inclusive; with 2^10 RRs,
1604 * totalweight must be <= 2^26 so probability nonuniformity is
1605 * no worse than 1 in 2^(31-26) ie 1 in 2^5, ie
1606 * abs(log(P_intended(RR_i) / P_actual(RR_i)) <= log(2^-5).
1607 */
1608
1609 for (search=workbegin, runtotal=0;
1610 (runtotal += (rr=(void*)search)->weight) < randval;
1611 search += typei->rrsz);
1612 assert(search < arrayend);
1613 totalweight -= rr->weight;
1614 if (search != workbegin) {
1615 memcpy(&rrtmp, workbegin, typei->rrsz);
1616 memcpy(workbegin, search, typei->rrsz);
1617 memcpy(search, &rrtmp, typei->rrsz);
1618 }
1619 }
1620 }
1621 /* tests:
1622 * dig -t srv _srv._tcp.test.iwj.relativity.greenend.org.uk.
1623 * ./adnshost_s -t srv- _sip._udp.voip.net.cam.ac.uk.
1624 * ./adnshost_s -t srv- _jabber._tcp.jabber.org
1625 */
1626 }
1627
1628 /*
1629 * _byteblock (mf)
1630 */
1631
1632 static void mf_byteblock(adns_query qu, void *datap) {
1633 adns_rr_byteblock *rrp= datap;
1634 void *bytes= rrp->data;
1635 adns__makefinal_block(qu,&bytes,rrp->len);
1636 rrp->data= bytes;
1637 }
1638
1639 /*
1640 * _opaque (pa,cs)
1641 */
1642
1643 static adns_status pa_opaque(const parseinfo *pai, int cbyte,
1644 int max, void *datap) {
1645 adns_rr_byteblock *rrp= datap;
1646
1647 rrp->len= max - cbyte;
1648 rrp->data= adns__alloc_interim(pai->qu, rrp->len);
1649 if (!rrp->data) R_NOMEM;
1650 memcpy(rrp->data, pai->dgram + cbyte, rrp->len);
1651 return adns_s_ok;
1652 }
1653
1654 static adns_status cs_opaque(vbuf *vb, const void *datap) {
1655 const adns_rr_byteblock *rrp= datap;
1656 char buf[10];
1657 int l;
1658 unsigned char *p;
1659
1660 sprintf(buf,"\\# %d",rrp->len);
1661 CSP_ADDSTR(buf);
1662
1663 for (l= rrp->len, p= rrp->data;
1664 l>=4;
1665 l -= 4, p += 4) {
1666 sprintf(buf," %02x%02x%02x%02x",p[0],p[1],p[2],p[3]);
1667 CSP_ADDSTR(buf);
1668 }
1669 for (;
1670 l>0;
1671 l--, p++) {
1672 sprintf(buf," %02x",*p);
1673 CSP_ADDSTR(buf);
1674 }
1675 return adns_s_ok;
1676 }
1677
1678 /*
1679 * _flat (mf)
1680 */
1681
1682 static void mf_flat(adns_query qu, void *data) { }
1683
1684 /*
1685 * Now the table.
1686 */
1687
1688 #define TYPESZ_M(member) (sizeof(*((adns_answer*)0)->rrs.member))
1689
1690 #define DEEP_MEMB(memb) TYPESZ_M(memb), mf_##memb, cs_##memb
1691 #define FLAT_MEMB(memb) TYPESZ_M(memb), mf_flat, cs_##memb
1692
1693 #define DEEP_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
1694 { adns_r_##code & adns_rrt_reprmask, rrt,fmt,TYPESZ_M(memb), \
1695 mf_##memb, printer,parser,comparer, adns__ckl_hostname,0,0,0 }
1696 #define FLAT_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
1697 { adns_r_##code & adns_rrt_reprmask, rrt,fmt,TYPESZ_M(memb), \
1698 mf_flat, printer,parser,comparer, adns__ckl_hostname,0,0,0 }
1699 #define XTRA_TYPE(code,rrt,fmt,memb,parser,comparer,printer, \
1700 makefinal,ckl,postsort,getrrsz,sender) \
1701 { adns_r_##code & adns_rrt_reprmask, rrt,fmt,TYPESZ_M(memb), makefinal, \
1702 printer,parser,comparer,ckl,postsort,getrrsz,sender }
1703
1704 static const typeinfo typeinfos[] = {
1705 /* Must be in ascending order of rrtype ! */
1706 /* mem-mgmt code rrt fmt member parser comparer printer */
1707
1708 FLAT_TYPE(a, "A", 0, inaddr, pa_inaddr, di_inaddr,cs_inaddr ),
1709 DEEP_TYPE(ns_raw, "NS", "raw",str, pa_host_raw,0, cs_domain ),
1710 DEEP_TYPE(cname, "CNAME", 0, str, pa_dom_raw, 0, cs_domain ),
1711 DEEP_TYPE(soa_raw,"SOA", "raw",soa, pa_soa, 0, cs_soa ),
1712 DEEP_TYPE(ptr_raw,"PTR", "raw",str, pa_host_raw,0, cs_domain ),
1713 DEEP_TYPE(hinfo, "HINFO", 0, intstrpair,pa_hinfo, 0, cs_hinfo ),
1714 DEEP_TYPE(mx_raw, "MX", "raw",intstr, pa_mx_raw, di_mx_raw,cs_inthost ),
1715 DEEP_TYPE(txt, "TXT", 0, manyistr,pa_txt, 0, cs_txt ),
1716 DEEP_TYPE(rp_raw, "RP", "raw",strpair, pa_rp, 0, cs_rp ),
1717 FLAT_TYPE(aaaa, "AAAA", 0, in6addr, pa_in6addr, di_in6addr,cs_in6addr ),
1718 XTRA_TYPE(srv_raw,"SRV", "raw",srvraw , pa_srvraw, di_srv, cs_srvraw,
1719 mf_srvraw, ckl_srv, postsort_srv, 0, 0),
1720
1721 XTRA_TYPE(addr, "A", "addr", addr, pa_addr, di_addr, cs_addr,
1722 mf_flat, adns__ckl_hostname, 0, gsz_addr, qs_addr),
1723 DEEP_TYPE(ns, "NS", "+addr",hostaddr,pa_hostaddr,di_hostaddr,cs_hostaddr ),
1724 XTRA_TYPE(ptr, "PTR","checked",str, pa_ptr, 0, cs_domain,
1725 mf_str, ckl_ptr, 0, 0, 0),
1726 DEEP_TYPE(mx, "MX", "+addr",inthostaddr,pa_mx, di_mx, cs_inthostaddr),
1727 XTRA_TYPE(srv, "SRV","+addr",srvha, pa_srvha, di_srv, cs_srvha,
1728 mf_srvha, ckl_srv, postsort_srv, 0, 0),
1729
1730 DEEP_TYPE(soa, "SOA","822", soa, pa_soa, 0, cs_soa ),
1731 DEEP_TYPE(rp, "RP", "822", strpair, pa_rp, 0, cs_rp ),
1732 };
1733
1734 static const typeinfo tinfo_addrsub =
1735 XTRA_TYPE(none, "<addr>","sub",addr, pa_addr, 0, cs_addr,
1736 mf_flat, adns__ckl_hostname, 0, gsz_addr, 0);
1737
1738 static const typeinfo typeinfo_unknown=
1739 DEEP_TYPE(unknown,0, "unknown",byteblock,pa_opaque, 0, cs_opaque );
1740
1741 const typeinfo *adns__findtype(adns_rrtype type) {
1742 const typeinfo *begin, *end, *mid;
1743
1744 if (type & adns_r_unknown) return &typeinfo_unknown;
1745 type &= adns_rrt_reprmask;
1746
1747 begin= typeinfos; end= typeinfos+(sizeof(typeinfos)/sizeof(typeinfo));
1748
1749 while (begin < end) {
1750 mid= begin + ((end-begin)>>1);
1751 if (mid->typekey == type) return mid;
1752 if (type > mid->typekey) begin= mid+1;
1753 else end= mid;
1754 }
1755 return 0;
1756 }