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