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