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