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