1 /* $NetBSD: res_debug.c,v 1.13 2012/06/25 22:32:45 abs Exp $ */ 2 3 /* 4 * Portions Copyright (C) 2004, 2005, 2008, 2009 Internet Systems Consortium, Inc. ("ISC") 5 * Portions Copyright (C) 1996-2003 Internet Software Consortium. 6 * 7 * Permission to use, copy, modify, and/or distribute this software for any 8 * purpose with or without fee is hereby granted, provided that the above 9 * copyright notice and this permission notice appear in all copies. 10 * 11 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH 12 * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY 13 * AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, 14 * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM 15 * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE 16 * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR 17 * PERFORMANCE OF THIS SOFTWARE. 18 */ 19 20 /* 21 * Copyright (c) 1985 22 * The Regents of the University of California. All rights reserved. 23 * 24 * Redistribution and use in source and binary forms, with or without 25 * modification, are permitted provided that the following conditions 26 * are met: 27 * 1. Redistributions of source code must retain the above copyright 28 * notice, this list of conditions and the following disclaimer. 29 * 2. Redistributions in binary form must reproduce the above copyright 30 * notice, this list of conditions and the following disclaimer in the 31 * documentation and/or other materials provided with the distribution. 32 * 3. All advertising materials mentioning features or use of this software 33 * must display the following acknowledgement: 34 * This product includes software developed by the University of 35 * California, Berkeley and its contributors. 36 * 4. Neither the name of the University nor the names of its contributors 37 * may be used to endorse or promote products derived from this software 38 * without specific prior written permission. 39 * 40 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50 * SUCH DAMAGE. 51 */ 52 53 /* 54 * Portions Copyright (c) 1993 by Digital Equipment Corporation. 55 * 56 * Permission to use, copy, modify, and distribute this software for any 57 * purpose with or without fee is hereby granted, provided that the above 58 * copyright notice and this permission notice appear in all copies, and that 59 * the name of Digital Equipment Corporation not be used in advertising or 60 * publicity pertaining to distribution of the document or software without 61 * specific, written prior permission. 62 * 63 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL 64 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES 65 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT 66 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL 67 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR 68 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS 69 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS 70 * SOFTWARE. 71 */ 72 73 /* 74 * Portions Copyright (c) 1995 by International Business Machines, Inc. 75 * 76 * International Business Machines, Inc. (hereinafter called IBM) grants 77 * permission under its copyrights to use, copy, modify, and distribute this 78 * Software with or without fee, provided that the above copyright notice and 79 * all paragraphs of this notice appear in all copies, and that the name of IBM 80 * not be used in connection with the marketing of any product incorporating 81 * the Software or modifications thereof, without specific, written prior 82 * permission. 83 * 84 * To the extent it has a right to do so, IBM grants an immunity from suit 85 * under its patents, if any, for the use, sale or manufacture of products to 86 * the extent that such products are used for performing Domain Name System 87 * dynamic updates in TCP/IP networks by means of the Software. No immunity is 88 * granted for any product per se or for any other function of any product. 89 * 90 * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES, 91 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 92 * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL, 93 * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING 94 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN 95 * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES. 96 */ 97 98 #include <sys/cdefs.h> 99 #if defined(LIBC_SCCS) && !defined(lint) 100 #ifdef notdef 101 static const char sccsid[] = "@(#)res_debug.c 8.1 (Berkeley) 6/4/93"; 102 static const char rcsid[] = "Id: res_debug.c,v 1.19 2009/02/26 11:20:20 tbox Exp"; 103 #else 104 __RCSID("$NetBSD: res_debug.c,v 1.13 2012/06/25 22:32:45 abs Exp $"); 105 #endif 106 #endif /* LIBC_SCCS and not lint */ 107 108 #include "port_before.h" 109 110 #include "namespace.h" 111 #include <sys/types.h> 112 #include <sys/param.h> 113 #include <sys/socket.h> 114 115 #include <netinet/in.h> 116 #include <arpa/inet.h> 117 #include <arpa/nameser.h> 118 119 #include <assert.h> 120 #include <ctype.h> 121 #include <errno.h> 122 #include <math.h> 123 #include <netdb.h> 124 #include <resolv.h> 125 #include <resolv_mt.h> 126 #include <stdio.h> 127 #include <stdlib.h> 128 #include <string.h> 129 #include <time.h> 130 131 #include "port_after.h" 132 133 #ifdef SPRINTF_CHAR 134 # define SPRINTF(x) strlen(sprintf/**/x) 135 #else 136 # define SPRINTF(x) sprintf x 137 #endif 138 139 extern const char *_res_opcodes[]; 140 extern const char *_res_sectioncodes[]; 141 142 #if 0 143 #ifdef __weak_alias 144 __weak_alias(res_pquery,__res_pquery) 145 __weak_alias(res_nametoclass,__res_nametoclass) 146 __weak_alias(res_nametotype,__res_nametotype) 147 #endif 148 #endif 149 150 #ifndef _LIBC 151 /*% 152 * Print the current options. 153 */ 154 void 155 fp_resstat(const res_state statp, FILE *file) { 156 u_long mask; 157 158 fprintf(file, ";; res options:"); 159 for (mask = 1; mask != 0U; mask <<= 1) 160 if (statp->options & mask) 161 fprintf(file, " %s", p_option(mask)); 162 putc('\n', file); 163 } 164 #endif 165 166 static void 167 do_section(const res_state statp, 168 ns_msg *handle, ns_sect section, 169 int pflag, FILE *file) 170 { 171 int n, sflag, rrnum; 172 static int buflen = 2048; 173 char *buf; 174 ns_opcode opcode; 175 ns_rr rr; 176 177 /* 178 * Print answer records. 179 */ 180 sflag = (int)(statp->pfcode & pflag); 181 if (statp->pfcode && !sflag) 182 return; 183 184 buf = malloc((size_t)buflen); 185 if (buf == NULL) { 186 fprintf(file, ";; memory allocation failure\n"); 187 return; 188 } 189 190 opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode); 191 rrnum = 0; 192 for (;;) { 193 if (ns_parserr(handle, section, rrnum, &rr)) { 194 if (errno != ENODEV) 195 fprintf(file, ";; ns_parserr: %s\n", 196 strerror(errno)); 197 else if (rrnum > 0 && sflag != 0 && 198 (statp->pfcode & RES_PRF_HEAD1)) 199 putc('\n', file); 200 goto cleanup; 201 } 202 if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1)) 203 fprintf(file, ";; %s SECTION:\n", 204 p_section(section, opcode)); 205 if (section == ns_s_qd) 206 fprintf(file, ";;\t%s, type = %s, class = %s\n", 207 ns_rr_name(rr), 208 p_type(ns_rr_type(rr)), 209 p_class(ns_rr_class(rr))); 210 else if (section == ns_s_ar && ns_rr_type(rr) == ns_t_opt) { 211 size_t rdatalen, ttl; 212 uint16_t optcode, optlen; 213 214 rdatalen = ns_rr_rdlen(rr); 215 ttl = ns_rr_ttl(rr); 216 217 fprintf(file, 218 "; EDNS: version: %zu, udp=%u, flags=%04zx\n", 219 (ttl>>16)&0xff, ns_rr_class(rr), ttl&0xffff); 220 221 while (rdatalen >= 4) { 222 const u_char *cp = ns_rr_rdata(rr); 223 int i; 224 225 GETSHORT(optcode, cp); 226 GETSHORT(optlen, cp); 227 228 if (optcode == NS_OPT_NSID) { 229 fputs("; NSID: ", file); 230 if (optlen == 0) { 231 fputs("; NSID\n", file); 232 } else { 233 fputs("; NSID: ", file); 234 for (i = 0; i < optlen; i++) 235 fprintf(file, "%02x ", 236 cp[i]); 237 fputs(" (",file); 238 for (i = 0; i < optlen; i++) 239 fprintf(file, "%c", 240 isprint(cp[i])? 241 cp[i] : '.'); 242 fputs(")\n", file); 243 } 244 } else { 245 if (optlen == 0) { 246 fprintf(file, "; OPT=%u\n", 247 optcode); 248 } else { 249 fprintf(file, "; OPT=%u: ", 250 optcode); 251 for (i = 0; i < optlen; i++) 252 fprintf(file, "%02x ", 253 cp[i]); 254 fputs(" (",file); 255 for (i = 0; i < optlen; i++) 256 fprintf(file, "%c", 257 isprint(cp[i]) ? 258 cp[i] : '.'); 259 fputs(")\n", file); 260 } 261 } 262 rdatalen -= 4 + optlen; 263 } 264 } else { 265 n = ns_sprintrr(handle, &rr, NULL, NULL, 266 buf, (u_int)buflen); 267 if (n < 0) { 268 if (errno == ENOSPC) { 269 free(buf); 270 buf = NULL; 271 if (buflen < 131072) 272 buf = malloc((size_t)(buflen += 1024)); 273 if (buf == NULL) { 274 fprintf(file, 275 ";; memory allocation failure\n"); 276 return; 277 } 278 continue; 279 } 280 fprintf(file, ";; ns_sprintrr: %s\n", 281 strerror(errno)); 282 goto cleanup; 283 } 284 fputs(buf, file); 285 fputc('\n', file); 286 } 287 rrnum++; 288 } 289 cleanup: 290 if (buf != NULL) 291 free(buf); 292 } 293 294 /*% 295 * Print the contents of a query. 296 * This is intended to be primarily a debugging routine. 297 */ 298 void 299 res_pquery(const res_state statp, const u_char *msg, int len, FILE *file) { 300 ns_msg handle; 301 int qdcount, ancount, nscount, arcount; 302 u_int opcode, rcode, id; 303 304 if (ns_initparse(msg, len, &handle) < 0) { 305 fprintf(file, ";; ns_initparse: %s\n", strerror(errno)); 306 return; 307 } 308 opcode = ns_msg_getflag(handle, ns_f_opcode); 309 rcode = ns_msg_getflag(handle, ns_f_rcode); 310 id = ns_msg_id(handle); 311 qdcount = ns_msg_count(handle, ns_s_qd); 312 ancount = ns_msg_count(handle, ns_s_an); 313 nscount = ns_msg_count(handle, ns_s_ns); 314 arcount = ns_msg_count(handle, ns_s_ar); 315 316 /* 317 * Print header fields. 318 */ 319 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode) 320 fprintf(file, 321 ";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n", 322 _res_opcodes[opcode], p_rcode((int)rcode), id); 323 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX)) 324 putc(';', file); 325 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) { 326 fprintf(file, "; flags:"); 327 if (ns_msg_getflag(handle, ns_f_qr)) 328 fprintf(file, " qr"); 329 if (ns_msg_getflag(handle, ns_f_aa)) 330 fprintf(file, " aa"); 331 if (ns_msg_getflag(handle, ns_f_tc)) 332 fprintf(file, " tc"); 333 if (ns_msg_getflag(handle, ns_f_rd)) 334 fprintf(file, " rd"); 335 if (ns_msg_getflag(handle, ns_f_ra)) 336 fprintf(file, " ra"); 337 if (ns_msg_getflag(handle, ns_f_z)) 338 fprintf(file, " ??"); 339 if (ns_msg_getflag(handle, ns_f_ad)) 340 fprintf(file, " ad"); 341 if (ns_msg_getflag(handle, ns_f_cd)) 342 fprintf(file, " cd"); 343 } 344 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) { 345 fprintf(file, "; %s: %d", 346 p_section(ns_s_qd, (int)opcode), qdcount); 347 fprintf(file, ", %s: %d", 348 p_section(ns_s_an, (int)opcode), ancount); 349 fprintf(file, ", %s: %d", 350 p_section(ns_s_ns, (int)opcode), nscount); 351 fprintf(file, ", %s: %d", 352 p_section(ns_s_ar, (int)opcode), arcount); 353 } 354 if ((!statp->pfcode) || (statp->pfcode & 355 (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) { 356 putc('\n',file); 357 } 358 /* 359 * Print the various sections. 360 */ 361 do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file); 362 do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file); 363 do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file); 364 do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file); 365 if (qdcount == 0 && ancount == 0 && 366 nscount == 0 && arcount == 0) 367 putc('\n', file); 368 } 369 370 const u_char * 371 p_cdnname(const u_char *cp, const u_char *msg, int len, FILE *file) { 372 char name[MAXDNAME]; 373 int n; 374 375 if ((n = dn_expand(msg, msg + len, cp, name, (int)sizeof name)) < 0) 376 return (NULL); 377 if (name[0] == '\0') 378 putc('.', file); 379 else 380 fputs(name, file); 381 return (cp + n); 382 } 383 384 const u_char * 385 p_cdname(const u_char *cp, const u_char *msg, FILE *file) { 386 return (p_cdnname(cp, msg, PACKETSZ, file)); 387 } 388 389 /*% 390 * Return a fully-qualified domain name from a compressed name (with 391 length supplied). */ 392 393 const u_char * 394 p_fqnname(const u_char *cp, const u_char *msg, int msglen, char *name, 395 int namelen) 396 { 397 int n; 398 size_t newlen; 399 400 if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0) 401 return (NULL); 402 newlen = strlen(name); 403 if (newlen == 0 || name[newlen - 1] != '.') { 404 if ((int)newlen + 1 >= namelen) /*%< Lack space for final dot */ 405 return (NULL); 406 else 407 strcpy(name + newlen, "."); 408 } 409 return (cp + n); 410 } 411 412 /* XXX: the rest of these functions need to become length-limited, too. */ 413 414 const u_char * 415 p_fqname(const u_char *cp, const u_char *msg, FILE *file) { 416 char name[MAXDNAME]; 417 const u_char *n; 418 419 n = p_fqnname(cp, msg, MAXCDNAME, name, (int)sizeof name); 420 if (n == NULL) 421 return (NULL); 422 fputs(name, file); 423 return (n); 424 } 425 426 /*% 427 * Names of RR classes and qclasses. Classes and qclasses are the same, except 428 * that C_ANY is a qclass but not a class. (You can ask for records of class 429 * C_ANY, but you can't have any records of that class in the database.) 430 */ 431 const struct res_sym __p_class_syms[] = { 432 {C_IN, "IN", (char *)0}, 433 {C_CHAOS, "CH", (char *)0}, 434 {C_CHAOS, "CHAOS", (char *)0}, 435 {C_HS, "HS", (char *)0}, 436 {C_HS, "HESIOD", (char *)0}, 437 {C_ANY, "ANY", (char *)0}, 438 {C_NONE, "NONE", (char *)0}, 439 {C_IN, (char *)0, (char *)0} 440 }; 441 442 /*% 443 * Names of message sections. 444 */ 445 const struct res_sym __p_default_section_syms[] = { 446 {ns_s_qd, "QUERY", (char *)0}, 447 {ns_s_an, "ANSWER", (char *)0}, 448 {ns_s_ns, "AUTHORITY", (char *)0}, 449 {ns_s_ar, "ADDITIONAL", (char *)0}, 450 {0, (char *)0, (char *)0} 451 }; 452 453 const struct res_sym __p_update_section_syms[] = { 454 {S_ZONE, "ZONE", (char *)0}, 455 {S_PREREQ, "PREREQUISITE", (char *)0}, 456 {S_UPDATE, "UPDATE", (char *)0}, 457 {S_ADDT, "ADDITIONAL", (char *)0}, 458 {0, (char *)0, (char *)0} 459 }; 460 461 const struct res_sym __p_key_syms[] = { 462 {NS_ALG_MD5RSA, "RSA", "RSA KEY with MD5 hash"}, 463 {NS_ALG_DH, "DH", "Diffie Hellman"}, 464 {NS_ALG_DSA, "DSA", "Digital Signature Algorithm"}, 465 {NS_ALG_EXPIRE_ONLY, "EXPIREONLY", "No algorithm"}, 466 {NS_ALG_PRIVATE_OID, "PRIVATE", "Algorithm obtained from OID"}, 467 {0, NULL, NULL} 468 }; 469 470 const struct res_sym __p_cert_syms[] = { 471 {cert_t_pkix, "PKIX", "PKIX (X.509v3) Certificate"}, 472 {cert_t_spki, "SPKI", "SPKI certificate"}, 473 {cert_t_pgp, "PGP", "PGP certificate"}, 474 {cert_t_url, "URL", "URL Private"}, 475 {cert_t_oid, "OID", "OID Private"}, 476 {0, NULL, NULL} 477 }; 478 479 /*% 480 * Names of RR types and qtypes. Types and qtypes are the same, except 481 * that T_ANY is a qtype but not a type. (You can ask for records of type 482 * T_ANY, but you can't have any records of that type in the database.) 483 */ 484 const struct res_sym __p_type_syms[] = { 485 {ns_t_a, "A", "address"}, 486 {ns_t_ns, "NS", "name server"}, 487 {ns_t_md, "MD", "mail destination (deprecated)"}, 488 {ns_t_mf, "MF", "mail forwarder (deprecated)"}, 489 {ns_t_cname, "CNAME", "canonical name"}, 490 {ns_t_soa, "SOA", "start of authority"}, 491 {ns_t_mb, "MB", "mailbox"}, 492 {ns_t_mg, "MG", "mail group member"}, 493 {ns_t_mr, "MR", "mail rename"}, 494 {ns_t_null, "NULL", "null"}, 495 {ns_t_wks, "WKS", "well-known service (deprecated)"}, 496 {ns_t_ptr, "PTR", "domain name pointer"}, 497 {ns_t_hinfo, "HINFO", "host information"}, 498 {ns_t_minfo, "MINFO", "mailbox information"}, 499 {ns_t_mx, "MX", "mail exchanger"}, 500 {ns_t_txt, "TXT", "text"}, 501 {ns_t_rp, "RP", "responsible person"}, 502 {ns_t_afsdb, "AFSDB", "DCE or AFS server"}, 503 {ns_t_x25, "X25", "X25 address"}, 504 {ns_t_isdn, "ISDN", "ISDN address"}, 505 {ns_t_rt, "RT", "router"}, 506 {ns_t_nsap, "NSAP", "nsap address"}, 507 {ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"}, 508 {ns_t_sig, "SIG", "signature"}, 509 {ns_t_key, "KEY", "key"}, 510 {ns_t_px, "PX", "mapping information"}, 511 {ns_t_gpos, "GPOS", "geographical position (withdrawn)"}, 512 {ns_t_aaaa, "AAAA", "IPv6 address"}, 513 {ns_t_loc, "LOC", "location"}, 514 {ns_t_nxt, "NXT", "next valid name (unimplemented)"}, 515 {ns_t_eid, "EID", "endpoint identifier (unimplemented)"}, 516 {ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"}, 517 {ns_t_srv, "SRV", "server selection"}, 518 {ns_t_atma, "ATMA", "ATM address (unimplemented)"}, 519 {ns_t_naptr, "NAPTR", "naptr"}, 520 {ns_t_kx, "KX", "key exchange"}, 521 {ns_t_cert, "CERT", "certificate"}, 522 {ns_t_a6, "A", "IPv6 address (experminental)"}, 523 {ns_t_dname, "DNAME", "non-terminal redirection"}, 524 {ns_t_opt, "OPT", "opt"}, 525 {ns_t_apl, "apl", "apl"}, 526 {ns_t_ds, "DS", "delegation signer"}, 527 {ns_t_sshfp, "SSFP", "SSH fingerprint"}, 528 {ns_t_ipseckey, "IPSECKEY", "IPSEC key"}, 529 {ns_t_rrsig, "RRSIG", "rrsig"}, 530 {ns_t_nsec, "NSEC", "nsec"}, 531 {ns_t_dnskey, "DNSKEY", "DNS key"}, 532 {ns_t_dhcid, "DHCID", "dynamic host configuration identifier"}, 533 {ns_t_nsec3, "NSEC3", "nsec3"}, 534 {ns_t_nsec3param, "NSEC3PARAM", "NSEC3 parameters"}, 535 {ns_t_hip, "HIP", "host identity protocol"}, 536 {ns_t_spf, "SPF", "sender policy framework"}, 537 {ns_t_tkey, "TKEY", "tkey"}, 538 {ns_t_tsig, "TSIG", "transaction signature"}, 539 {ns_t_ixfr, "IXFR", "incremental zone transfer"}, 540 {ns_t_axfr, "AXFR", "zone transfer"}, 541 {ns_t_zxfr, "ZXFR", "compressed zone transfer"}, 542 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"}, 543 {ns_t_maila, "MAILA", "mail agent (deprecated)"}, 544 {ns_t_naptr, "NAPTR", "URN Naming Authority"}, 545 {ns_t_kx, "KX", "Key Exchange"}, 546 {ns_t_cert, "CERT", "Certificate"}, 547 {ns_t_a6, "A6", "IPv6 Address"}, 548 {ns_t_dname, "DNAME", "dname"}, 549 {ns_t_sink, "SINK", "Kitchen Sink (experimental)"}, 550 {ns_t_opt, "OPT", "EDNS Options"}, 551 {ns_t_any, "ANY", "\"any\""}, 552 {ns_t_dlv, "DLV", "DNSSEC look-aside validation"}, 553 {0, NULL, NULL} 554 }; 555 556 /*% 557 * Names of DNS rcodes. 558 */ 559 const struct res_sym __p_rcode_syms[] = { 560 {ns_r_noerror, "NOERROR", "no error"}, 561 {ns_r_formerr, "FORMERR", "format error"}, 562 {ns_r_servfail, "SERVFAIL", "server failed"}, 563 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"}, 564 {ns_r_notimpl, "NOTIMP", "not implemented"}, 565 {ns_r_refused, "REFUSED", "refused"}, 566 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"}, 567 {ns_r_yxrrset, "YXRRSET", "rrset exists"}, 568 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"}, 569 {ns_r_notauth, "NOTAUTH", "not authoritative"}, 570 {ns_r_notzone, "NOTZONE", "Not in zone"}, 571 {ns_r_max, "", ""}, 572 {ns_r_badsig, "BADSIG", "bad signature"}, 573 {ns_r_badkey, "BADKEY", "bad key"}, 574 {ns_r_badtime, "BADTIME", "bad time"}, 575 {0, NULL, NULL} 576 }; 577 578 int 579 sym_ston(const struct res_sym *syms, const char *name, int *success) { 580 for (; syms->name != 0; syms++) { 581 if (strcasecmp (name, syms->name) == 0) { 582 if (success) 583 *success = 1; 584 return (syms->number); 585 } 586 } 587 if (success) 588 *success = 0; 589 return (syms->number); /*%< The default value. */ 590 } 591 592 const char * 593 sym_ntos(const struct res_sym *syms, int number, int *success) { 594 char *unname = sym_ntos_unname; 595 596 for (; syms->name != 0; syms++) { 597 if (number == syms->number) { 598 if (success) 599 *success = 1; 600 return (syms->name); 601 } 602 } 603 604 sprintf(unname, "%d", number); /*%< XXX nonreentrant */ 605 if (success) 606 *success = 0; 607 return (unname); 608 } 609 610 const char * 611 sym_ntop(const struct res_sym *syms, int number, int *success) { 612 char *unname = sym_ntop_unname; 613 614 for (; syms->name != 0; syms++) { 615 if (number == syms->number) { 616 if (success) 617 *success = 1; 618 return (syms->humanname); 619 } 620 } 621 sprintf(unname, "%d", number); /*%< XXX nonreentrant */ 622 if (success) 623 *success = 0; 624 return (unname); 625 } 626 627 /*% 628 * Return a string for the type. 629 */ 630 const char * 631 p_type(int type) { 632 int success; 633 const char *result; 634 static char typebuf[20]; 635 636 result = sym_ntos(__p_type_syms, type, &success); 637 if (success) 638 return (result); 639 if (type < 0 || type > 0xffff) 640 return ("BADTYPE"); 641 sprintf(typebuf, "TYPE%d", type); 642 return (typebuf); 643 } 644 645 /*% 646 * Return a string for the type. 647 */ 648 const char * 649 p_section(int section, int opcode) { 650 const struct res_sym *symbols; 651 652 switch (opcode) { 653 case ns_o_update: 654 symbols = __p_update_section_syms; 655 break; 656 default: 657 symbols = __p_default_section_syms; 658 break; 659 } 660 return (sym_ntos(symbols, section, (int *)0)); 661 } 662 663 /*% 664 * Return a mnemonic for class. 665 */ 666 const char * 667 p_class(int class) { 668 int success; 669 const char *result; 670 static char classbuf[20]; 671 672 result = sym_ntos(__p_class_syms, class, &success); 673 if (success) 674 return (result); 675 if (class < 0 || class > 0xffff) 676 return ("BADCLASS"); 677 sprintf(classbuf, "CLASS%d", class); 678 return (classbuf); 679 } 680 681 /*% 682 * Return a mnemonic for an option 683 */ 684 const char * 685 p_option(u_long option) { 686 char *nbuf = p_option_nbuf; 687 688 switch (option) { 689 case RES_INIT: return "init"; 690 case RES_DEBUG: return "debug"; 691 case RES_AAONLY: return "aaonly(unimpl)"; 692 case RES_USEVC: return "usevc"; 693 case RES_PRIMARY: return "primry(unimpl)"; 694 case RES_IGNTC: return "igntc"; 695 case RES_RECURSE: return "recurs"; 696 case RES_DEFNAMES: return "defnam"; 697 case RES_STAYOPEN: return "styopn"; 698 case RES_DNSRCH: return "dnsrch"; 699 case RES_INSECURE1: return "insecure1"; 700 case RES_INSECURE2: return "insecure2"; 701 case RES_NOALIASES: return "noaliases"; 702 case RES_USE_INET6: return "inet6"; 703 #ifdef RES_USE_EDNS0 /*%< KAME extension */ 704 case RES_USE_EDNS0: return "edns0"; 705 case RES_NSID: return "nsid"; 706 #endif 707 #ifdef RES_USE_DNAME 708 case RES_USE_DNAME: return "dname"; 709 #endif 710 #ifdef RES_USE_DNSSEC 711 case RES_USE_DNSSEC: return "dnssec"; 712 #endif 713 #ifdef RES_NOTLDQUERY 714 case RES_NOTLDQUERY: return "no-tld-query"; 715 #endif 716 #ifdef RES_NO_NIBBLE2 717 case RES_NO_NIBBLE2: return "no-nibble2"; 718 #endif 719 /* XXX nonreentrant */ 720 default: sprintf(nbuf, "?0x%lx?", (u_long)option); 721 return (nbuf); 722 } 723 } 724 725 /*% 726 * Return a mnemonic for a time to live. 727 */ 728 const char * 729 p_time(u_int32_t value) { 730 char *nbuf = p_time_nbuf; 731 732 if (ns_format_ttl((u_long)value, nbuf, sizeof nbuf) < 0) 733 sprintf(nbuf, "%u", value); 734 return (nbuf); 735 } 736 737 /*% 738 * Return a string for the rcode. 739 */ 740 const char * 741 p_rcode(int rcode) { 742 return (sym_ntos(__p_rcode_syms, rcode, (int *)0)); 743 } 744 745 /*% 746 * Return a string for a res_sockaddr_union. 747 */ 748 const char * 749 p_sockun(union res_sockaddr_union u, char *buf, size_t size) { 750 char ret[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:123.123.123.123"]; 751 752 switch (u.sin.sin_family) { 753 case AF_INET: 754 inet_ntop(AF_INET, &u.sin.sin_addr, ret, (socklen_t)sizeof ret); 755 break; 756 #ifdef HAS_INET6_STRUCTS 757 case AF_INET6: 758 inet_ntop(AF_INET6, &u.sin6.sin6_addr, ret, sizeof ret); 759 break; 760 #endif 761 default: 762 sprintf(ret, "[af%d]", u.sin.sin_family); 763 break; 764 } 765 if (size > 0U) { 766 strncpy(buf, ret, size - 1); 767 buf[size - 1] = '0'; 768 } 769 return (buf); 770 } 771 772 /*% 773 * routines to convert between on-the-wire RR format and zone file format. 774 * Does not contain conversion to/from decimal degrees; divide or multiply 775 * by 60*60*1000 for that. 776 */ 777 778 static unsigned int poweroften[10] = {1, 10, 100, 1000, 10000, 100000, 779 1000000,10000000,100000000,1000000000}; 780 781 /*% takes an XeY precision/size value, returns a string representation. */ 782 static const char * 783 precsize_ntoa(u_int32_t prec) 784 { 785 char *retbuf = precsize_ntoa_retbuf; 786 unsigned long val; 787 int mantissa, exponent; 788 789 mantissa = (int)((prec >> 4) & 0x0f) % 10; 790 exponent = (int)((prec >> 0) & 0x0f) % 10; 791 792 val = mantissa * poweroften[exponent]; 793 794 (void) sprintf(retbuf, "%lu.%.2lu", val/100, val%100); 795 return (retbuf); 796 } 797 798 /*% converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */ 799 static u_int8_t 800 precsize_aton(const char **strptr) { 801 unsigned int mval = 0, cmval = 0; 802 u_int8_t retval = 0; 803 const char *cp; 804 int exponent; 805 int mantissa; 806 807 cp = *strptr; 808 809 while (isdigit((unsigned char)*cp)) 810 mval = mval * 10 + (*cp++ - '0'); 811 812 if (*cp == '.') { /*%< centimeters */ 813 cp++; 814 if (isdigit((unsigned char)*cp)) { 815 cmval = (*cp++ - '0') * 10; 816 if (isdigit((unsigned char)*cp)) { 817 cmval += (*cp++ - '0'); 818 } 819 } 820 } 821 cmval = (mval * 100) + cmval; 822 823 for (exponent = 0; exponent < 9; exponent++) 824 if (cmval < poweroften[exponent+1]) 825 break; 826 827 mantissa = cmval / poweroften[exponent]; 828 if (mantissa > 9) 829 mantissa = 9; 830 831 retval = (mantissa << 4) | exponent; 832 833 *strptr = cp; 834 835 return (retval); 836 } 837 838 /*% converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */ 839 static u_int32_t 840 latlon2ul(const char **latlonstrptr, int *which) { 841 const char *cp; 842 u_int32_t retval; 843 int deg = 0, min = 0, secs = 0, secsfrac = 0; 844 845 cp = *latlonstrptr; 846 847 while (isdigit((unsigned char)*cp)) 848 deg = deg * 10 + (*cp++ - '0'); 849 850 while (isspace((unsigned char)*cp)) 851 cp++; 852 853 if (!(isdigit((unsigned char)*cp))) 854 goto fndhemi; 855 856 while (isdigit((unsigned char)*cp)) 857 min = min * 10 + (*cp++ - '0'); 858 859 while (isspace((unsigned char)*cp)) 860 cp++; 861 862 if (!(isdigit((unsigned char)*cp))) 863 goto fndhemi; 864 865 while (isdigit((unsigned char)*cp)) 866 secs = secs * 10 + (*cp++ - '0'); 867 868 if (*cp == '.') { /*%< decimal seconds */ 869 cp++; 870 if (isdigit((unsigned char)*cp)) { 871 secsfrac = (*cp++ - '0') * 100; 872 if (isdigit((unsigned char)*cp)) { 873 secsfrac += (*cp++ - '0') * 10; 874 if (isdigit((unsigned char)*cp)) { 875 secsfrac += (*cp++ - '0'); 876 } 877 } 878 } 879 } 880 881 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */ 882 cp++; 883 884 while (isspace((unsigned char)*cp)) 885 cp++; 886 887 fndhemi: 888 switch (*cp) { 889 case 'N': case 'n': 890 case 'E': case 'e': 891 retval = ((unsigned)1<<31) 892 + (((((deg * 60) + min) * 60) + secs) * 1000) 893 + secsfrac; 894 break; 895 case 'S': case 's': 896 case 'W': case 'w': 897 retval = ((unsigned)1<<31) 898 - (((((deg * 60) + min) * 60) + secs) * 1000) 899 - secsfrac; 900 break; 901 default: 902 retval = 0; /*%< invalid value -- indicates error */ 903 break; 904 } 905 906 switch (*cp) { 907 case 'N': case 'n': 908 case 'S': case 's': 909 *which = 1; /*%< latitude */ 910 break; 911 case 'E': case 'e': 912 case 'W': case 'w': 913 *which = 2; /*%< longitude */ 914 break; 915 default: 916 *which = 0; /*%< error */ 917 break; 918 } 919 920 cp++; /*%< skip the hemisphere */ 921 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */ 922 cp++; 923 924 while (isspace((unsigned char)*cp)) /*%< move to next field */ 925 cp++; 926 927 *latlonstrptr = cp; 928 929 return (retval); 930 } 931 932 /*% 933 * converts a zone file representation in a string to an RDATA on-the-wire 934 * representation. */ 935 int 936 loc_aton(const char *ascii, u_char *binary) 937 { 938 const char *cp, *maxcp; 939 u_char *bcp; 940 941 u_int32_t latit = 0, longit = 0, alt = 0; 942 u_int32_t lltemp1 = 0, lltemp2 = 0; 943 int altmeters = 0, altfrac = 0, altsign = 1; 944 u_int8_t hp = 0x16; /*%< default = 1e6 cm = 10000.00m = 10km */ 945 u_int8_t vp = 0x13; /*%< default = 1e3 cm = 10.00m */ 946 u_int8_t siz = 0x12; /*%< default = 1e2 cm = 1.00m */ 947 int which1 = 0, which2 = 0; 948 949 cp = ascii; 950 maxcp = cp + strlen(ascii); 951 952 lltemp1 = latlon2ul(&cp, &which1); 953 954 lltemp2 = latlon2ul(&cp, &which2); 955 956 switch (which1 + which2) { 957 case 3: /*%< 1 + 2, the only valid combination */ 958 if ((which1 == 1) && (which2 == 2)) { /*%< normal case */ 959 latit = lltemp1; 960 longit = lltemp2; 961 } else if ((which1 == 2) && (which2 == 1)) { /*%< reversed */ 962 longit = lltemp1; 963 latit = lltemp2; 964 } else { /*%< some kind of brokenness */ 965 return (0); 966 } 967 break; 968 default: /*%< we didn't get one of each */ 969 return (0); 970 } 971 972 /* altitude */ 973 if (*cp == '-') { 974 altsign = -1; 975 cp++; 976 } 977 978 if (*cp == '+') 979 cp++; 980 981 while (isdigit((unsigned char)*cp)) 982 altmeters = altmeters * 10 + (*cp++ - '0'); 983 984 if (*cp == '.') { /*%< decimal meters */ 985 cp++; 986 if (isdigit((unsigned char)*cp)) { 987 altfrac = (*cp++ - '0') * 10; 988 if (isdigit((unsigned char)*cp)) { 989 altfrac += (*cp++ - '0'); 990 } 991 } 992 } 993 994 alt = (10000000 + (altsign * (altmeters * 100 + altfrac))); 995 996 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 997 cp++; 998 999 while (isspace((unsigned char)*cp) && (cp < maxcp)) 1000 cp++; 1001 1002 if (cp >= maxcp) 1003 goto defaults; 1004 1005 siz = precsize_aton(&cp); 1006 1007 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 1008 cp++; 1009 1010 while (isspace((unsigned char)*cp) && (cp < maxcp)) 1011 cp++; 1012 1013 if (cp >= maxcp) 1014 goto defaults; 1015 1016 hp = precsize_aton(&cp); 1017 1018 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 1019 cp++; 1020 1021 while (isspace((unsigned char)*cp) && (cp < maxcp)) 1022 cp++; 1023 1024 if (cp >= maxcp) 1025 goto defaults; 1026 1027 vp = precsize_aton(&cp); 1028 1029 defaults: 1030 1031 bcp = binary; 1032 *bcp++ = (u_int8_t) 0; /*%< version byte */ 1033 *bcp++ = siz; 1034 *bcp++ = hp; 1035 *bcp++ = vp; 1036 PUTLONG(latit,bcp); 1037 PUTLONG(longit,bcp); 1038 PUTLONG(alt,bcp); 1039 1040 return (16); /*%< size of RR in octets */ 1041 } 1042 1043 /*% takes an on-the-wire LOC RR and formats it in a human readable format. */ 1044 const char * 1045 loc_ntoa(const u_char *binary, char *ascii) 1046 { 1047 static const char *error = "?"; 1048 static char tmpbuf[sizeof 1049 "1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"]; 1050 const u_char *cp = binary; 1051 1052 int latdeg, latmin, latsec, latsecfrac; 1053 int longdeg, longmin, longsec, longsecfrac; 1054 char northsouth, eastwest; 1055 const char *altsign; 1056 int altmeters, altfrac; 1057 1058 const u_int32_t referencealt = 100000 * 100; 1059 1060 int32_t latval, longval, altval; 1061 u_int32_t templ; 1062 u_int8_t sizeval, hpval, vpval, versionval; 1063 1064 char *sizestr, *hpstr, *vpstr; 1065 1066 versionval = *cp++; 1067 1068 if (ascii == NULL) 1069 ascii = tmpbuf; 1070 1071 if (versionval) { 1072 (void) sprintf(ascii, "; error: unknown LOC RR version"); 1073 return (ascii); 1074 } 1075 1076 sizeval = *cp++; 1077 1078 hpval = *cp++; 1079 vpval = *cp++; 1080 1081 GETLONG(templ, cp); 1082 latval = (templ - ((unsigned)1<<31)); 1083 1084 GETLONG(templ, cp); 1085 longval = (templ - ((unsigned)1<<31)); 1086 1087 GETLONG(templ, cp); 1088 if (templ < referencealt) { /*%< below WGS 84 spheroid */ 1089 altval = referencealt - templ; 1090 altsign = "-"; 1091 } else { 1092 altval = templ - referencealt; 1093 altsign = ""; 1094 } 1095 1096 if (latval < 0) { 1097 northsouth = 'S'; 1098 latval = -latval; 1099 } else 1100 northsouth = 'N'; 1101 1102 latsecfrac = latval % 1000; 1103 latval = latval / 1000; 1104 latsec = latval % 60; 1105 latval = latval / 60; 1106 latmin = latval % 60; 1107 latval = latval / 60; 1108 latdeg = latval; 1109 1110 if (longval < 0) { 1111 eastwest = 'W'; 1112 longval = -longval; 1113 } else 1114 eastwest = 'E'; 1115 1116 longsecfrac = longval % 1000; 1117 longval = longval / 1000; 1118 longsec = longval % 60; 1119 longval = longval / 60; 1120 longmin = longval % 60; 1121 longval = longval / 60; 1122 longdeg = longval; 1123 1124 altfrac = altval % 100; 1125 altmeters = (altval / 100); 1126 1127 sizestr = strdup(precsize_ntoa((u_int32_t)sizeval)); 1128 hpstr = strdup(precsize_ntoa((u_int32_t)hpval)); 1129 vpstr = strdup(precsize_ntoa((u_int32_t)vpval)); 1130 1131 sprintf(ascii, 1132 "%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %s%d.%.2dm %sm %sm %sm", 1133 latdeg, latmin, latsec, latsecfrac, northsouth, 1134 longdeg, longmin, longsec, longsecfrac, eastwest, 1135 altsign, altmeters, altfrac, 1136 (sizestr != NULL) ? sizestr : error, 1137 (hpstr != NULL) ? hpstr : error, 1138 (vpstr != NULL) ? vpstr : error); 1139 1140 if (sizestr != NULL) 1141 free(sizestr); 1142 if (hpstr != NULL) 1143 free(hpstr); 1144 if (vpstr != NULL) 1145 free(vpstr); 1146 1147 return (ascii); 1148 } 1149 1150 1151 /*% Return the number of DNS hierarchy levels in the name. */ 1152 int 1153 dn_count_labels(const char *name) { 1154 size_t len, i, count; 1155 1156 len = strlen(name); 1157 for (i = 0, count = 0; i < len; i++) { 1158 /* XXX need to check for \. or use named's nlabels(). */ 1159 if (name[i] == '.') 1160 count++; 1161 } 1162 1163 /* don't count initial wildcard */ 1164 if (name[0] == '*') 1165 if (count) 1166 count--; 1167 1168 /* don't count the null label for root. */ 1169 /* if terminating '.' not found, must adjust */ 1170 /* count to include last label */ 1171 if (len > 0 && name[len-1] != '.') 1172 count++; 1173 _DIAGASSERT(__type_fit(int, count)); 1174 return (int)count; 1175 } 1176 1177 /*% 1178 * Make dates expressed in seconds-since-Jan-1-1970 easy to read. 1179 * SIG records are required to be printed like this, by the Secure DNS RFC. 1180 */ 1181 char * 1182 p_secstodate (u_long secs) { 1183 /* XXX nonreentrant */ 1184 char *output = p_secstodate_output; 1185 time_t myclock = secs; 1186 struct tm *mytime; 1187 #ifdef HAVE_TIME_R 1188 struct tm res; 1189 1190 mytime = gmtime_r(&myclock, &res); 1191 #else 1192 mytime = gmtime(&myclock); 1193 #endif 1194 mytime->tm_year += 1900; 1195 mytime->tm_mon += 1; 1196 sprintf(output, "%04d%02d%02d%02d%02d%02d", 1197 mytime->tm_year, mytime->tm_mon, mytime->tm_mday, 1198 mytime->tm_hour, mytime->tm_min, mytime->tm_sec); 1199 return (output); 1200 } 1201 1202 u_int16_t 1203 res_nametoclass(const char *buf, int *successp) { 1204 unsigned long result; 1205 char *endptr; 1206 int success; 1207 1208 result = sym_ston(__p_class_syms, buf, &success); 1209 if (success) 1210 goto done; 1211 1212 if (strncasecmp(buf, "CLASS", 5) != 0 || 1213 !isdigit((unsigned char)buf[5])) 1214 goto done; 1215 errno = 0; 1216 result = strtoul(buf + 5, &endptr, 10); 1217 if (errno == 0 && *endptr == '\0' && result <= 0xffffU) 1218 success = 1; 1219 done: 1220 if (successp) 1221 *successp = success; 1222 return (u_int16_t)(result); 1223 } 1224 1225 u_int16_t 1226 res_nametotype(const char *buf, int *successp) { 1227 unsigned long result; 1228 char *endptr; 1229 int success; 1230 1231 result = sym_ston(__p_type_syms, buf, &success); 1232 if (success) 1233 goto done; 1234 1235 if (strncasecmp(buf, "type", 4) != 0 || 1236 !isdigit((unsigned char)buf[4])) 1237 goto done; 1238 errno = 0; 1239 result = strtoul(buf + 4, &endptr, 10); 1240 if (errno == 0 && *endptr == '\0' && result <= 0xffffU) 1241 success = 1; 1242 done: 1243 if (successp) 1244 *successp = success; 1245 return (u_int16_t)(result); 1246 } 1247 1248 /*! \file */ 1249