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