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