a34f046cd111165d55f47707407d1223727c9be6
[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 <stdlib.h>
28
29 #include <sys/types.h>
30 #include <sys/socket.h>
31 #include <netinet/in.h>
32 #include <arpa/inet.h>
33
34 #include "internal.h"
35
36 #define R_NOMEM return adns_s_nomemory
37 #define CSP_ADDSTR(s) do { \
38 if (!adns__vbuf_appendstr(vb,(s))) R_NOMEM; \
39 } while (0)
40
41 /*
42 * order of sections:
43 *
44 * _string (pap)
45 * _textdata, _qstring (csp)
46 * _str (mf,cs)
47 * _intstr (mf,csp,cs)
48 * _manyistr (mf,cs)
49 * _txt (pa)
50 * _inaddr (pa,cs,di, +search_sortlist, dip_genaddr)
51 * _in6addr (pa,cs,di)
52 * _addr (pa,di,csp,cs, +search_sortlist_sa, dip_sockaddr)
53 * _domain (pap)
54 * _host_raw (pa)
55 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +pap_findaddrs)
56 * _mx_raw (pa,di)
57 * _mx (pa,di)
58 * _inthostaddr (mf,cs)
59 * _ptr (pa)
60 * _strpair (mf,cs)
61 * _intstrpair (mf,cs)
62 * _hinfo (pa)
63 * _mailbox (pap +pap_mailbox822)
64 * _rp (pa)
65 * _soa (pa,mf,cs)
66 * _srv* (qdpl,(pap),pa,mf,di,(csp),cs,postsort)
67 * _byteblock (mf)
68 * _opaque (pa,cs)
69 * _flat (mf)
70 *
71 * within each section:
72 * qdpl_*
73 * pap_*
74 * pa_*
75 * dip_*
76 * di_*
77 * mfp_*
78 * mf_*
79 * csp_*
80 * cs_*
81 * postsort_*
82 */
83
84 /*
85 * _qstring (pap,csp)
86 */
87
88 static adns_status pap_qstring(const parseinfo *pai, int *cbyte_io, int max,
89 int *len_r, char **str_r) {
90 /* Neither len_r nor str_r may be null.
91 * End of datagram (overrun) is indicated by returning adns_s_invaliddata;
92 */
93 const byte *dgram= pai->dgram;
94 int l, cbyte;
95 char *str;
96
97 cbyte= *cbyte_io;
98
99 if (cbyte >= max) return adns_s_invaliddata;
100 GET_B(cbyte,l);
101 if (cbyte+l > max) return adns_s_invaliddata;
102
103 str= adns__alloc_interim(pai->qu, l+1);
104 if (!str) R_NOMEM;
105
106 str[l]= 0;
107 memcpy(str,dgram+cbyte,l);
108
109 *len_r= l;
110 *str_r= str;
111 *cbyte_io= cbyte+l;
112
113 return adns_s_ok;
114 }
115
116 static adns_status csp_qstring(vbuf *vb, const char *dp, int len) {
117 unsigned char ch;
118 char buf[10];
119 int cn;
120
121 CSP_ADDSTR("\"");
122 for (cn=0; cn<len; cn++) {
123 ch= *dp++;
124 if (ch == '\\') {
125 CSP_ADDSTR("\\\\");
126 } else if (ch == '"') {
127 CSP_ADDSTR("\\\"");
128 } else if (ch >= 32 && ch <= 126) {
129 if (!adns__vbuf_append(vb,&ch,1)) R_NOMEM;
130 } else {
131 sprintf(buf,"\\x%02x",ch);
132 CSP_ADDSTR(buf);
133 }
134 }
135 CSP_ADDSTR("\"");
136
137 return adns_s_ok;
138 }
139
140 /*
141 * _str (mf)
142 */
143
144 static void mf_str(adns_query qu, void *datap) {
145 char **rrp= datap;
146
147 adns__makefinal_str(qu,rrp);
148 }
149
150 /*
151 * _intstr (mf)
152 */
153
154 static void mf_intstr(adns_query qu, void *datap) {
155 adns_rr_intstr *rrp= datap;
156
157 adns__makefinal_str(qu,&rrp->str);
158 }
159
160 /*
161 * _manyistr (mf)
162 */
163
164 static void mf_manyistr(adns_query qu, void *datap) {
165 adns_rr_intstr **rrp= datap;
166 adns_rr_intstr *te, *table;
167 void *tablev;
168 int tc;
169
170 for (tc=0, te= *rrp; te->i >= 0; te++, tc++);
171 tablev= *rrp;
172 adns__makefinal_block(qu,&tablev,sizeof(*te)*(tc+1));
173 *rrp= table= tablev;
174 for (te= *rrp; te->i >= 0; te++)
175 adns__makefinal_str(qu,&te->str);
176 }
177
178 /*
179 * _txt (pa,cs)
180 */
181
182 static adns_status pa_txt(const parseinfo *pai, int cbyte,
183 int max, void *datap) {
184 adns_rr_intstr **rrp= datap, *table, *te;
185 const byte *dgram= pai->dgram;
186 int ti, tc, l, startbyte;
187 adns_status st;
188
189 startbyte= cbyte;
190 if (cbyte >= max) return adns_s_invaliddata;
191 tc= 0;
192 while (cbyte < max) {
193 GET_B(cbyte,l);
194 cbyte+= l;
195 tc++;
196 }
197 if (cbyte != max || !tc) return adns_s_invaliddata;
198
199 table= adns__alloc_interim(pai->qu,sizeof(*table)*(tc+1));
200 if (!table) R_NOMEM;
201
202 for (cbyte=startbyte, ti=0, te=table; ti<tc; ti++, te++) {
203 st= pap_qstring(pai, &cbyte, max, &te->i, &te->str);
204 if (st) return st;
205 }
206 assert(cbyte == max);
207
208 te->i= -1;
209 te->str= 0;
210
211 *rrp= table;
212 return adns_s_ok;
213 }
214
215 static adns_status cs_txt(vbuf *vb, const void *datap) {
216 const adns_rr_intstr *const *rrp= datap;
217 const adns_rr_intstr *current;
218 adns_status st;
219 int spc;
220
221 for (current= *rrp, spc=0; current->i >= 0; current++, spc=1) {
222 if (spc) CSP_ADDSTR(" ");
223 st= csp_qstring(vb,current->str,current->i); if (st) return st;
224 }
225 return adns_s_ok;
226 }
227
228 /*
229 * _hinfo (cs)
230 */
231
232 static adns_status cs_hinfo(vbuf *vb, const void *datap) {
233 const adns_rr_intstrpair *rrp= datap;
234 adns_status st;
235
236 st= csp_qstring(vb,rrp->array[0].str,rrp->array[0].i); if (st) return st;
237 CSP_ADDSTR(" ");
238 st= csp_qstring(vb,rrp->array[1].str,rrp->array[1].i); if (st) return st;
239 return adns_s_ok;
240 }
241
242 /*
243 * _inaddr (pa,di,cs +search_sortlist, dip_genaddr)
244 */
245
246 static adns_status pa_inaddr(const parseinfo *pai, int cbyte,
247 int max, void *datap) {
248 struct in_addr *storeto= datap;
249
250 if (max-cbyte != 4) return adns_s_invaliddata;
251 memcpy(storeto, pai->dgram + cbyte, 4);
252 return adns_s_ok;
253 }
254
255 static int search_sortlist(adns_state ads, int af, const void *ad) {
256 const struct sortlist *slp;
257 const struct in6_addr *a6;
258 union gen_addr a;
259 int i;
260 int v6mappedp = 0;
261
262 if (af == AF_INET6) {
263 a6 = ad;
264 if (IN6_IS_ADDR_V4MAPPED(a6)) {
265 a.v4.s_addr = htonl(((unsigned long)a6->s6_addr[12] << 24) |
266 ((unsigned long)a6->s6_addr[13] << 16) |
267 ((unsigned long)a6->s6_addr[14] << 8) |
268 ((unsigned long)a6->s6_addr[15] << 0));
269 v6mappedp = 1;
270 }
271 }
272
273 for (i=0, slp=ads->sortlist;
274 i<ads->nsortlist &&
275 !(af == slp->ai->af &&
276 slp->ai->matchp(ad, &slp->base, &slp->mask)) &&
277 !(v6mappedp && slp->ai->af == AF_INET &&
278 slp->ai->matchp(&a, &slp->base, &slp->mask));
279 i++, slp++);
280 return i;
281 }
282
283 static int dip_genaddr(adns_state ads, int af, const void *a, const void *b) {
284 int ai, bi;
285
286 if (!ads->nsortlist) return 0;
287
288 ai= search_sortlist(ads,af,a);
289 bi= search_sortlist(ads,af,b);
290 return bi<ai;
291 }
292
293 static int di_inaddr(adns_state ads,
294 const void *datap_a, const void *datap_b) {
295 return dip_genaddr(ads,AF_INET,datap_a,datap_b);
296 }
297
298 static adns_status cs_inaddr(vbuf *vb, const void *datap) {
299 const struct in_addr *rrp= datap, rr= *rrp;
300 const char *ia;
301
302 ia= inet_ntoa(rr); assert(ia);
303 CSP_ADDSTR(ia);
304 return adns_s_ok;
305 }
306
307 /*
308 * _in6addr (pa,di,cs)
309 */
310
311 static adns_status pa_in6addr(const parseinfo *pai, int cbyte,
312 int max, void *datap) {
313 struct in6_addr *storeto= datap;
314
315 if (max-cbyte != 16) return adns_s_invaliddata;
316 memcpy(storeto->s6_addr, pai->dgram + cbyte, 16);
317 return adns_s_ok;
318 }
319
320 static int di_in6addr(adns_state ads,
321 const void *datap_a, const void *datap_b) {
322 return dip_genaddr(ads,AF_INET6,datap_a,AF_INET6,datap_b);
323 }
324
325 static adns_status cs_in6addr(vbuf *vb, const void *datap) {
326 char buf[INET6_ADDRSTRLEN];
327 const char *ia;
328
329 ia= inet_ntop(AF_INET6, datap, buf, sizeof(buf)); assert(ia);
330 CSP_ADDSTR(ia);
331 return adns_s_ok;
332 }
333
334 /*
335 * _addr (pa,di,csp,cs, +search_sortlist_sa, dip_sockaddr)
336 */
337
338 static adns_status pa_addr(const parseinfo *pai, int cbyte,
339 int max, void *datap) {
340 adns_rr_addr *storeto= datap;
341 const byte *dgram= pai->dgram;
342
343 if (max-cbyte != 4) return adns_s_invaliddata;
344 storeto->len= sizeof(storeto->addr.inet);
345 memset(&storeto->addr,0,sizeof(storeto->addr.inet));
346 storeto->addr.inet.sin_family= AF_INET;
347 memcpy(&storeto->addr.inet.sin_addr,dgram+cbyte,4);
348 return adns_s_ok;
349 }
350
351 static int search_sortlist_sa(adns_state ads, const struct sockaddr *sa)
352 {
353 const struct afinfo *ai = 0;
354
355 switch (sa->sa_family) {
356 case AF_INET: ai = &adns__inet_afinfo; break;
357 case AF_INET6: ai = &adns__inet6_afinfo; break;
358 }
359 assert(ai);
360
361 return search_sortlist(ads, sa->sa_family, ai->sockaddr_to_inaddr(sa));
362 }
363
364 static int dip_sockaddr(adns_state ads,
365 const struct sockaddr *sa,
366 const struct sockaddr *sb)
367 {
368 if (!ads->sortlist) return 0;
369 return search_sortlist_sa(ads, sa) > search_sortlist_sa(ads, sb);
370 }
371
372 static int di_addr(adns_state ads, const void *datap_a, const void *datap_b) {
373 const adns_rr_addr *ap= datap_a, *bp= datap_b;
374
375 return dip_sockaddr(ads, &ap->addr.sa, &bp->addr.sa);
376 }
377
378 static int div_addr(void *context, const void *datap_a, const void *datap_b) {
379 const adns_state ads= context;
380
381 return di_addr(ads, datap_a, datap_b);
382 }
383
384 static adns_status csp_addr(vbuf *vb, const adns_rr_addr *rrp) {
385 const char *ia;
386 char buf[30];
387
388 switch (rrp->addr.inet.sin_family) {
389 case AF_INET:
390 CSP_ADDSTR("INET ");
391 ia= inet_ntoa(rrp->addr.inet.sin_addr); assert(ia);
392 CSP_ADDSTR(ia);
393 break;
394 default:
395 sprintf(buf,"AF=%u",rrp->addr.sa.sa_family);
396 CSP_ADDSTR(buf);
397 break;
398 }
399 return adns_s_ok;
400 }
401
402 static adns_status cs_addr(vbuf *vb, const void *datap) {
403 const adns_rr_addr *rrp= datap;
404
405 return csp_addr(vb,rrp);
406 }
407
408 /*
409 * _domain (pap,csp,cs)
410 * _dom_raw (pa)
411 */
412
413 static adns_status pap_domain(const parseinfo *pai, int *cbyte_io, int max,
414 char **domain_r, parsedomain_flags flags) {
415 adns_status st;
416 char *dm;
417
418 st= adns__parse_domain(pai->qu->ads, pai->serv, pai->qu, &pai->qu->vb, flags,
419 pai->dgram,pai->dglen, cbyte_io, max);
420 if (st) return st;
421 if (!pai->qu->vb.used) return adns_s_invaliddata;
422
423 dm= adns__alloc_interim(pai->qu, pai->qu->vb.used+1);
424 if (!dm) R_NOMEM;
425
426 dm[pai->qu->vb.used]= 0;
427 memcpy(dm,pai->qu->vb.buf,pai->qu->vb.used);
428
429 *domain_r= dm;
430 return adns_s_ok;
431 }
432
433 static adns_status csp_domain(vbuf *vb, const char *domain) {
434 CSP_ADDSTR(domain);
435 if (!*domain) CSP_ADDSTR(".");
436 return adns_s_ok;
437 }
438
439 static adns_status cs_domain(vbuf *vb, const void *datap) {
440 const char *const *domainp= datap;
441 return csp_domain(vb,*domainp);
442 }
443
444 static adns_status pa_dom_raw(const parseinfo *pai, int cbyte,
445 int max, void *datap) {
446 char **rrp= datap;
447 adns_status st;
448
449 st= pap_domain(pai, &cbyte, max, rrp, pdf_quoteok);
450 if (st) return st;
451
452 if (cbyte != max) return adns_s_invaliddata;
453 return adns_s_ok;
454 }
455
456 /*
457 * _host_raw (pa)
458 */
459
460 static adns_status pa_host_raw(const parseinfo *pai, int cbyte,
461 int max, void *datap) {
462 char **rrp= datap;
463 adns_status st;
464
465 st= pap_domain(pai, &cbyte, max, rrp,
466 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
467 if (st) return st;
468
469 if (cbyte != max) return adns_s_invaliddata;
470 return adns_s_ok;
471 }
472
473 /*
474 * _hostaddr (pap,pa,dip,di,mfp,mf,csp,cs +icb_hostaddr, pap_findaddrs)
475 */
476
477 static adns_status pap_findaddrs(const parseinfo *pai, adns_rr_hostaddr *ha,
478 int *cbyte_io, int count, int dmstart) {
479 int rri, naddrs;
480 int type, class, rdlen, rdstart, ownermatched;
481 unsigned long ttl;
482 adns_status st;
483
484 for (rri=0, naddrs=-1; rri<count; rri++) {
485 st= adns__findrr_anychk(pai->qu, pai->serv, pai->dgram,
486 pai->dglen, cbyte_io,
487 &type, &class, &ttl, &rdlen, &rdstart,
488 pai->dgram, pai->dglen, dmstart, &ownermatched);
489 if (st) return st;
490 if (!ownermatched || class != DNS_CLASS_IN || type != adns_r_a) {
491 if (naddrs>0) break; else continue;
492 }
493 if (naddrs == -1) {
494 naddrs= 0;
495 }
496 if (!adns__vbuf_ensure(&pai->qu->vb, (naddrs+1)*sizeof(adns_rr_addr)))
497 R_NOMEM;
498 adns__update_expires(pai->qu,ttl,pai->now);
499 st= pa_addr(pai, rdstart,rdstart+rdlen,
500 pai->qu->vb.buf + naddrs*sizeof(adns_rr_addr));
501 if (st) return st;
502 naddrs++;
503 }
504 if (naddrs >= 0) {
505 ha->addrs= adns__alloc_interim(pai->qu, naddrs*sizeof(adns_rr_addr));
506 if (!ha->addrs) R_NOMEM;
507 memcpy(ha->addrs, pai->qu->vb.buf, naddrs*sizeof(adns_rr_addr));
508 ha->naddrs= naddrs;
509 ha->astatus= adns_s_ok;
510
511 adns__isort(ha->addrs, naddrs, sizeof(adns_rr_addr), pai->qu->vb.buf,
512 div_addr, pai->ads);
513 }
514 return adns_s_ok;
515 }
516
517 static void icb_hostaddr(adns_query parent, adns_query child) {
518 adns_answer *cans= child->answer;
519 adns_rr_hostaddr *rrp= child->ctx.info.hostaddr;
520 adns_state ads= parent->ads;
521 adns_status st;
522
523 st= cans->status;
524 rrp->astatus= st;
525 rrp->naddrs= (st>0 && st<=adns_s_max_tempfail) ? -1 : cans->nrrs;
526 rrp->addrs= cans->rrs.addr;
527 adns__transfer_interim(child, parent, rrp->addrs,
528 rrp->naddrs*sizeof(adns_rr_addr));
529
530 if (parent->children.head) {
531 LIST_LINK_TAIL(ads->childw,parent);
532 } else {
533 adns__query_done(parent);
534 }
535 }
536
537 static adns_status pap_hostaddr(const parseinfo *pai, int *cbyte_io,
538 int max, adns_rr_hostaddr *rrp) {
539 adns_status st;
540 int dmstart, cbyte;
541 qcontext ctx;
542 int id;
543 adns_query nqu;
544 adns_queryflags nflags;
545
546 dmstart= cbyte= *cbyte_io;
547 st= pap_domain(pai, &cbyte, max, &rrp->host,
548 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
549 if (st) return st;
550 *cbyte_io= cbyte;
551
552 rrp->astatus= adns_s_ok;
553 rrp->naddrs= -1;
554 rrp->addrs= 0;
555
556 cbyte= pai->nsstart;
557
558 st= pap_findaddrs(pai, rrp, &cbyte, pai->nscount, dmstart);
559 if (st) return st;
560 if (rrp->naddrs != -1) return adns_s_ok;
561
562 st= pap_findaddrs(pai, rrp, &cbyte, pai->arcount, dmstart);
563 if (st) return st;
564 if (rrp->naddrs != -1) return adns_s_ok;
565
566 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
567 pai->dgram, pai->dglen, dmstart,
568 adns_r_addr, adns_qf_quoteok_query);
569 if (st) return st;
570
571 ctx.ext= 0;
572 ctx.callback= icb_hostaddr;
573 ctx.info.hostaddr= rrp;
574
575 nflags= adns_qf_quoteok_query;
576 if (!(pai->qu->flags & adns_qf_cname_loose)) nflags |= adns_qf_cname_forbid;
577
578 st= adns__internal_submit(pai->ads, &nqu, adns__findtype(adns_r_addr),
579 &pai->qu->vb, id, nflags, pai->now, &ctx);
580 if (st) return st;
581
582 nqu->parent= pai->qu;
583 LIST_LINK_TAIL_PART(pai->qu->children,nqu,siblings.);
584
585 return adns_s_ok;
586 }
587
588 static adns_status pa_hostaddr(const parseinfo *pai, int cbyte,
589 int max, void *datap) {
590 adns_rr_hostaddr *rrp= datap;
591 adns_status st;
592
593 st= pap_hostaddr(pai, &cbyte, max, rrp);
594 if (st) return st;
595 if (cbyte != max) return adns_s_invaliddata;
596
597 return adns_s_ok;
598 }
599
600 static int dip_hostaddr(adns_state ads,
601 const adns_rr_hostaddr *ap, const adns_rr_hostaddr *bp) {
602 if (ap->astatus != bp->astatus) return ap->astatus;
603 if (ap->astatus) return 0;
604
605 return dip_sockaddr(ads, &ap->addrs[0].addr.sa, &bp->addrs[0].addr.sa);
606 }
607
608 static int di_hostaddr(adns_state ads,
609 const void *datap_a, const void *datap_b) {
610 const adns_rr_hostaddr *ap= datap_a, *bp= datap_b;
611
612 return dip_hostaddr(ads, ap,bp);
613 }
614
615 static void mfp_hostaddr(adns_query qu, adns_rr_hostaddr *rrp) {
616 void *tablev;
617
618 adns__makefinal_str(qu,&rrp->host);
619 tablev= rrp->addrs;
620 adns__makefinal_block(qu, &tablev, rrp->naddrs*sizeof(*rrp->addrs));
621 rrp->addrs= tablev;
622 }
623
624 static void mf_hostaddr(adns_query qu, void *datap) {
625 adns_rr_hostaddr *rrp= datap;
626
627 mfp_hostaddr(qu,rrp);
628 }
629
630 static adns_status csp_hostaddr(vbuf *vb, const adns_rr_hostaddr *rrp) {
631 const char *errstr;
632 adns_status st;
633 char buf[20];
634 int i;
635
636 st= csp_domain(vb,rrp->host); if (st) return st;
637
638 CSP_ADDSTR(" ");
639 CSP_ADDSTR(adns_errtypeabbrev(rrp->astatus));
640
641 sprintf(buf," %d ",rrp->astatus);
642 CSP_ADDSTR(buf);
643
644 CSP_ADDSTR(adns_errabbrev(rrp->astatus));
645 CSP_ADDSTR(" ");
646
647 errstr= adns_strerror(rrp->astatus);
648 st= csp_qstring(vb,errstr,strlen(errstr)); if (st) return st;
649
650 if (rrp->naddrs >= 0) {
651 CSP_ADDSTR(" (");
652 for (i=0; i<rrp->naddrs; i++) {
653 CSP_ADDSTR(" ");
654 st= csp_addr(vb,&rrp->addrs[i]);
655 }
656 CSP_ADDSTR(" )");
657 } else {
658 CSP_ADDSTR(" ?");
659 }
660 return adns_s_ok;
661 }
662
663 static adns_status cs_hostaddr(vbuf *vb, const void *datap) {
664 const adns_rr_hostaddr *rrp= datap;
665
666 return csp_hostaddr(vb,rrp);
667 }
668
669 /*
670 * _mx_raw (pa,di)
671 */
672
673 static adns_status pa_mx_raw(const parseinfo *pai, int cbyte,
674 int max, void *datap) {
675 const byte *dgram= pai->dgram;
676 adns_rr_intstr *rrp= datap;
677 adns_status st;
678 int pref;
679
680 if (cbyte+2 > max) return adns_s_invaliddata;
681 GET_W(cbyte,pref);
682 rrp->i= pref;
683 st= pap_domain(pai, &cbyte, max, &rrp->str,
684 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
685 if (st) return st;
686
687 if (cbyte != max) return adns_s_invaliddata;
688 return adns_s_ok;
689 }
690
691 static int di_mx_raw(adns_state ads, const void *datap_a, const void *datap_b) {
692 const adns_rr_intstr *ap= datap_a, *bp= datap_b;
693
694 if (ap->i < bp->i) return 0;
695 if (ap->i > bp->i) return 1;
696 return 0;
697 }
698
699 /*
700 * _mx (pa,di)
701 */
702
703 static adns_status pa_mx(const parseinfo *pai, int cbyte,
704 int max, void *datap) {
705 const byte *dgram= pai->dgram;
706 adns_rr_inthostaddr *rrp= datap;
707 adns_status st;
708 int pref;
709
710 if (cbyte+2 > max) return adns_s_invaliddata;
711 GET_W(cbyte,pref);
712 rrp->i= pref;
713 st= pap_hostaddr(pai, &cbyte, max, &rrp->ha);
714 if (st) return st;
715
716 if (cbyte != max) return adns_s_invaliddata;
717 return adns_s_ok;
718 }
719
720 static int di_mx(adns_state ads, const void *datap_a, const void *datap_b) {
721 const adns_rr_inthostaddr *ap= datap_a, *bp= datap_b;
722
723 if (ap->i < bp->i) return 0;
724 if (ap->i > bp->i) return 1;
725 return dip_hostaddr(ads, &ap->ha, &bp->ha);
726 }
727
728 /*
729 * _inthostaddr (mf,cs)
730 */
731
732 static void mf_inthostaddr(adns_query qu, void *datap) {
733 adns_rr_inthostaddr *rrp= datap;
734
735 mfp_hostaddr(qu,&rrp->ha);
736 }
737
738 static adns_status cs_inthostaddr(vbuf *vb, const void *datap) {
739 const adns_rr_inthostaddr *rrp= datap;
740 char buf[10];
741
742 sprintf(buf,"%u ",rrp->i);
743 CSP_ADDSTR(buf);
744
745 return csp_hostaddr(vb,&rrp->ha);
746 }
747
748 /*
749 * _inthost (cs)
750 */
751
752 static adns_status cs_inthost(vbuf *vb, const void *datap) {
753 const adns_rr_intstr *rrp= datap;
754 char buf[10];
755
756 sprintf(buf,"%u ",rrp->i);
757 CSP_ADDSTR(buf);
758 return csp_domain(vb,rrp->str);
759 }
760
761 /*
762 * _ptr (pa, +icb_ptr)
763 */
764
765 static void icb_ptr(adns_query parent, adns_query child) {
766 adns_answer *cans= child->answer;
767 const union gen_addr *queried;
768 const unsigned char *found;
769 adns_state ads= parent->ads;
770 int i;
771
772 if (cans->status == adns_s_nxdomain || cans->status == adns_s_nodata) {
773 adns__query_fail(parent,adns_s_inconsistent);
774 return;
775 } else if (cans->status) {
776 adns__query_fail(parent,cans->status);
777 return;
778 }
779
780 queried= &parent->ctx.info.ptr_parent_addr.addr;
781 for (i=0, found=cans->rrs.bytes; i<cans->nrrs; i++, found += cans->rrsz) {
782 if (!memcmp(queried,found,cans->rrsz)) {
783 if (!parent->children.head) {
784 adns__query_done(parent);
785 return;
786 } else {
787 LIST_LINK_TAIL(ads->childw,parent);
788 return;
789 }
790 }
791 }
792
793 adns__query_fail(parent,adns_s_inconsistent);
794 }
795
796 static adns_status pa_ptr(const parseinfo *pai, int dmstart,
797 int max, void *datap) {
798 static const struct {
799 const afinfo *ai;
800 const char *const tail[3];
801 } expectdomain[] = {
802 { &adns__inet_afinfo, { DNS_INADDR_ARPA, 0 } },
803 { &adns__inet6_afinfo, { DNS_IP6_ARPA, 0 } }
804 };
805 enum { n_ed = sizeof(expectdomain)/sizeof(expectdomain[0]) };
806
807 char **rrp= datap;
808 adns_status st;
809 struct afinfo_addr *ap;
810 findlabel_state fls;
811 byte ipv[n_ed][32];
812 int cbyte, i, j, foundj = -1, lablen, labstart, id, f, ac;
813 const char *tp;
814 adns_query nqu;
815 qcontext ctx;
816
817 cbyte= dmstart;
818 st= pap_domain(pai, &cbyte, max, rrp,
819 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
820 if (st) return st;
821 if (cbyte != max) return adns_s_invaliddata;
822
823 ap= &pai->qu->ctx.info.ptr_parent_addr;
824 if (!ap->ai) {
825 adns__findlabel_start(&fls, pai->ads, -1, pai->qu,
826 pai->qu->query_dgram, pai->qu->query_dglen,
827 pai->qu->query_dglen, DNS_HDRSIZE, 0);
828
829 f = (1 << n_ed) - 1; /* superposition of address types */
830 for (i = 0;; i++) {
831 st= adns__findlabel_next(&fls,&lablen,&labstart); assert(!st);
832 if (lablen <= 0) break;
833 for (j = 0; j < n_ed; j++) {
834 if (!(f & (1 << j))) continue;
835 if (i < expectdomain[j].ai->nrevcomp) {
836 ac = expectdomain[j].ai->rev_parsecomp(
837 pai->qu->query_dgram + labstart, lablen);
838 if (ac < 0) goto mismatch;
839 assert(i < sizeof(ipv[j]));
840 ipv[j][i] = ac;
841 } else {
842 tp = expectdomain[j].tail[i - expectdomain[j].ai->nrevcomp];
843 if (!tp ||
844 strncmp(pai->qu->query_dgram + labstart, tp, lablen) != 0 ||
845 tp[lablen] != 0)
846 goto mismatch;
847 }
848 continue;
849
850 mismatch:
851 f &= ~(1 << j);
852 if (!f) return adns_s_querydomainwrong;
853 }
854 }
855
856 if (lablen < 0) return adns_s_querydomainwrong;
857 for (j = 0; j < n_ed; j++) {
858 if (!(f & (1 << j))) continue;
859 if (i >= expectdomain[j].ai->nrevcomp &&
860 !expectdomain[j].tail[i - expectdomain[j].ai->nrevcomp])
861 { foundj = j; continue; }
862 f &= ~(1 << j);
863 if (!f) return adns_s_querydomainwrong;
864 }
865 assert(foundj >= 0 && f == (1 << foundj)); /* collapsed to a single type */
866
867 ap->ai = expectdomain[foundj].ai;
868 ap->ai->rev_mkaddr(&ap->addr, ipv[foundj]);
869 }
870
871 st= adns__mkquery_frdgram(pai->ads, &pai->qu->vb, &id,
872 pai->dgram, pai->dglen, dmstart,
873 ap->ai->rrtype, adns_qf_quoteok_query);
874 if (st) return st;
875
876 ctx.ext= 0;
877 ctx.callback= icb_ptr;
878 memset(&ctx.info,0,sizeof(ctx.info));
879 st= adns__internal_submit(pai->ads, &nqu, adns__findtype(ap->ai->rrtype),
880 &pai->qu->vb, id,
881 adns_qf_quoteok_query, pai->now, &ctx);
882 if (st) return st;
883
884 nqu->parent= pai->qu;
885 LIST_LINK_TAIL_PART(pai->qu->children,nqu,siblings.);
886 return adns_s_ok;
887 }
888
889 /*
890 * _strpair (mf)
891 */
892
893 static void mf_strpair(adns_query qu, void *datap) {
894 adns_rr_strpair *rrp= datap;
895
896 adns__makefinal_str(qu,&rrp->array[0]);
897 adns__makefinal_str(qu,&rrp->array[1]);
898 }
899
900 /*
901 * _intstrpair (mf)
902 */
903
904 static void mf_intstrpair(adns_query qu, void *datap) {
905 adns_rr_intstrpair *rrp= datap;
906
907 adns__makefinal_str(qu,&rrp->array[0].str);
908 adns__makefinal_str(qu,&rrp->array[1].str);
909 }
910
911 /*
912 * _hinfo (pa)
913 */
914
915 static adns_status pa_hinfo(const parseinfo *pai, int cbyte,
916 int max, void *datap) {
917 adns_rr_intstrpair *rrp= datap;
918 adns_status st;
919 int i;
920
921 for (i=0; i<2; i++) {
922 st= pap_qstring(pai, &cbyte, max, &rrp->array[i].i, &rrp->array[i].str);
923 if (st) return st;
924 }
925
926 if (cbyte != max) return adns_s_invaliddata;
927
928 return adns_s_ok;
929 }
930
931 /*
932 * _mailbox (pap,cs)
933 */
934
935 static adns_status pap_mailbox822(const parseinfo *pai,
936 int *cbyte_io, int max, char **mb_r) {
937 int lablen, labstart, i, needquote, c, r, neednorm;
938 const unsigned char *p;
939 char *str;
940 findlabel_state fls;
941 adns_status st;
942 vbuf *vb;
943
944 vb= &pai->qu->vb;
945 vb->used= 0;
946 adns__findlabel_start(&fls, pai->ads,
947 -1, pai->qu,
948 pai->dgram, pai->dglen, max,
949 *cbyte_io, cbyte_io);
950 st= adns__findlabel_next(&fls,&lablen,&labstart);
951 if (!lablen) {
952 adns__vbuf_appendstr(vb,".");
953 goto x_ok;
954 }
955
956 neednorm= 1;
957 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++) {
958 c= *p++;
959 if ((c&~128) < 32 || (c&~128) == 127) return adns_s_invaliddata;
960 if (c == '.' && !neednorm) neednorm= 1;
961 else if (c==' ' || c>=127 || ctype_822special(c)) needquote++;
962 else neednorm= 0;
963 }
964
965 if (needquote || neednorm) {
966 r= adns__vbuf_ensure(vb, lablen+needquote+4); if (!r) R_NOMEM;
967 adns__vbuf_appendq(vb,"\"",1);
968 for (i=0, needquote=0, p= pai->dgram+labstart; i<lablen; i++, p++) {
969 c= *p;
970 if (c == '"' || c=='\\') adns__vbuf_appendq(vb,"\\",1);
971 adns__vbuf_appendq(vb,p,1);
972 }
973 adns__vbuf_appendq(vb,"\"",1);
974 } else {
975 r= adns__vbuf_append(vb, pai->dgram+labstart, lablen); if (!r) R_NOMEM;
976 }
977
978 r= adns__vbuf_appendstr(vb,"@"); if (!r) R_NOMEM;
979
980 st= adns__parse_domain_more(&fls,pai->ads, pai->qu,vb,0, pai->dgram);
981 if (st) return st;
982
983 x_ok:
984 str= adns__alloc_interim(pai->qu, vb->used+1); if (!str) R_NOMEM;
985 memcpy(str,vb->buf,vb->used);
986 str[vb->used]= 0;
987 *mb_r= str;
988 return adns_s_ok;
989 }
990
991 static adns_status pap_mailbox(const parseinfo *pai, int *cbyte_io, int max,
992 char **mb_r) {
993 if (pai->qu->typei->typekey & adns__qtf_mail822) {
994 return pap_mailbox822(pai, cbyte_io, max, mb_r);
995 } else {
996 return pap_domain(pai, cbyte_io, max, mb_r, pdf_quoteok);
997 }
998 }
999
1000 static adns_status csp_mailbox(vbuf *vb, const char *mailbox) {
1001 return csp_domain(vb,mailbox);
1002 }
1003
1004 /*
1005 * _rp (pa,cs)
1006 */
1007
1008 static adns_status pa_rp(const parseinfo *pai, int cbyte,
1009 int max, void *datap) {
1010 adns_rr_strpair *rrp= datap;
1011 adns_status st;
1012
1013 st= pap_mailbox(pai, &cbyte, max, &rrp->array[0]);
1014 if (st) return st;
1015
1016 st= pap_domain(pai, &cbyte, max, &rrp->array[1], pdf_quoteok);
1017 if (st) return st;
1018
1019 if (cbyte != max) return adns_s_invaliddata;
1020 return adns_s_ok;
1021 }
1022
1023 static adns_status cs_rp(vbuf *vb, const void *datap) {
1024 const adns_rr_strpair *rrp= datap;
1025 adns_status st;
1026
1027 st= csp_mailbox(vb,rrp->array[0]); if (st) return st;
1028 CSP_ADDSTR(" ");
1029 st= csp_domain(vb,rrp->array[1]); if (st) return st;
1030
1031 return adns_s_ok;
1032 }
1033
1034 /*
1035 * _soa (pa,mf,cs)
1036 */
1037
1038 static adns_status pa_soa(const parseinfo *pai, int cbyte,
1039 int max, void *datap) {
1040 adns_rr_soa *rrp= datap;
1041 const byte *dgram= pai->dgram;
1042 adns_status st;
1043 int msw, lsw, i;
1044
1045 st= pap_domain(pai, &cbyte, max, &rrp->mname,
1046 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1047 if (st) return st;
1048
1049 st= pap_mailbox(pai, &cbyte, max, &rrp->rname);
1050 if (st) return st;
1051
1052 if (cbyte+20 != max) return adns_s_invaliddata;
1053
1054 for (i=0; i<5; i++) {
1055 GET_W(cbyte,msw);
1056 GET_W(cbyte,lsw);
1057 (&rrp->serial)[i]= (msw<<16) | lsw;
1058 }
1059
1060 return adns_s_ok;
1061 }
1062
1063 static void mf_soa(adns_query qu, void *datap) {
1064 adns_rr_soa *rrp= datap;
1065
1066 adns__makefinal_str(qu,&rrp->mname);
1067 adns__makefinal_str(qu,&rrp->rname);
1068 }
1069
1070 static adns_status cs_soa(vbuf *vb, const void *datap) {
1071 const adns_rr_soa *rrp= datap;
1072 char buf[20];
1073 int i;
1074 adns_status st;
1075
1076 st= csp_domain(vb,rrp->mname); if (st) return st;
1077 CSP_ADDSTR(" ");
1078 st= csp_mailbox(vb,rrp->rname); if (st) return st;
1079
1080 for (i=0; i<5; i++) {
1081 sprintf(buf," %lu",(&rrp->serial)[i]);
1082 CSP_ADDSTR(buf);
1083 }
1084
1085 return adns_s_ok;
1086 }
1087
1088 /*
1089 * _srv* (pa*2,di,cs*2,qdpl,postsort)
1090 */
1091
1092 static adns_status qdpl_srv(adns_state ads,
1093 const char **p_io, const char *pe, int labelnum,
1094 char label_r[DNS_MAXDOMAIN], int *ll_io,
1095 adns_queryflags flags,
1096 const typeinfo *typei) {
1097 int useflags;
1098 const char *p_orig;
1099 adns_status st;
1100
1101 if (labelnum < 2 && !(flags & adns_qf_quoteok_query)) {
1102 useflags= adns_qf_quoteok_query;
1103 p_orig= *p_io;
1104 } else {
1105 useflags= flags;
1106 p_orig= 0;
1107 }
1108 st= adns__qdpl_normal(ads, p_io,pe, labelnum,label_r, ll_io, useflags,typei);
1109 if (st) return st;
1110
1111 if (p_orig) {
1112 int ll= *ll_io;
1113 if (!ll || label_r[0]!='_')
1114 return adns_s_querydomaininvalid;
1115 if (memchr(p_orig+1, '\\', pe - (p_orig+1)))
1116 return adns_s_querydomaininvalid;
1117 }
1118 return adns_s_ok;
1119 }
1120
1121 static adns_status pap_srv_begin(const parseinfo *pai, int *cbyte_io, int max,
1122 adns_rr_srvha *rrp
1123 /* might be adns_rr_srvraw* */) {
1124 const byte *dgram= pai->dgram;
1125 int ti, cbyte;
1126
1127 cbyte= *cbyte_io;
1128 if ((*cbyte_io += 6) > max) return adns_s_invaliddata;
1129
1130 rrp->priority= GET_W(cbyte, ti);
1131 rrp->weight= GET_W(cbyte, ti);
1132 rrp->port= GET_W(cbyte, ti);
1133 return adns_s_ok;
1134 }
1135
1136 static adns_status pa_srvraw(const parseinfo *pai, int cbyte,
1137 int max, void *datap) {
1138 adns_rr_srvraw *rrp= datap;
1139 adns_status st;
1140
1141 st= pap_srv_begin(pai,&cbyte,max,datap);
1142 if (st) return st;
1143
1144 st= pap_domain(pai, &cbyte, max, &rrp->host,
1145 pai->qu->flags & adns_qf_quoteok_anshost ? pdf_quoteok : 0);
1146 if (st) return st;
1147
1148 if (cbyte != max) return adns_s_invaliddata;
1149 return adns_s_ok;
1150 }
1151
1152 static adns_status pa_srvha(const parseinfo *pai, int cbyte,
1153 int max, void *datap) {
1154 adns_rr_srvha *rrp= datap;
1155 adns_status st;
1156
1157 st= pap_srv_begin(pai,&cbyte,max,datap); if (st) return st;
1158 st= pap_hostaddr(pai, &cbyte, max, &rrp->ha); if (st) return st;
1159 if (cbyte != max) return adns_s_invaliddata;
1160 return adns_s_ok;
1161 }
1162
1163 static void mf_srvraw(adns_query qu, void *datap) {
1164 adns_rr_srvraw *rrp= datap;
1165 adns__makefinal_str(qu, &rrp->host);
1166 }
1167
1168 static void mf_srvha(adns_query qu, void *datap) {
1169 adns_rr_srvha *rrp= datap;
1170 mfp_hostaddr(qu,&rrp->ha);
1171 }
1172
1173 static int di_srv(adns_state ads, const void *datap_a, const void *datap_b) {
1174 const adns_rr_srvraw *ap= datap_a, *bp= datap_b;
1175 /* might be const adns_rr_svhostaddr* */
1176
1177 if (ap->priority < bp->priority) return 0;
1178 if (ap->priority > bp->priority) return 1;
1179 return 0;
1180 }
1181
1182 static adns_status csp_srv_begin(vbuf *vb, const adns_rr_srvha *rrp
1183 /* might be adns_rr_srvraw* */) {
1184 char buf[30];
1185 sprintf(buf,"%u %u %u ", rrp->priority, rrp->weight, rrp->port);
1186 CSP_ADDSTR(buf);
1187 return adns_s_ok;
1188 }
1189
1190 static adns_status cs_srvraw(vbuf *vb, const void *datap) {
1191 const adns_rr_srvraw *rrp= datap;
1192 adns_status st;
1193
1194 st= csp_srv_begin(vb,(const void*)rrp); if (st) return st;
1195 return csp_domain(vb,rrp->host);
1196 }
1197
1198 static adns_status cs_srvha(vbuf *vb, const void *datap) {
1199 const adns_rr_srvha *rrp= datap;
1200 adns_status st;
1201
1202 st= csp_srv_begin(vb,(const void*)datap); if (st) return st;
1203 return csp_hostaddr(vb,&rrp->ha);
1204 }
1205
1206 static void postsort_srv(adns_state ads, void *array, int nrrs,
1207 const struct typeinfo *typei) {
1208 /* we treat everything in the array as if it were an adns_rr_srvha
1209 * even though the array might be of adns_rr_srvraw. That's OK
1210 * because they have the same prefix, which is all we access.
1211 * We use typei->rrsz, too, rather than naive array indexing, of course.
1212 */
1213 char *workbegin, *workend, *search, *arrayend;
1214 const adns_rr_srvha *rr;
1215 union { adns_rr_srvha ha; adns_rr_srvraw raw; } rrtmp;
1216 int cpriority, totalweight, runtotal;
1217 long randval;
1218
1219 for (workbegin= array, arrayend= workbegin + typei->rrsz * nrrs;
1220 workbegin < arrayend;
1221 workbegin= workend) {
1222 cpriority= (rr=(void*)workbegin)->priority;
1223
1224 for (workend= workbegin, totalweight= 0;
1225 workend < arrayend && (rr=(void*)workend)->priority == cpriority;
1226 workend += typei->rrsz) {
1227 totalweight += rr->weight;
1228 }
1229
1230 /* Now workbegin..(workend-1) incl. are exactly all of the RRs of
1231 * cpriority. From now on, workbegin points to the `remaining'
1232 * records: we select one record at a time (RFC2782 `Usage rules'
1233 * and `Format of the SRV RR' subsection `Weight') to place at
1234 * workbegin (swapping with the one that was there, and then
1235 * advance workbegin. */
1236 for (;
1237 workbegin + typei->rrsz < workend; /* don't bother if just one */
1238 workbegin += typei->rrsz) {
1239
1240 randval= nrand48(ads->rand48xsubi);
1241 randval %= (totalweight + 1);
1242 /* makes it into 0..totalweight inclusive; with 2^10 RRs,
1243 * totalweight must be <= 2^26 so probability nonuniformity is
1244 * no worse than 1 in 2^(31-26) ie 1 in 2^5, ie
1245 * abs(log(P_intended(RR_i) / P_actual(RR_i)) <= log(2^-5).
1246 */
1247
1248 for (search=workbegin, runtotal=0;
1249 (runtotal += (rr=(void*)search)->weight) < randval;
1250 search += typei->rrsz);
1251 assert(search < arrayend);
1252 totalweight -= rr->weight;
1253 if (search != workbegin) {
1254 memcpy(&rrtmp, workbegin, typei->rrsz);
1255 memcpy(workbegin, search, typei->rrsz);
1256 memcpy(search, &rrtmp, typei->rrsz);
1257 }
1258 }
1259 }
1260 /* tests:
1261 * dig -t srv _srv._tcp.test.iwj.relativity.greenend.org.uk.
1262 * ./adnshost_s -t srv- _sip._udp.voip.net.cam.ac.uk.
1263 * ./adnshost_s -t srv- _jabber._tcp.jabber.org
1264 */
1265 }
1266
1267 /*
1268 * _byteblock (mf)
1269 */
1270
1271 static void mf_byteblock(adns_query qu, void *datap) {
1272 adns_rr_byteblock *rrp= datap;
1273 void *bytes= rrp->data;
1274 adns__makefinal_block(qu,&bytes,rrp->len);
1275 rrp->data= bytes;
1276 }
1277
1278 /*
1279 * _opaque (pa,cs)
1280 */
1281
1282 static adns_status pa_opaque(const parseinfo *pai, int cbyte,
1283 int max, void *datap) {
1284 adns_rr_byteblock *rrp= datap;
1285
1286 rrp->len= max - cbyte;
1287 rrp->data= adns__alloc_interim(pai->qu, rrp->len);
1288 if (!rrp->data) R_NOMEM;
1289 memcpy(rrp->data, pai->dgram + cbyte, rrp->len);
1290 return adns_s_ok;
1291 }
1292
1293 static adns_status cs_opaque(vbuf *vb, const void *datap) {
1294 const adns_rr_byteblock *rrp= datap;
1295 char buf[10];
1296 int l;
1297 unsigned char *p;
1298
1299 sprintf(buf,"\\# %d",rrp->len);
1300 CSP_ADDSTR(buf);
1301
1302 for (l= rrp->len, p= rrp->data;
1303 l>=4;
1304 l -= 4, p += 4) {
1305 sprintf(buf," %02x%02x%02x%02x",p[0],p[1],p[2],p[3]);
1306 CSP_ADDSTR(buf);
1307 }
1308 for (;
1309 l>0;
1310 l--, p++) {
1311 sprintf(buf," %02x",*p);
1312 CSP_ADDSTR(buf);
1313 }
1314 return adns_s_ok;
1315 }
1316
1317 /*
1318 * _flat (mf)
1319 */
1320
1321 static void mf_flat(adns_query qu, void *data) { }
1322
1323 /*
1324 * Now the table.
1325 */
1326
1327 #define TYPESZ_M(member) (sizeof(*((adns_answer*)0)->rrs.member))
1328
1329 #define DEEP_MEMB(memb) TYPESZ_M(memb), mf_##memb, cs_##memb
1330 #define FLAT_MEMB(memb) TYPESZ_M(memb), mf_flat, cs_##memb
1331
1332 #define DEEP_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
1333 { adns_r_##code, rrt,fmt,TYPESZ_M(memb), mf_##memb, \
1334 printer,parser,comparer, adns__qdpl_normal,0 }
1335 #define FLAT_TYPE(code,rrt,fmt,memb,parser,comparer,printer) \
1336 { adns_r_##code, rrt,fmt,TYPESZ_M(memb), mf_flat, \
1337 printer,parser,comparer, adns__qdpl_normal,0 }
1338 #define XTRA_TYPE(code,rrt,fmt,memb,parser,comparer,printer,qdpl,postsort) \
1339 { adns_r_##code, rrt,fmt,TYPESZ_M(memb), mf_##memb, \
1340 printer,parser,comparer,qdpl,postsort }
1341
1342 static const typeinfo typeinfos[] = {
1343 /* Must be in ascending order of rrtype ! */
1344 /* mem-mgmt code rrt fmt member parser comparer printer */
1345
1346 FLAT_TYPE(a, "A", 0, inaddr, pa_inaddr, di_inaddr,cs_inaddr ),
1347 DEEP_TYPE(ns_raw, "NS", "raw",str, pa_host_raw,0, cs_domain ),
1348 DEEP_TYPE(cname, "CNAME", 0, str, pa_dom_raw, 0, cs_domain ),
1349 DEEP_TYPE(soa_raw,"SOA", "raw",soa, pa_soa, 0, cs_soa ),
1350 DEEP_TYPE(ptr_raw,"PTR", "raw",str, pa_host_raw,0, cs_domain ),
1351 DEEP_TYPE(hinfo, "HINFO", 0, intstrpair,pa_hinfo, 0, cs_hinfo ),
1352 DEEP_TYPE(mx_raw, "MX", "raw",intstr, pa_mx_raw, di_mx_raw,cs_inthost ),
1353 DEEP_TYPE(txt, "TXT", 0, manyistr,pa_txt, 0, cs_txt ),
1354 DEEP_TYPE(rp_raw, "RP", "raw",strpair, pa_rp, 0, cs_rp ),
1355 FLAT_TYPE(aaaa, "AAAA", 0, in6addr, pa_in6addr, di_in6addr,cs_in6addr ),
1356 XTRA_TYPE(srv_raw,"SRV", "raw",srvraw , pa_srvraw, di_srv, cs_srvraw,
1357 qdpl_srv, postsort_srv),
1358
1359 FLAT_TYPE(addr, "A", "addr", addr, pa_addr, di_addr, cs_addr ),
1360 DEEP_TYPE(ns, "NS", "+addr",hostaddr,pa_hostaddr,di_hostaddr,cs_hostaddr ),
1361 DEEP_TYPE(ptr, "PTR","checked",str, pa_ptr, 0, cs_domain ),
1362 DEEP_TYPE(mx, "MX", "+addr",inthostaddr,pa_mx, di_mx, cs_inthostaddr),
1363 XTRA_TYPE(srv, "SRV","+addr",srvha, pa_srvha, di_srv, cs_srvha,
1364 qdpl_srv, postsort_srv),
1365
1366 DEEP_TYPE(soa, "SOA","822", soa, pa_soa, 0, cs_soa ),
1367 DEEP_TYPE(rp, "RP", "822", strpair, pa_rp, 0, cs_rp ),
1368 };
1369
1370 static const typeinfo typeinfo_unknown=
1371 DEEP_TYPE(unknown,0, "unknown",byteblock,pa_opaque, 0, cs_opaque );
1372
1373 const typeinfo *adns__findtype(adns_rrtype type) {
1374 const typeinfo *begin, *end, *mid;
1375
1376 if (type & adns_r_unknown) return &typeinfo_unknown;
1377
1378 begin= typeinfos; end= typeinfos+(sizeof(typeinfos)/sizeof(typeinfo));
1379
1380 while (begin < end) {
1381 mid= begin + ((end-begin)>>1);
1382 if (mid->typekey == type) return mid;
1383 if (type > mid->typekey) begin= mid+1;
1384 else end= mid;
1385 }
1386 return 0;
1387 }