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