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