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