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.10.18.5 2005/07/28 07:38:11 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_int32_t ttl = ns_rr_ttl(rr); 193 fprintf(file, 194 "; EDNS: version: %u, udp=%u, flags=%04x\n", 195 (ttl>>16)&0xff, ns_rr_class(rr), ttl&0xffff); 196 } else { 197 n = ns_sprintrr(handle, &rr, NULL, NULL, 198 buf, buflen); 199 if (n < 0) { 200 if (errno == ENOSPC) { 201 free(buf); 202 buf = NULL; 203 if (buflen < 131072) 204 buf = malloc(buflen += 1024); 205 if (buf == NULL) { 206 fprintf(file, 207 ";; memory allocation failure\n"); 208 return; 209 } 210 continue; 211 } 212 fprintf(file, ";; ns_sprintrr: %s\n", 213 strerror(errno)); 214 goto cleanup; 215 } 216 fputs(buf, file); 217 fputc('\n', file); 218 } 219 rrnum++; 220 } 221 cleanup: 222 if (buf != NULL) 223 free(buf); 224 } 225 226 /*% 227 * Print the contents of a query. 228 * This is intended to be primarily a debugging routine. 229 */ 230 void 231 res_pquery(const res_state statp, const u_char *msg, int len, FILE *file) { 232 ns_msg handle; 233 int qdcount, ancount, nscount, arcount; 234 u_int opcode, rcode, id; 235 236 if (ns_initparse(msg, len, &handle) < 0) { 237 fprintf(file, ";; ns_initparse: %s\n", strerror(errno)); 238 return; 239 } 240 opcode = ns_msg_getflag(handle, ns_f_opcode); 241 rcode = ns_msg_getflag(handle, ns_f_rcode); 242 id = ns_msg_id(handle); 243 qdcount = ns_msg_count(handle, ns_s_qd); 244 ancount = ns_msg_count(handle, ns_s_an); 245 nscount = ns_msg_count(handle, ns_s_ns); 246 arcount = ns_msg_count(handle, ns_s_ar); 247 248 /* 249 * Print header fields. 250 */ 251 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode) 252 fprintf(file, 253 ";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n", 254 _res_opcodes[opcode], p_rcode(rcode), id); 255 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX)) 256 putc(';', file); 257 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) { 258 fprintf(file, "; flags:"); 259 if (ns_msg_getflag(handle, ns_f_qr)) 260 fprintf(file, " qr"); 261 if (ns_msg_getflag(handle, ns_f_aa)) 262 fprintf(file, " aa"); 263 if (ns_msg_getflag(handle, ns_f_tc)) 264 fprintf(file, " tc"); 265 if (ns_msg_getflag(handle, ns_f_rd)) 266 fprintf(file, " rd"); 267 if (ns_msg_getflag(handle, ns_f_ra)) 268 fprintf(file, " ra"); 269 if (ns_msg_getflag(handle, ns_f_z)) 270 fprintf(file, " ??"); 271 if (ns_msg_getflag(handle, ns_f_ad)) 272 fprintf(file, " ad"); 273 if (ns_msg_getflag(handle, ns_f_cd)) 274 fprintf(file, " cd"); 275 } 276 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) { 277 fprintf(file, "; %s: %d", 278 p_section(ns_s_qd, opcode), qdcount); 279 fprintf(file, ", %s: %d", 280 p_section(ns_s_an, opcode), ancount); 281 fprintf(file, ", %s: %d", 282 p_section(ns_s_ns, opcode), nscount); 283 fprintf(file, ", %s: %d", 284 p_section(ns_s_ar, opcode), arcount); 285 } 286 if ((!statp->pfcode) || (statp->pfcode & 287 (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) { 288 putc('\n',file); 289 } 290 /* 291 * Print the various sections. 292 */ 293 do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file); 294 do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file); 295 do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file); 296 do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file); 297 if (qdcount == 0 && ancount == 0 && 298 nscount == 0 && arcount == 0) 299 putc('\n', file); 300 } 301 302 const u_char * 303 p_cdnname(const u_char *cp, const u_char *msg, int len, FILE *file) { 304 char name[MAXDNAME]; 305 int n; 306 307 if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0) 308 return (NULL); 309 if (name[0] == '\0') 310 putc('.', file); 311 else 312 fputs(name, file); 313 return (cp + n); 314 } 315 316 const u_char * 317 p_cdname(const u_char *cp, const u_char *msg, FILE *file) { 318 return (p_cdnname(cp, msg, PACKETSZ, file)); 319 } 320 321 /*% 322 * Return a fully-qualified domain name from a compressed name (with 323 length supplied). */ 324 325 const u_char * 326 p_fqnname(cp, msg, msglen, name, namelen) 327 const u_char *cp, *msg; 328 int msglen; 329 char *name; 330 int namelen; 331 { 332 int n, newlen; 333 334 if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0) 335 return (NULL); 336 newlen = strlen(name); 337 if (newlen == 0 || name[newlen - 1] != '.') { 338 if (newlen + 1 >= namelen) /*%< Lack space for final dot */ 339 return (NULL); 340 else 341 strcpy(name + newlen, "."); 342 } 343 return (cp + n); 344 } 345 346 /* XXX: the rest of these functions need to become length-limited, too. */ 347 348 const u_char * 349 p_fqname(const u_char *cp, const u_char *msg, FILE *file) { 350 char name[MAXDNAME]; 351 const u_char *n; 352 353 n = p_fqnname(cp, msg, MAXCDNAME, name, sizeof name); 354 if (n == NULL) 355 return (NULL); 356 fputs(name, file); 357 return (n); 358 } 359 360 /*% 361 * Names of RR classes and qclasses. Classes and qclasses are the same, except 362 * that C_ANY is a qclass but not a class. (You can ask for records of class 363 * C_ANY, but you can't have any records of that class in the database.) 364 */ 365 const struct res_sym __p_class_syms[] = { 366 {C_IN, "IN", (char *)0}, 367 {C_CHAOS, "CH", (char *)0}, 368 {C_CHAOS, "CHAOS", (char *)0}, 369 {C_HS, "HS", (char *)0}, 370 {C_HS, "HESIOD", (char *)0}, 371 {C_ANY, "ANY", (char *)0}, 372 {C_NONE, "NONE", (char *)0}, 373 {C_IN, (char *)0, (char *)0} 374 }; 375 376 /*% 377 * Names of message sections. 378 */ 379 const struct res_sym __p_default_section_syms[] = { 380 {ns_s_qd, "QUERY", (char *)0}, 381 {ns_s_an, "ANSWER", (char *)0}, 382 {ns_s_ns, "AUTHORITY", (char *)0}, 383 {ns_s_ar, "ADDITIONAL", (char *)0}, 384 {0, (char *)0, (char *)0} 385 }; 386 387 const struct res_sym __p_update_section_syms[] = { 388 {S_ZONE, "ZONE", (char *)0}, 389 {S_PREREQ, "PREREQUISITE", (char *)0}, 390 {S_UPDATE, "UPDATE", (char *)0}, 391 {S_ADDT, "ADDITIONAL", (char *)0}, 392 {0, (char *)0, (char *)0} 393 }; 394 395 const struct res_sym __p_key_syms[] = { 396 {NS_ALG_MD5RSA, "RSA", "RSA KEY with MD5 hash"}, 397 {NS_ALG_DH, "DH", "Diffie Hellman"}, 398 {NS_ALG_DSA, "DSA", "Digital Signature Algorithm"}, 399 {NS_ALG_EXPIRE_ONLY, "EXPIREONLY", "No algorithm"}, 400 {NS_ALG_PRIVATE_OID, "PRIVATE", "Algorithm obtained from OID"}, 401 {0, NULL, NULL} 402 }; 403 404 const struct res_sym __p_cert_syms[] = { 405 {cert_t_pkix, "PKIX", "PKIX (X.509v3) Certificate"}, 406 {cert_t_spki, "SPKI", "SPKI certificate"}, 407 {cert_t_pgp, "PGP", "PGP certificate"}, 408 {cert_t_url, "URL", "URL Private"}, 409 {cert_t_oid, "OID", "OID Private"}, 410 {0, NULL, NULL} 411 }; 412 413 /*% 414 * Names of RR types and qtypes. Types and qtypes are the same, except 415 * that T_ANY is a qtype but not a type. (You can ask for records of type 416 * T_ANY, but you can't have any records of that type in the database.) 417 */ 418 const struct res_sym __p_type_syms[] = { 419 {ns_t_a, "A", "address"}, 420 {ns_t_ns, "NS", "name server"}, 421 {ns_t_md, "MD", "mail destination (deprecated)"}, 422 {ns_t_mf, "MF", "mail forwarder (deprecated)"}, 423 {ns_t_cname, "CNAME", "canonical name"}, 424 {ns_t_soa, "SOA", "start of authority"}, 425 {ns_t_mb, "MB", "mailbox"}, 426 {ns_t_mg, "MG", "mail group member"}, 427 {ns_t_mr, "MR", "mail rename"}, 428 {ns_t_null, "NULL", "null"}, 429 {ns_t_wks, "WKS", "well-known service (deprecated)"}, 430 {ns_t_ptr, "PTR", "domain name pointer"}, 431 {ns_t_hinfo, "HINFO", "host information"}, 432 {ns_t_minfo, "MINFO", "mailbox information"}, 433 {ns_t_mx, "MX", "mail exchanger"}, 434 {ns_t_txt, "TXT", "text"}, 435 {ns_t_rp, "RP", "responsible person"}, 436 {ns_t_afsdb, "AFSDB", "DCE or AFS server"}, 437 {ns_t_x25, "X25", "X25 address"}, 438 {ns_t_isdn, "ISDN", "ISDN address"}, 439 {ns_t_rt, "RT", "router"}, 440 {ns_t_nsap, "NSAP", "nsap address"}, 441 {ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"}, 442 {ns_t_sig, "SIG", "signature"}, 443 {ns_t_key, "KEY", "key"}, 444 {ns_t_px, "PX", "mapping information"}, 445 {ns_t_gpos, "GPOS", "geographical position (withdrawn)"}, 446 {ns_t_aaaa, "AAAA", "IPv6 address"}, 447 {ns_t_loc, "LOC", "location"}, 448 {ns_t_nxt, "NXT", "next valid name (unimplemented)"}, 449 {ns_t_eid, "EID", "endpoint identifier (unimplemented)"}, 450 {ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"}, 451 {ns_t_srv, "SRV", "server selection"}, 452 {ns_t_atma, "ATMA", "ATM address (unimplemented)"}, 453 {ns_t_tkey, "TKEY", "tkey"}, 454 {ns_t_tsig, "TSIG", "transaction signature"}, 455 {ns_t_ixfr, "IXFR", "incremental zone transfer"}, 456 {ns_t_axfr, "AXFR", "zone transfer"}, 457 {ns_t_zxfr, "ZXFR", "compressed zone transfer"}, 458 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"}, 459 {ns_t_maila, "MAILA", "mail agent (deprecated)"}, 460 {ns_t_naptr, "NAPTR", "URN Naming Authority"}, 461 {ns_t_kx, "KX", "Key Exchange"}, 462 {ns_t_cert, "CERT", "Certificate"}, 463 {ns_t_a6, "A6", "IPv6 Address"}, 464 {ns_t_dname, "DNAME", "dname"}, 465 {ns_t_sink, "SINK", "Kitchen Sink (experimental)"}, 466 {ns_t_opt, "OPT", "EDNS Options"}, 467 {ns_t_any, "ANY", "\"any\""}, 468 {0, NULL, NULL} 469 }; 470 471 /*% 472 * Names of DNS rcodes. 473 */ 474 const struct res_sym __p_rcode_syms[] = { 475 {ns_r_noerror, "NOERROR", "no error"}, 476 {ns_r_formerr, "FORMERR", "format error"}, 477 {ns_r_servfail, "SERVFAIL", "server failed"}, 478 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"}, 479 {ns_r_notimpl, "NOTIMP", "not implemented"}, 480 {ns_r_refused, "REFUSED", "refused"}, 481 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"}, 482 {ns_r_yxrrset, "YXRRSET", "rrset exists"}, 483 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"}, 484 {ns_r_notauth, "NOTAUTH", "not authoritative"}, 485 {ns_r_notzone, "NOTZONE", "Not in zone"}, 486 {ns_r_max, "", ""}, 487 {ns_r_badsig, "BADSIG", "bad signature"}, 488 {ns_r_badkey, "BADKEY", "bad key"}, 489 {ns_r_badtime, "BADTIME", "bad time"}, 490 {0, NULL, NULL} 491 }; 492 493 int 494 sym_ston(const struct res_sym *syms, const char *name, int *success) { 495 for ((void)NULL; syms->name != 0; syms++) { 496 if (strcasecmp (name, syms->name) == 0) { 497 if (success) 498 *success = 1; 499 return (syms->number); 500 } 501 } 502 if (success) 503 *success = 0; 504 return (syms->number); /*%< The default value. */ 505 } 506 507 const char * 508 sym_ntos(const struct res_sym *syms, int number, int *success) { 509 char *unname = sym_ntos_unname; 510 511 for ((void)NULL; syms->name != 0; syms++) { 512 if (number == syms->number) { 513 if (success) 514 *success = 1; 515 return (syms->name); 516 } 517 } 518 519 sprintf(unname, "%d", number); /*%< XXX nonreentrant */ 520 if (success) 521 *success = 0; 522 return (unname); 523 } 524 525 const char * 526 sym_ntop(const struct res_sym *syms, int number, int *success) { 527 char *unname = sym_ntop_unname; 528 529 for ((void)NULL; syms->name != 0; syms++) { 530 if (number == syms->number) { 531 if (success) 532 *success = 1; 533 return (syms->humanname); 534 } 535 } 536 sprintf(unname, "%d", number); /*%< XXX nonreentrant */ 537 if (success) 538 *success = 0; 539 return (unname); 540 } 541 542 /*% 543 * Return a string for the type. 544 */ 545 const char * 546 p_type(int type) { 547 int success; 548 const char *result; 549 static char typebuf[20]; 550 551 result = sym_ntos(__p_type_syms, type, &success); 552 if (success) 553 return (result); 554 if (type < 0 || type > 0xffff) 555 return ("BADTYPE"); 556 sprintf(typebuf, "TYPE%d", type); 557 return (typebuf); 558 } 559 560 /*% 561 * Return a string for the type. 562 */ 563 const char * 564 p_section(int section, int opcode) { 565 const struct res_sym *symbols; 566 567 switch (opcode) { 568 case ns_o_update: 569 symbols = __p_update_section_syms; 570 break; 571 default: 572 symbols = __p_default_section_syms; 573 break; 574 } 575 return (sym_ntos(symbols, section, (int *)0)); 576 } 577 578 /*% 579 * Return a mnemonic for class. 580 */ 581 const char * 582 p_class(int class) { 583 int success; 584 const char *result; 585 static char classbuf[20]; 586 587 result = sym_ntos(__p_class_syms, class, &success); 588 if (success) 589 return (result); 590 if (class < 0 || class > 0xffff) 591 return ("BADCLASS"); 592 sprintf(classbuf, "CLASS%d", class); 593 return (classbuf); 594 } 595 596 /*% 597 * Return a mnemonic for an option 598 */ 599 const char * 600 p_option(u_long option) { 601 char *nbuf = p_option_nbuf; 602 603 switch (option) { 604 case RES_INIT: return "init"; 605 case RES_DEBUG: return "debug"; 606 case RES_AAONLY: return "aaonly(unimpl)"; 607 case RES_USEVC: return "usevc"; 608 case RES_PRIMARY: return "primry(unimpl)"; 609 case RES_IGNTC: return "igntc"; 610 case RES_RECURSE: return "recurs"; 611 case RES_DEFNAMES: return "defnam"; 612 case RES_STAYOPEN: return "styopn"; 613 case RES_DNSRCH: return "dnsrch"; 614 case RES_INSECURE1: return "insecure1"; 615 case RES_INSECURE2: return "insecure2"; 616 case RES_NOALIASES: return "noaliases"; 617 case RES_USE_INET6: return "inet6"; 618 #ifdef RES_USE_EDNS0 /*%< KAME extension */ 619 case RES_USE_EDNS0: return "edns0"; 620 #endif 621 #ifdef RES_USE_DNAME 622 case RES_USE_DNAME: return "dname"; 623 #endif 624 #ifdef RES_USE_DNSSEC 625 case RES_USE_DNSSEC: return "dnssec"; 626 #endif 627 #ifdef RES_NOTLDQUERY 628 case RES_NOTLDQUERY: return "no-tld-query"; 629 #endif 630 #ifdef RES_NO_NIBBLE2 631 case RES_NO_NIBBLE2: return "no-nibble2"; 632 #endif 633 /* XXX nonreentrant */ 634 default: sprintf(nbuf, "?0x%lx?", (u_long)option); 635 return (nbuf); 636 } 637 } 638 639 /*% 640 * Return a mnemonic for a time to live. 641 */ 642 const char * 643 p_time(u_int32_t value) { 644 char *nbuf = p_time_nbuf; 645 646 if (ns_format_ttl(value, nbuf, sizeof nbuf) < 0) 647 sprintf(nbuf, "%u", value); 648 return (nbuf); 649 } 650 651 /*% 652 * Return a string for the rcode. 653 */ 654 const char * 655 p_rcode(int rcode) { 656 return (sym_ntos(__p_rcode_syms, rcode, (int *)0)); 657 } 658 659 /*% 660 * Return a string for a res_sockaddr_union. 661 */ 662 const char * 663 p_sockun(union res_sockaddr_union u, char *buf, size_t size) { 664 char ret[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:123.123.123.123"]; 665 666 switch (u.sin.sin_family) { 667 case AF_INET: 668 inet_ntop(AF_INET, &u.sin.sin_addr, ret, sizeof ret); 669 break; 670 #ifdef HAS_INET6_STRUCTS 671 case AF_INET6: 672 inet_ntop(AF_INET6, &u.sin6.sin6_addr, ret, sizeof ret); 673 break; 674 #endif 675 default: 676 sprintf(ret, "[af%d]", u.sin.sin_family); 677 break; 678 } 679 if (size > 0U) { 680 strncpy(buf, ret, size - 1); 681 buf[size - 1] = '0'; 682 } 683 return (buf); 684 } 685 686 /*% 687 * routines to convert between on-the-wire RR format and zone file format. 688 * Does not contain conversion to/from decimal degrees; divide or multiply 689 * by 60*60*1000 for that. 690 */ 691 692 static unsigned int poweroften[10] = {1, 10, 100, 1000, 10000, 100000, 693 1000000,10000000,100000000,1000000000}; 694 695 /*% takes an XeY precision/size value, returns a string representation. */ 696 static const char * 697 precsize_ntoa(prec) 698 u_int8_t prec; 699 { 700 char *retbuf = precsize_ntoa_retbuf; 701 unsigned long val; 702 int mantissa, exponent; 703 704 mantissa = (int)((prec >> 4) & 0x0f) % 10; 705 exponent = (int)((prec >> 0) & 0x0f) % 10; 706 707 val = mantissa * poweroften[exponent]; 708 709 (void) sprintf(retbuf, "%lu.%.2lu", val/100, val%100); 710 return (retbuf); 711 } 712 713 /*% converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */ 714 static u_int8_t 715 precsize_aton(const char **strptr) { 716 unsigned int mval = 0, cmval = 0; 717 u_int8_t retval = 0; 718 const char *cp; 719 int exponent; 720 int mantissa; 721 722 cp = *strptr; 723 724 while (isdigit((unsigned char)*cp)) 725 mval = mval * 10 + (*cp++ - '0'); 726 727 if (*cp == '.') { /*%< centimeters */ 728 cp++; 729 if (isdigit((unsigned char)*cp)) { 730 cmval = (*cp++ - '0') * 10; 731 if (isdigit((unsigned char)*cp)) { 732 cmval += (*cp++ - '0'); 733 } 734 } 735 } 736 cmval = (mval * 100) + cmval; 737 738 for (exponent = 0; exponent < 9; exponent++) 739 if (cmval < poweroften[exponent+1]) 740 break; 741 742 mantissa = cmval / poweroften[exponent]; 743 if (mantissa > 9) 744 mantissa = 9; 745 746 retval = (mantissa << 4) | exponent; 747 748 *strptr = cp; 749 750 return (retval); 751 } 752 753 /*% converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */ 754 static u_int32_t 755 latlon2ul(const char **latlonstrptr, int *which) { 756 const char *cp; 757 u_int32_t retval; 758 int deg = 0, min = 0, secs = 0, secsfrac = 0; 759 760 cp = *latlonstrptr; 761 762 while (isdigit((unsigned char)*cp)) 763 deg = deg * 10 + (*cp++ - '0'); 764 765 while (isspace((unsigned char)*cp)) 766 cp++; 767 768 if (!(isdigit((unsigned char)*cp))) 769 goto fndhemi; 770 771 while (isdigit((unsigned char)*cp)) 772 min = min * 10 + (*cp++ - '0'); 773 774 while (isspace((unsigned char)*cp)) 775 cp++; 776 777 if (!(isdigit((unsigned char)*cp))) 778 goto fndhemi; 779 780 while (isdigit((unsigned char)*cp)) 781 secs = secs * 10 + (*cp++ - '0'); 782 783 if (*cp == '.') { /*%< decimal seconds */ 784 cp++; 785 if (isdigit((unsigned char)*cp)) { 786 secsfrac = (*cp++ - '0') * 100; 787 if (isdigit((unsigned char)*cp)) { 788 secsfrac += (*cp++ - '0') * 10; 789 if (isdigit((unsigned char)*cp)) { 790 secsfrac += (*cp++ - '0'); 791 } 792 } 793 } 794 } 795 796 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */ 797 cp++; 798 799 while (isspace((unsigned char)*cp)) 800 cp++; 801 802 fndhemi: 803 switch (*cp) { 804 case 'N': case 'n': 805 case 'E': case 'e': 806 retval = ((unsigned)1<<31) 807 + (((((deg * 60) + min) * 60) + secs) * 1000) 808 + secsfrac; 809 break; 810 case 'S': case 's': 811 case 'W': case 'w': 812 retval = ((unsigned)1<<31) 813 - (((((deg * 60) + min) * 60) + secs) * 1000) 814 - secsfrac; 815 break; 816 default: 817 retval = 0; /*%< invalid value -- indicates error */ 818 break; 819 } 820 821 switch (*cp) { 822 case 'N': case 'n': 823 case 'S': case 's': 824 *which = 1; /*%< latitude */ 825 break; 826 case 'E': case 'e': 827 case 'W': case 'w': 828 *which = 2; /*%< longitude */ 829 break; 830 default: 831 *which = 0; /*%< error */ 832 break; 833 } 834 835 cp++; /*%< skip the hemisphere */ 836 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */ 837 cp++; 838 839 while (isspace((unsigned char)*cp)) /*%< move to next field */ 840 cp++; 841 842 *latlonstrptr = cp; 843 844 return (retval); 845 } 846 847 /*% 848 * converts a zone file representation in a string to an RDATA on-the-wire 849 * representation. */ 850 int 851 loc_aton(ascii, binary) 852 const char *ascii; 853 u_char *binary; 854 { 855 const char *cp, *maxcp; 856 u_char *bcp; 857 858 u_int32_t latit = 0, longit = 0, alt = 0; 859 u_int32_t lltemp1 = 0, lltemp2 = 0; 860 int altmeters = 0, altfrac = 0, altsign = 1; 861 u_int8_t hp = 0x16; /*%< default = 1e6 cm = 10000.00m = 10km */ 862 u_int8_t vp = 0x13; /*%< default = 1e3 cm = 10.00m */ 863 u_int8_t siz = 0x12; /*%< default = 1e2 cm = 1.00m */ 864 int which1 = 0, which2 = 0; 865 866 cp = ascii; 867 maxcp = cp + strlen(ascii); 868 869 lltemp1 = latlon2ul(&cp, &which1); 870 871 lltemp2 = latlon2ul(&cp, &which2); 872 873 switch (which1 + which2) { 874 case 3: /*%< 1 + 2, the only valid combination */ 875 if ((which1 == 1) && (which2 == 2)) { /*%< normal case */ 876 latit = lltemp1; 877 longit = lltemp2; 878 } else if ((which1 == 2) && (which2 == 1)) { /*%< reversed */ 879 longit = lltemp1; 880 latit = lltemp2; 881 } else { /*%< some kind of brokenness */ 882 return (0); 883 } 884 break; 885 default: /*%< we didn't get one of each */ 886 return (0); 887 } 888 889 /* altitude */ 890 if (*cp == '-') { 891 altsign = -1; 892 cp++; 893 } 894 895 if (*cp == '+') 896 cp++; 897 898 while (isdigit((unsigned char)*cp)) 899 altmeters = altmeters * 10 + (*cp++ - '0'); 900 901 if (*cp == '.') { /*%< decimal meters */ 902 cp++; 903 if (isdigit((unsigned char)*cp)) { 904 altfrac = (*cp++ - '0') * 10; 905 if (isdigit((unsigned char)*cp)) { 906 altfrac += (*cp++ - '0'); 907 } 908 } 909 } 910 911 alt = (10000000 + (altsign * (altmeters * 100 + altfrac))); 912 913 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 914 cp++; 915 916 while (isspace((unsigned char)*cp) && (cp < maxcp)) 917 cp++; 918 919 if (cp >= maxcp) 920 goto defaults; 921 922 siz = precsize_aton(&cp); 923 924 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 925 cp++; 926 927 while (isspace((unsigned char)*cp) && (cp < maxcp)) 928 cp++; 929 930 if (cp >= maxcp) 931 goto defaults; 932 933 hp = precsize_aton(&cp); 934 935 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */ 936 cp++; 937 938 while (isspace((unsigned char)*cp) && (cp < maxcp)) 939 cp++; 940 941 if (cp >= maxcp) 942 goto defaults; 943 944 vp = precsize_aton(&cp); 945 946 defaults: 947 948 bcp = binary; 949 *bcp++ = (u_int8_t) 0; /*%< version byte */ 950 *bcp++ = siz; 951 *bcp++ = hp; 952 *bcp++ = vp; 953 PUTLONG(latit,bcp); 954 PUTLONG(longit,bcp); 955 PUTLONG(alt,bcp); 956 957 return (16); /*%< size of RR in octets */ 958 } 959 960 /*% takes an on-the-wire LOC RR and formats it in a human readable format. */ 961 const char * 962 loc_ntoa(binary, ascii) 963 const u_char *binary; 964 char *ascii; 965 { 966 static const char *error = "?"; 967 static char tmpbuf[sizeof 968 "1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"]; 969 const u_char *cp = binary; 970 971 int latdeg, latmin, latsec, latsecfrac; 972 int longdeg, longmin, longsec, longsecfrac; 973 char northsouth, eastwest; 974 const char *altsign; 975 int altmeters, altfrac; 976 977 const u_int32_t referencealt = 100000 * 100; 978 979 int32_t latval, longval, altval; 980 u_int32_t templ; 981 u_int8_t sizeval, hpval, vpval, versionval; 982 983 char *sizestr, *hpstr, *vpstr; 984 985 versionval = *cp++; 986 987 if (ascii == NULL) 988 ascii = tmpbuf; 989 990 if (versionval) { 991 (void) sprintf(ascii, "; error: unknown LOC RR version"); 992 return (ascii); 993 } 994 995 sizeval = *cp++; 996 997 hpval = *cp++; 998 vpval = *cp++; 999 1000 GETLONG(templ, cp); 1001 latval = (templ - ((unsigned)1<<31)); 1002 1003 GETLONG(templ, cp); 1004 longval = (templ - ((unsigned)1<<31)); 1005 1006 GETLONG(templ, cp); 1007 if (templ < referencealt) { /*%< below WGS 84 spheroid */ 1008 altval = referencealt - templ; 1009 altsign = "-"; 1010 } else { 1011 altval = templ - referencealt; 1012 altsign = ""; 1013 } 1014 1015 if (latval < 0) { 1016 northsouth = 'S'; 1017 latval = -latval; 1018 } else 1019 northsouth = 'N'; 1020 1021 latsecfrac = latval % 1000; 1022 latval = latval / 1000; 1023 latsec = latval % 60; 1024 latval = latval / 60; 1025 latmin = latval % 60; 1026 latval = latval / 60; 1027 latdeg = latval; 1028 1029 if (longval < 0) { 1030 eastwest = 'W'; 1031 longval = -longval; 1032 } else 1033 eastwest = 'E'; 1034 1035 longsecfrac = longval % 1000; 1036 longval = longval / 1000; 1037 longsec = longval % 60; 1038 longval = longval / 60; 1039 longmin = longval % 60; 1040 longval = longval / 60; 1041 longdeg = longval; 1042 1043 altfrac = altval % 100; 1044 altmeters = (altval / 100); 1045 1046 sizestr = strdup(precsize_ntoa(sizeval)); 1047 hpstr = strdup(precsize_ntoa(hpval)); 1048 vpstr = strdup(precsize_ntoa(vpval)); 1049 1050 sprintf(ascii, 1051 "%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %s%d.%.2dm %sm %sm %sm", 1052 latdeg, latmin, latsec, latsecfrac, northsouth, 1053 longdeg, longmin, longsec, longsecfrac, eastwest, 1054 altsign, altmeters, altfrac, 1055 (sizestr != NULL) ? sizestr : error, 1056 (hpstr != NULL) ? hpstr : error, 1057 (vpstr != NULL) ? vpstr : error); 1058 1059 if (sizestr != NULL) 1060 free(sizestr); 1061 if (hpstr != NULL) 1062 free(hpstr); 1063 if (vpstr != NULL) 1064 free(vpstr); 1065 1066 return (ascii); 1067 } 1068 1069 1070 /*% Return the number of DNS hierarchy levels in the name. */ 1071 int 1072 dn_count_labels(const char *name) { 1073 int i, len, count; 1074 1075 len = strlen(name); 1076 for (i = 0, count = 0; i < len; i++) { 1077 /* XXX need to check for \. or use named's nlabels(). */ 1078 if (name[i] == '.') 1079 count++; 1080 } 1081 1082 /* don't count initial wildcard */ 1083 if (name[0] == '*') 1084 if (count) 1085 count--; 1086 1087 /* don't count the null label for root. */ 1088 /* if terminating '.' not found, must adjust */ 1089 /* count to include last label */ 1090 if (len > 0 && name[len-1] != '.') 1091 count++; 1092 return (count); 1093 } 1094 1095 /*% 1096 * Make dates expressed in seconds-since-Jan-1-1970 easy to read. 1097 * SIG records are required to be printed like this, by the Secure DNS RFC. 1098 */ 1099 char * 1100 p_secstodate (u_long secs) { 1101 char *output = p_secstodate_output; 1102 time_t clock = secs; 1103 struct tm *time; 1104 #ifdef HAVE_TIME_R 1105 struct tm res; 1106 1107 time = gmtime_r(&clock, &res); 1108 #else 1109 time = gmtime(&clock); 1110 #endif 1111 time->tm_year += 1900; 1112 time->tm_mon += 1; 1113 sprintf(output, "%04d%02d%02d%02d%02d%02d", 1114 time->tm_year, time->tm_mon, time->tm_mday, 1115 time->tm_hour, time->tm_min, time->tm_sec); 1116 return (output); 1117 } 1118 1119 u_int16_t 1120 res_nametoclass(const char *buf, int *successp) { 1121 unsigned long result; 1122 char *endptr; 1123 int success; 1124 1125 result = sym_ston(__p_class_syms, buf, &success); 1126 if (success) 1127 goto done; 1128 1129 if (strncasecmp(buf, "CLASS", 5) != 0 || 1130 !isdigit((unsigned char)buf[5])) 1131 goto done; 1132 errno = 0; 1133 result = strtoul(buf + 5, &endptr, 10); 1134 if (errno == 0 && *endptr == '\0' && result <= 0xffffU) 1135 success = 1; 1136 done: 1137 if (successp) 1138 *successp = success; 1139 return (result); 1140 } 1141 1142 u_int16_t 1143 res_nametotype(const char *buf, int *successp) { 1144 unsigned long result; 1145 char *endptr; 1146 int success; 1147 1148 result = sym_ston(__p_type_syms, buf, &success); 1149 if (success) 1150 goto done; 1151 1152 if (strncasecmp(buf, "type", 4) != 0 || 1153 !isdigit((unsigned char)buf[4])) 1154 goto done; 1155 errno = 0; 1156 result = strtoul(buf + 4, &endptr, 10); 1157 if (errno == 0 && *endptr == '\0' && result <= 0xffffU) 1158 success = 1; 1159 done: 1160 if (successp) 1161 *successp = success; 1162 return (result); 1163 } 1164 1165 /*! \file */ 1166