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