?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
libc: Move unused rcsid[] etc. constants into the
[dragonfly.git] / lib / libc / resolv / res_debug.c
blob670e6145900372d9903582f6f726f64d8d323914
1 /*
2 * @(#)res_debug.c 8.1 (Berkeley) 6/4/93
3 * $Id: res_debug.c,v 1.15.574.1 2008/04/03 02:12:21 marka Exp $
4 */
5
6 /*
7 * Copyright (c) 1985
8 * The Regents of the University of California. All rights reserved.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35 /*
36 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
37 *
38 * Permission to use, copy, modify, and distribute this software for any
39 * purpose with or without fee is hereby granted, provided that the above
40 * copyright notice and this permission notice appear in all copies, and that
41 * the name of Digital Equipment Corporation not be used in advertising or
42 * publicity pertaining to distribution of the document or software without
43 * specific, written prior permission.
44 *
45 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
46 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
47 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
48 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
49 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
50 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
51 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
52 * SOFTWARE.
53 */
54
55 /*
56 * Portions Copyright (c) 1995 by International Business Machines, Inc.
57 *
58 * International Business Machines, Inc. (hereinafter called IBM) grants
59 * permission under its copyrights to use, copy, modify, and distribute this
60 * Software with or without fee, provided that the above copyright notice and
61 * all paragraphs of this notice appear in all copies, and that the name of IBM
62 * not be used in connection with the marketing of any product incorporating
63 * the Software or modifications thereof, without specific, written prior
64 * permission.
65 *
66 * To the extent it has a right to do so, IBM grants an immunity from suit
67 * under its patents, if any, for the use, sale or manufacture of products to
68 * the extent that such products are used for performing Domain Name System
69 * dynamic updates in TCP/IP networks by means of the Software. No immunity is
70 * granted for any product per se or for any other function of any product.
71 *
72 * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
73 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
74 * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
75 * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
76 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
77 * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
78 */
79
80 /*
81 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
82 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
83 *
84 * Permission to use, copy, modify, and distribute this software for any
85 * purpose with or without fee is hereby granted, provided that the above
86 * copyright notice and this permission notice appear in all copies.
87 *
88 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
89 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
90 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
91 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
92 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
93 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
94 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
95 */
96
97 #include "port_before.h"
98
99 #include <sys/types.h>
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
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
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
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 *
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 *
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 *
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 *
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 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 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_tkey, "TKEY", "tkey"},
493 {ns_t_tsig, "TSIG", "transaction signature"},
494 {ns_t_ixfr, "IXFR", "incremental zone transfer"},
495 {ns_t_axfr, "AXFR", "zone transfer"},
496 {ns_t_zxfr, "ZXFR", "compressed zone transfer"},
497 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
498 {ns_t_maila, "MAILA", "mail agent (deprecated)"},
499 {ns_t_naptr, "NAPTR", "URN Naming Authority"},
500 {ns_t_kx, "KX", "Key Exchange"},
501 {ns_t_cert, "CERT", "Certificate"},
502 {ns_t_a6, "A6", "IPv6 Address"},
503 {ns_t_dname, "DNAME", "dname"},
504 {ns_t_sink, "SINK", "Kitchen Sink (experimental)"},
505 {ns_t_opt, "OPT", "EDNS Options"},
506 {ns_t_any, "ANY", "\"any\""},
507 {0, NULL, NULL}
508 };
509
510 /*%
511 * Names of DNS rcodes.
512 */
513 const struct res_sym __p_rcode_syms[] = {
514 {ns_r_noerror, "NOERROR", "no error"},
515 {ns_r_formerr, "FORMERR", "format error"},
516 {ns_r_servfail, "SERVFAIL", "server failed"},
517 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
518 {ns_r_notimpl, "NOTIMP", "not implemented"},
519 {ns_r_refused, "REFUSED", "refused"},
520 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
521 {ns_r_yxrrset, "YXRRSET", "rrset exists"},
522 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
523 {ns_r_notauth, "NOTAUTH", "not authoritative"},
524 {ns_r_notzone, "NOTZONE", "Not in zone"},
525 {ns_r_max, "", ""},
526 {ns_r_badsig, "BADSIG", "bad signature"},
527 {ns_r_badkey, "BADKEY", "bad key"},
528 {ns_r_badtime, "BADTIME", "bad time"},
529 {0, NULL, NULL}
530 };
531
532 int
533 sym_ston(const struct res_sym *syms, const char *name, int *success) {
534 for ((void)NULL; syms->name != 0; syms++) {
535 if (strcasecmp (name, syms->name) == 0) {
536 if (success)
537 *success = 1;
538 return (syms->number);
539 }
540 }
541 if (success)
542 *success = 0;
543 return (syms->number); /*%< The default value. */
544 }
545
546 const char *
547 sym_ntos(const struct res_sym *syms, int number, int *success) {
548 char *unname = sym_ntos_unname;
549
550 for ((void)NULL; syms->name != 0; syms++) {
551 if (number == syms->number) {
552 if (success)
553 *success = 1;
554 return (syms->name);
555 }
556 }
557
558 sprintf(unname, "%d", number); /*%< XXX nonreentrant */
559 if (success)
560 *success = 0;
561 return (unname);
562 }
563
564 const char *
565 sym_ntop(const struct res_sym *syms, int number, int *success) {
566 char *unname = sym_ntop_unname;
567
568 for ((void)NULL; syms->name != 0; syms++) {
569 if (number == syms->number) {
570 if (success)
571 *success = 1;
572 return (syms->humanname);
573 }
574 }
575 sprintf(unname, "%d", number); /*%< XXX nonreentrant */
576 if (success)
577 *success = 0;
578 return (unname);
579 }
580
581 /*%
582 * Return a string for the type.
583 */
584 const char *
585 p_type(int type) {
586 int success;
587 const char *result;
588 static char typebuf[20];
589
590 result = sym_ntos(__p_type_syms, type, &success);
591 if (success)
592 return (result);
593 if (type < 0 || type > 0xffff)
594 return ("BADTYPE");
595 sprintf(typebuf, "TYPE%d", type);
596 return (typebuf);
597 }
598
599 /*%
600 * Return a string for the type.
601 */
602 const char *
603 p_section(int section, int opcode) {
604 const struct res_sym *symbols;
605
606 switch (opcode) {
607 case ns_o_update:
608 symbols = __p_update_section_syms;
609 break;
610 default:
611 symbols = __p_default_section_syms;
612 break;
613 }
614 return (sym_ntos(symbols, section, (int *)0));
615 }
616
617 /*%
618 * Return a mnemonic for class.
619 */
620 const char *
621 p_class(int class) {
622 int success;
623 const char *result;
624 static char classbuf[20];
625
626 result = sym_ntos(__p_class_syms, class, &success);
627 if (success)
628 return (result);
629 if (class < 0 || class > 0xffff)
630 return ("BADCLASS");
631 sprintf(classbuf, "CLASS%d", class);
632 return (classbuf);
633 }
634
635 /*%
636 * Return a mnemonic for an option
637 */
638 const char *
639 p_option(u_long option) {
640 char *nbuf = p_option_nbuf;
641
642 switch (option) {
643 case RES_INIT: return "init";
644 case RES_DEBUG: return "debug";
645 case RES_AAONLY: return "aaonly(unimpl)";
646 case RES_USEVC: return "usevc";
647 case RES_PRIMARY: return "primry(unimpl)";
648 case RES_IGNTC: return "igntc";
649 case RES_RECURSE: return "recurs";
650 case RES_DEFNAMES: return "defnam";
651 case RES_STAYOPEN: return "styopn";
652 case RES_DNSRCH: return "dnsrch";
653 case RES_INSECURE1: return "insecure1";
654 case RES_INSECURE2: return "insecure2";
655 case RES_NOALIASES: return "noaliases";
656 case RES_USE_INET6: return "inet6";
657 #ifdef RES_USE_EDNS0 /*%< KAME extension */
658 case RES_USE_EDNS0: return "edns0";
659 case RES_NSID: return "nsid";
660 #endif
661 #ifdef RES_USE_DNAME
662 case RES_USE_DNAME: return "dname";
663 #endif
664 #ifdef RES_USE_DNSSEC
665 case RES_USE_DNSSEC: return "dnssec";
666 #endif
667 #ifdef RES_NOTLDQUERY
668 case RES_NOTLDQUERY: return "no-tld-query";
669 #endif
670 #ifdef RES_NO_NIBBLE2
671 case RES_NO_NIBBLE2: return "no-nibble2";
672 #endif
673 /* XXX nonreentrant */
674 default: sprintf(nbuf, "?0x%lx?", (u_long)option);
675 return (nbuf);
676 }
677 }
678
679 /*%
680 * Return a mnemonic for a time to live.
681 */
682 const char *
683 p_time(u_int32_t value) {
684 char *nbuf = p_time_nbuf;
685
686 if (ns_format_ttl(value, nbuf, sizeof nbuf) < 0)
687 sprintf(nbuf, "%u", value);
688 return (nbuf);
689 }
690
691 /*%
692 * Return a string for the rcode.
693 */
694 const char *
695 p_rcode(int rcode) {
696 return (sym_ntos(__p_rcode_syms, rcode, (int *)0));
697 }
698
699 /*%
700 * Return a string for a res_sockaddr_union.
701 */
702 const char *
703 p_sockun(union res_sockaddr_union u, char *buf, size_t size) {
704 char ret[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:123.123.123.123"];
705
706 switch (u.sin.sin_family) {
707 case AF_INET:
708 inet_ntop(AF_INET, &u.sin.sin_addr, ret, sizeof ret);
709 break;
710 #ifdef HAS_INET6_STRUCTS
711 case AF_INET6:
712 inet_ntop(AF_INET6, &u.sin6.sin6_addr, ret, sizeof ret);
713 break;
714 #endif
715 default:
716 sprintf(ret, "[af%d]", u.sin.sin_family);
717 break;
718 }
719 if (size > 0U) {
720 strncpy(buf, ret, size - 1);
721 buf[size - 1] = '0';
722 }
723 return (buf);
724 }
725
726 /*%
727 * routines to convert between on-the-wire RR format and zone file format.
728 * Does not contain conversion to/from decimal degrees; divide or multiply
729 * by 60*60*1000 for that.
730 */
731
732 static unsigned int poweroften[10] = {1, 10, 100, 1000, 10000, 100000,
733 1000000,10000000,100000000,1000000000};
734
735 /*% takes an XeY precision/size value, returns a string representation. */
736 static const char *
737 precsize_ntoa(u_int8_t prec)
738 {
739 char *retbuf = precsize_ntoa_retbuf;
740 unsigned long val;
741 int mantissa, exponent;
742
743 mantissa = (int)((prec >> 4) & 0x0f) % 10;
744 exponent = (int)((prec >> 0) & 0x0f) % 10;
745
746 val = mantissa * poweroften[exponent];
747
748 (void) sprintf(retbuf, "%lu.%.2lu", val/100, val%100);
749 return (retbuf);
750 }
751
752 /*% converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */
753 static u_int8_t
754 precsize_aton(const char **strptr) {
755 unsigned int mval = 0, cmval = 0;
756 u_int8_t retval = 0;
757 const char *cp;
758 int exponent;
759 int mantissa;
760
761 cp = *strptr;
762
763 while (isdigit((unsigned char)*cp))
764 mval = mval * 10 + (*cp++ - '0');
765
766 if (*cp == '.') { /*%< centimeters */
767 cp++;
768 if (isdigit((unsigned char)*cp)) {
769 cmval = (*cp++ - '0') * 10;
770 if (isdigit((unsigned char)*cp)) {
771 cmval += (*cp++ - '0');
772 }
773 }
774 }
775 cmval = (mval * 100) + cmval;
776
777 for (exponent = 0; exponent < 9; exponent++)
778 if (cmval < poweroften[exponent+1])
779 break;
780
781 mantissa = cmval / poweroften[exponent];
782 if (mantissa > 9)
783 mantissa = 9;
784
785 retval = (mantissa << 4) | exponent;
786
787 *strptr = cp;
788
789 return (retval);
790 }
791
792 /*% converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */
793 static u_int32_t
794 latlon2ul(const char **latlonstrptr, int *which) {
795 const char *cp;
796 u_int32_t retval;
797 int deg = 0, min = 0, secs = 0, secsfrac = 0;
798
799 cp = *latlonstrptr;
800
801 while (isdigit((unsigned char)*cp))
802 deg = deg * 10 + (*cp++ - '0');
803
804 while (isspace((unsigned char)*cp))
805 cp++;
806
807 if (!(isdigit((unsigned char)*cp)))
808 goto fndhemi;
809
810 while (isdigit((unsigned char)*cp))
811 min = min * 10 + (*cp++ - '0');
812
813 while (isspace((unsigned char)*cp))
814 cp++;
815
816 if (!(isdigit((unsigned char)*cp)))
817 goto fndhemi;
818
819 while (isdigit((unsigned char)*cp))
820 secs = secs * 10 + (*cp++ - '0');
821
822 if (*cp == '.') { /*%< decimal seconds */
823 cp++;
824 if (isdigit((unsigned char)*cp)) {
825 secsfrac = (*cp++ - '0') * 100;
826 if (isdigit((unsigned char)*cp)) {
827 secsfrac += (*cp++ - '0') * 10;
828 if (isdigit((unsigned char)*cp)) {
829 secsfrac += (*cp++ - '0');
830 }
831 }
832 }
833 }
834
835 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */
836 cp++;
837
838 while (isspace((unsigned char)*cp))
839 cp++;
840
841 fndhemi:
842 switch (*cp) {
843 case 'N': case 'n':
844 case 'E': case 'e':
845 retval = ((unsigned)1<<31)
846 + (((((deg * 60) + min) * 60) + secs) * 1000)
847 + secsfrac;
848 break;
849 case 'S': case 's':
850 case 'W': case 'w':
851 retval = ((unsigned)1<<31)
852 - (((((deg * 60) + min) * 60) + secs) * 1000)
853 - secsfrac;
854 break;
855 default:
856 retval = 0; /*%< invalid value -- indicates error */
857 break;
858 }
859
860 switch (*cp) {
861 case 'N': case 'n':
862 case 'S': case 's':
863 *which = 1; /*%< latitude */
864 break;
865 case 'E': case 'e':
866 case 'W': case 'w':
867 *which = 2; /*%< longitude */
868 break;
869 default:
870 *which = 0; /*%< error */
871 break;
872 }
873
874 cp++; /*%< skip the hemisphere */
875 while (!isspace((unsigned char)*cp)) /*%< if any trailing garbage */
876 cp++;
877
878 while (isspace((unsigned char)*cp)) /*%< move to next field */
879 cp++;
880
881 *latlonstrptr = cp;
882
883 return (retval);
884 }
885
886 /*%
887 * converts a zone file representation in a string to an RDATA on-the-wire
888 * representation. */
889 int
890 loc_aton(const char *ascii, u_char *binary)
891 {
892 const char *cp, *maxcp;
893 u_char *bcp;
894
895 u_int32_t latit = 0, longit = 0, alt = 0;
896 u_int32_t lltemp1 = 0, lltemp2 = 0;
897 int altmeters = 0, altfrac = 0, altsign = 1;
898 u_int8_t hp = 0x16; /*%< default = 1e6 cm = 10000.00m = 10km */
899 u_int8_t vp = 0x13; /*%< default = 1e3 cm = 10.00m */
900 u_int8_t siz = 0x12; /*%< default = 1e2 cm = 1.00m */
901 int which1 = 0, which2 = 0;
902
903 cp = ascii;
904 maxcp = cp + strlen(ascii);
905
906 lltemp1 = latlon2ul(&cp, &which1);
907
908 lltemp2 = latlon2ul(&cp, &which2);
909
910 switch (which1 + which2) {
911 case 3: /*%< 1 + 2, the only valid combination */
912 if ((which1 == 1) && (which2 == 2)) { /*%< normal case */
913 latit = lltemp1;
914 longit = lltemp2;
915 } else if ((which1 == 2) && (which2 == 1)) { /*%< reversed */
916 longit = lltemp1;
917 latit = lltemp2;
918 } else { /*%< some kind of brokenness */
919 return (0);
920 }
921 break;
922 default: /*%< we didn't get one of each */
923 return (0);
924 }
925
926 /* altitude */
927 if (*cp == '-') {
928 altsign = -1;
929 cp++;
930 }
931
932 if (*cp == '+')
933 cp++;
934
935 while (isdigit((unsigned char)*cp))
936 altmeters = altmeters * 10 + (*cp++ - '0');
937
938 if (*cp == '.') { /*%< decimal meters */
939 cp++;
940 if (isdigit((unsigned char)*cp)) {
941 altfrac = (*cp++ - '0') * 10;
942 if (isdigit((unsigned char)*cp)) {
943 altfrac += (*cp++ - '0');
944 }
945 }
946 }
947
948 alt = (10000000 + (altsign * (altmeters * 100 + altfrac)));
949
950 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */
951 cp++;
952
953 while (isspace((unsigned char)*cp) && (cp < maxcp))
954 cp++;
955
956 if (cp >= maxcp)
957 goto defaults;
958
959 siz = precsize_aton(&cp);
960
961 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */
962 cp++;
963
964 while (isspace((unsigned char)*cp) && (cp < maxcp))
965 cp++;
966
967 if (cp >= maxcp)
968 goto defaults;
969
970 hp = precsize_aton(&cp);
971
972 while (!isspace((unsigned char)*cp) && (cp < maxcp)) /*%< if trailing garbage or m */
973 cp++;
974
975 while (isspace((unsigned char)*cp) && (cp < maxcp))
976 cp++;
977
978 if (cp >= maxcp)
979 goto defaults;
980
981 vp = precsize_aton(&cp);
982
983 defaults:
984
985 bcp = binary;
986 *bcp++ = (u_int8_t) 0; /*%< version byte */
987 *bcp++ = siz;
988 *bcp++ = hp;
989 *bcp++ = vp;
990 PUTLONG(latit,bcp);
991 PUTLONG(longit,bcp);
992 PUTLONG(alt,bcp);
993
994 return (16); /*%< size of RR in octets */
995 }
996
997 /*% takes an on-the-wire LOC RR and formats it in a human readable format. */
998 const char *
999 loc_ntoa(const u_char *binary, char *ascii)
1000 {
1001 static const char *error = "?";
1002 static char tmpbuf[sizeof
1003 "1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"];
1004 const u_char *cp = binary;
1005
1006 int latdeg, latmin, latsec, latsecfrac;
1007 int longdeg, longmin, longsec, longsecfrac;
1008 char northsouth, eastwest;
1009 const char *altsign;
1010 int altmeters, altfrac;
1011
1012 const u_int32_t referencealt = 100000 * 100;
1013
1014 int32_t latval, longval, altval;
1015 u_int32_t templ;
1016 u_int8_t sizeval, hpval, vpval, versionval;
1017
1018 char *sizestr, *hpstr, *vpstr;
1019
1020 versionval = *cp++;
1021
1022 if (ascii == NULL)
1023 ascii = tmpbuf;
1024
1025 if (versionval) {
1026 (void) sprintf(ascii, "; error: unknown LOC RR version");
1027 return (ascii);
1028 }
1029
1030 sizeval = *cp++;
1031
1032 hpval = *cp++;
1033 vpval = *cp++;
1034
1035 GETLONG(templ, cp);
1036 latval = (templ - ((unsigned)1<<31));
1037
1038 GETLONG(templ, cp);
1039 longval = (templ - ((unsigned)1<<31));
1040
1041 GETLONG(templ, cp);
1042 if (templ < referencealt) { /*%< below WGS 84 spheroid */
1043 altval = referencealt - templ;
1044 altsign = "-";
1045 } else {
1046 altval = templ - referencealt;
1047 altsign = "";
1048 }
1049
1050 if (latval < 0) {
1051 northsouth = 'S';
1052 latval = -latval;
1053 } else
1054 northsouth = 'N';
1055
1056 latsecfrac = latval % 1000;
1057 latval = latval / 1000;
1058 latsec = latval % 60;
1059 latval = latval / 60;
1060 latmin = latval % 60;
1061 latval = latval / 60;
1062 latdeg = latval;
1063
1064 if (longval < 0) {
1065 eastwest = 'W';
1066 longval = -longval;
1067 } else
1068 eastwest = 'E';
1069
1070 longsecfrac = longval % 1000;
1071 longval = longval / 1000;
1072 longsec = longval % 60;
1073 longval = longval / 60;
1074 longmin = longval % 60;
1075 longval = longval / 60;
1076 longdeg = longval;
1077
1078 altfrac = altval % 100;
1079 altmeters = (altval / 100);
1080
1081 sizestr = strdup(precsize_ntoa(sizeval));
1082 hpstr = strdup(precsize_ntoa(hpval));
1083 vpstr = strdup(precsize_ntoa(vpval));
1084
1085 sprintf(ascii,
1086 "%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %s%d.%.2dm %sm %sm %sm",
1087 latdeg, latmin, latsec, latsecfrac, northsouth,
1088 longdeg, longmin, longsec, longsecfrac, eastwest,
1089 altsign, altmeters, altfrac,
1090 (sizestr != NULL) ? sizestr : error,
1091 (hpstr != NULL) ? hpstr : error,
1092 (vpstr != NULL) ? vpstr : error);
1093
1094 if (sizestr != NULL)
1095 free(sizestr);
1096 if (hpstr != NULL)
1097 free(hpstr);
1098 if (vpstr != NULL)
1099 free(vpstr);
1100
1101 return (ascii);
1102 }
1103
1104
1105 /*% Return the number of DNS hierarchy levels in the name. */
1106 int
1107 dn_count_labels(const char *name) {
1108 int i, len, count;
1109
1110 len = strlen(name);
1111 for (i = 0, count = 0; i < len; i++) {
1112 /* XXX need to check for \. or use named's nlabels(). */
1113 if (name[i] == '.')
1114 count++;
1115 }
1116
1117 /* don't count initial wildcard */
1118 if (name[0] == '*')
1119 if (count)
1120 count--;
1121
1122 /* don't count the null label for root. */
1123 /* if terminating '.' not found, must adjust */
1124 /* count to include last label */
1125 if (len > 0 && name[len-1] != '.')
1126 count++;
1127 return (count);
1128 }
1129
1130 /*%
1131 * Make dates expressed in seconds-since-Jan-1-1970 easy to read.
1132 * SIG records are required to be printed like this, by the Secure DNS RFC.
1133 */
1134 char *
1135 p_secstodate (u_long secs) {
1136 char *output = p_secstodate_output;
1137 time_t clock = secs;
1138 struct tm *time;
1139 #ifdef HAVE_TIME_R
1140 struct tm res;
1141
1142 time = gmtime_r(&clock, &res);
1143 #else
1144 time = gmtime(&clock);
1145 #endif
1146 time->tm_year += 1900;
1147 time->tm_mon += 1;
1148 sprintf(output, "%04d%02d%02d%02d%02d%02d",
1149 time->tm_year, time->tm_mon, time->tm_mday,
1150 time->tm_hour, time->tm_min, time->tm_sec);
1151 return (output);
1152 }
1153
1154 u_int16_t
1155 res_nametoclass(const char *buf, int *successp) {
1156 unsigned long result;
1157 char *endptr;
1158 int success;
1159
1160 result = sym_ston(__p_class_syms, buf, &success);
1161 if (success)
1162 goto done;
1163
1164 if (strncasecmp(buf, "CLASS", 5) != 0 ||
1165 !isdigit((unsigned char)buf[5]))
1166 goto done;
1167 errno = 0;
1168 result = strtoul(buf + 5, &endptr, 10);
1169 if (errno == 0 && *endptr == '\0' && result <= 0xffffU)
1170 success = 1;
1171 done:
1172 if (successp)
1173 *successp = success;
1174 return (result);
1175 }
1176
1177 u_int16_t
1178 res_nametotype(const char *buf, int *successp) {
1179 unsigned long result;
1180 char *endptr;
1181 int success;
1182
1183 result = sym_ston(__p_type_syms, buf, &success);
1184 if (success)
1185 goto done;
1186
1187 if (strncasecmp(buf, "type", 4) != 0 ||
1188 !isdigit((unsigned char)buf[4]))
1189 goto done;
1190 errno = 0;
1191 result = strtoul(buf + 4, &endptr, 10);
1192 if (errno == 0 && *endptr == '\0' && result <= 0xffffU)
1193 success = 1;
1194 done:
1195 if (successp)
1196 *successp = success;
1197 return (result);
1198 }
1199
1200 #ifdef _LIBC
1201 /*
1202 * Weak aliases for applications that use certain private entry points,
1203 * and fail to include <resolv.h>.
1204 */
1205 #undef fp_resstat
1206 __weak_reference(__fp_resstat, fp_resstat);
1207 #undef p_fqnname
1208 __weak_reference(__p_fqnname, p_fqnname);
1209 #undef sym_ston
1210 __weak_reference(__sym_ston, sym_ston);
1211 #undef sym_ntos
1212 __weak_reference(__sym_ntos, sym_ntos);
1213 #undef sym_ntop
1214 __weak_reference(__sym_ntop, sym_ntop);
1215 #undef dn_count_labels
1216 __weak_reference(__dn_count_labels, dn_count_labels);
1217 #undef p_secstodate
1218 __weak_reference(__p_secstodate, p_secstodate);
1219 #endif
1220 /*! \file */
DragonFly BSD