Update.
[glibc.git] / resolv / res_debug.c
blob839069de3da49c6930a10286f43194d7088bba4f
1 /*
2 * Copyright (c) 1985
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
31 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
33 * Permission to use, copy, modify, and distribute this software for any
34 * purpose with or without fee is hereby granted, provided that the above
35 * copyright notice and this permission notice appear in all copies, and that
36 * the name of Digital Equipment Corporation not be used in advertising or
37 * publicity pertaining to distribution of the document or software without
38 * specific, written prior permission.
40 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
41 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
42 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
43 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
44 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
45 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
46 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
47 * SOFTWARE.
51 * Portions Copyright (c) 1995 by International Business Machines, Inc.
53 * International Business Machines, Inc. (hereinafter called IBM) grants
54 * permission under its copyrights to use, copy, modify, and distribute this
55 * Software with or without fee, provided that the above copyright notice and
56 * all paragraphs of this notice appear in all copies, and that the name of IBM
57 * not be used in connection with the marketing of any product incorporating
58 * the Software or modifications thereof, without specific, written prior
59 * permission.
61 * To the extent it has a right to do so, IBM grants an immunity from suit
62 * under its patents, if any, for the use, sale or manufacture of products to
63 * the extent that such products are used for performing Domain Name System
64 * dynamic updates in TCP/IP networks by means of the Software. No immunity is
65 * granted for any product per se or for any other function of any product.
67 * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
68 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
69 * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
70 * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
71 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
72 * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
76 * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
78 * Permission to use, copy, modify, and distribute this software for any
79 * purpose with or without fee is hereby granted, provided that the above
80 * copyright notice and this permission notice appear in all copies.
82 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
83 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
84 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
85 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
86 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
87 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
88 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
89 * SOFTWARE.
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[] = "$BINDId: res_debug.c,v 8.34 2000/02/29 05:30:55 vixie Exp $";
95 #endif /* LIBC_SCCS and not lint */
97 #include <sys/types.h>
98 #include <sys/param.h>
99 #include <sys/socket.h>
101 #include <netinet/in.h>
102 #include <arpa/inet.h>
103 #include <arpa/nameser.h>
105 #include <ctype.h>
106 #include <errno.h>
107 #include <math.h>
108 #include <netdb.h>
109 #include <resolv.h>
110 #include <stdio.h>
111 #include <stdlib.h>
112 #include <string.h>
113 #include <time.h>
115 #ifdef SPRINTF_CHAR
116 # define SPRINTF(x) strlen(sprintf/**/x)
117 #else
118 # define SPRINTF(x) sprintf x
119 #endif
121 extern const char *_res_sectioncodes[] attribute_hidden;
124 * Print the current options.
126 void
127 fp_resstat(const res_state statp, FILE *file) {
128 u_long mask;
130 fprintf(file, ";; res options:");
131 for (mask = 1; mask != 0; mask <<= 1)
132 if (statp->options & mask)
133 fprintf(file, " %s", p_option(mask));
134 putc('\n', file);
137 static void
138 do_section(const res_state statp,
139 ns_msg *handle, ns_sect section,
140 int pflag, FILE *file)
142 int n, sflag, rrnum;
143 static int buflen = 2048;
144 char *buf;
145 ns_opcode opcode;
146 ns_rr rr;
149 * Print answer records.
151 sflag = (statp->pfcode & pflag);
152 if (statp->pfcode && !sflag)
153 return;
155 buf = malloc(buflen);
156 if (buf == NULL) {
157 fprintf(file, ";; memory allocation failure\n");
158 return;
161 opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode);
162 rrnum = 0;
163 for (;;) {
164 if (ns_parserr(handle, section, rrnum, &rr)) {
165 if (errno != ENODEV)
166 fprintf(file, ";; ns_parserr: %s\n",
167 strerror(errno));
168 else if (rrnum > 0 && sflag != 0 &&
169 (statp->pfcode & RES_PRF_HEAD1))
170 putc('\n', file);
171 goto cleanup;
173 if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
174 fprintf(file, ";; %s SECTION:\n",
175 p_section(section, opcode));
176 if (section == ns_s_qd)
177 fprintf(file, ";;\t%s, type = %s, class = %s\n",
178 ns_rr_name(rr),
179 p_type(ns_rr_type(rr)),
180 p_class(ns_rr_class(rr)));
181 else {
182 n = ns_sprintrr(handle, &rr, NULL, NULL,
183 buf, buflen);
184 if (n < 0) {
185 if (errno == ENOSPC) {
186 free(buf);
187 buf = NULL;
188 if (buflen < 131072)
189 buf = malloc(buflen += 1024);
190 if (buf == NULL) {
191 fprintf(file,
192 ";; memory allocation failure\n");
193 return;
195 continue;
197 fprintf(file, ";; ns_sprintrr: %s\n",
198 strerror(errno));
199 goto cleanup;
201 fputs(buf, file);
202 fputc('\n', file);
204 rrnum++;
206 cleanup:
207 if (buf != NULL)
208 free(buf);
212 * Print the contents of a query.
213 * This is intended to be primarily a debugging routine.
215 void
216 res_pquery(const res_state statp, const u_char *msg, int len, FILE *file) {
217 ns_msg handle;
218 int qdcount, ancount, nscount, arcount;
219 u_int opcode, rcode, id;
221 if (ns_initparse(msg, len, &handle) < 0) {
222 fprintf(file, ";; ns_initparse: %s\n", strerror(errno));
223 return;
225 opcode = ns_msg_getflag(handle, ns_f_opcode);
226 rcode = ns_msg_getflag(handle, ns_f_rcode);
227 id = ns_msg_id(handle);
228 qdcount = ns_msg_count(handle, ns_s_qd);
229 ancount = ns_msg_count(handle, ns_s_an);
230 nscount = ns_msg_count(handle, ns_s_ns);
231 arcount = ns_msg_count(handle, ns_s_ar);
234 * Print header fields.
236 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode)
237 fprintf(file,
238 ";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n",
239 _res_opcodes[opcode], p_rcode(rcode), id);
240 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX))
241 putc(';', file);
242 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) {
243 fprintf(file, "; flags:");
244 if (ns_msg_getflag(handle, ns_f_qr))
245 fprintf(file, " qr");
246 if (ns_msg_getflag(handle, ns_f_aa))
247 fprintf(file, " aa");
248 if (ns_msg_getflag(handle, ns_f_tc))
249 fprintf(file, " tc");
250 if (ns_msg_getflag(handle, ns_f_rd))
251 fprintf(file, " rd");
252 if (ns_msg_getflag(handle, ns_f_ra))
253 fprintf(file, " ra");
254 if (ns_msg_getflag(handle, ns_f_z))
255 fprintf(file, " ??");
256 if (ns_msg_getflag(handle, ns_f_ad))
257 fprintf(file, " ad");
258 if (ns_msg_getflag(handle, ns_f_cd))
259 fprintf(file, " cd");
261 if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) {
262 fprintf(file, "; %s: %d",
263 p_section(ns_s_qd, opcode), qdcount);
264 fprintf(file, ", %s: %d",
265 p_section(ns_s_an, opcode), ancount);
266 fprintf(file, ", %s: %d",
267 p_section(ns_s_ns, opcode), nscount);
268 fprintf(file, ", %s: %d",
269 p_section(ns_s_ar, opcode), arcount);
271 if ((!statp->pfcode) || (statp->pfcode &
272 (RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) {
273 putc('\n',file);
276 * Print the various sections.
278 do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file);
279 do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file);
280 do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file);
281 do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file);
282 if (qdcount == 0 && ancount == 0 &&
283 nscount == 0 && arcount == 0)
284 putc('\n', file);
287 const u_char *
288 p_cdnname(const u_char *cp, const u_char *msg, int len, FILE *file) {
289 char name[MAXDNAME];
290 int n;
292 if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0)
293 return (NULL);
294 if (name[0] == '\0')
295 putc('.', file);
296 else
297 fputs(name, file);
298 return (cp + n);
300 libresolv_hidden_def (p_cdnname)
302 const u_char *
303 p_cdname(const u_char *cp, const u_char *msg, FILE *file) {
304 return (p_cdnname(cp, msg, PACKETSZ, file));
307 /* Return a fully-qualified domain name from a compressed name (with
308 length supplied). */
310 const u_char *
311 p_fqnname(cp, msg, msglen, name, namelen)
312 const u_char *cp, *msg;
313 int msglen;
314 char *name;
315 int namelen;
317 int n, newlen;
319 if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0)
320 return (NULL);
321 newlen = strlen(name);
322 if (newlen == 0 || name[newlen - 1] != '.') {
323 if (newlen + 1 >= namelen) /* Lack space for final dot */
324 return (NULL);
325 else
326 strcpy(name + newlen, ".");
328 return (cp + n);
330 libresolv_hidden_def (p_fqnname)
332 /* XXX: the rest of these functions need to become length-limited, too. */
334 const u_char *
335 p_fqname(const u_char *cp, const u_char *msg, FILE *file) {
336 char name[MAXDNAME];
337 const u_char *n;
339 n = p_fqnname(cp, msg, MAXCDNAME, name, sizeof name);
340 if (n == NULL)
341 return (NULL);
342 fputs(name, file);
343 return (n);
347 * Names of RR classes and qclasses. Classes and qclasses are the same, except
348 * that C_ANY is a qclass but not a class. (You can ask for records of class
349 * C_ANY, but you can't have any records of that class in the database.)
351 extern const struct res_sym __p_class_syms[];
352 libresolv_hidden_proto (__p_class_syms)
353 const struct res_sym __p_class_syms[] = {
354 {C_IN, "IN"},
355 {C_CHAOS, "CHAOS"},
356 {C_HS, "HS"},
357 {C_HS, "HESIOD"},
358 {C_ANY, "ANY"},
359 {C_NONE, "NONE"},
360 {C_IN, (char *)0}
362 libresolv_hidden_data_def (__p_class_syms)
365 * Names of message sections.
367 const struct res_sym __p_default_section_syms[] attribute_hidden = {
368 {ns_s_qd, "QUERY"},
369 {ns_s_an, "ANSWER"},
370 {ns_s_ns, "AUTHORITY"},
371 {ns_s_ar, "ADDITIONAL"},
372 {0, (char *)0}
375 const struct res_sym __p_update_section_syms[] attribute_hidden = {
376 {S_ZONE, "ZONE"},
377 {S_PREREQ, "PREREQUISITE"},
378 {S_UPDATE, "UPDATE"},
379 {S_ADDT, "ADDITIONAL"},
380 {0, (char *)0}
383 const struct res_sym __p_key_syms[] attribute_hidden = {
384 {NS_ALG_MD5RSA, "RSA", "RSA KEY with MD5 hash"},
385 {NS_ALG_DH, "DH", "Diffie Hellman"},
386 {NS_ALG_DSA, "DSA", "Digital Signature Algorithm"},
387 {NS_ALG_EXPIRE_ONLY, "EXPIREONLY", "No algorithm"},
388 {NS_ALG_PRIVATE_OID, "PRIVATE", "Algorithm obtained from OID"},
389 {0, NULL, NULL}
392 const struct res_sym __p_cert_syms[] attribute_hidden = {
393 {cert_t_pkix, "PKIX", "PKIX (X.509v3) Certificate"},
394 {cert_t_spki, "SPKI", "SPKI certificate"},
395 {cert_t_pgp, "PGP", "PGP certificate"},
396 {cert_t_url, "URL", "URL Private"},
397 {cert_t_oid, "OID", "OID Private"},
398 {0, NULL, NULL}
402 * Names of RR types and qtypes. Types and qtypes are the same, except
403 * that T_ANY is a qtype but not a type. (You can ask for records of type
404 * T_ANY, but you can't have any records of that type in the database.)
406 extern const struct res_sym __p_type_syms[];
407 libresolv_hidden_proto (__p_type_syms)
408 const struct res_sym __p_type_syms[] = {
409 {ns_t_a, "A", "address"},
410 {ns_t_ns, "NS", "name server"},
411 {ns_t_md, "MD", "mail destination (deprecated)"},
412 {ns_t_mf, "MF", "mail forwarder (deprecated)"},
413 {ns_t_cname, "CNAME", "canonical name"},
414 {ns_t_soa, "SOA", "start of authority"},
415 {ns_t_mb, "MB", "mailbox"},
416 {ns_t_mg, "MG", "mail group member"},
417 {ns_t_mr, "MR", "mail rename"},
418 {ns_t_null, "NULL", "null"},
419 {ns_t_wks, "WKS", "well-known service (deprecated)"},
420 {ns_t_ptr, "PTR", "domain name pointer"},
421 {ns_t_hinfo, "HINFO", "host information"},
422 {ns_t_minfo, "MINFO", "mailbox information"},
423 {ns_t_mx, "MX", "mail exchanger"},
424 {ns_t_txt, "TXT", "text"},
425 {ns_t_rp, "RP", "responsible person"},
426 {ns_t_afsdb, "AFSDB", "DCE or AFS server"},
427 {ns_t_x25, "X25", "X25 address"},
428 {ns_t_isdn, "ISDN", "ISDN address"},
429 {ns_t_rt, "RT", "router"},
430 {ns_t_nsap, "NSAP", "nsap address"},
431 {ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"},
432 {ns_t_sig, "SIG", "signature"},
433 {ns_t_key, "KEY", "key"},
434 {ns_t_px, "PX", "mapping information"},
435 {ns_t_gpos, "GPOS", "geographical position (withdrawn)"},
436 {ns_t_aaaa, "AAAA", "IPv6 address"},
437 {ns_t_loc, "LOC", "location"},
438 {ns_t_nxt, "NXT", "next valid name (unimplemented)"},
439 {ns_t_eid, "EID", "endpoint identifier (unimplemented)"},
440 {ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"},
441 {ns_t_srv, "SRV", "server selection"},
442 {ns_t_atma, "ATMA", "ATM address (unimplemented)"},
443 {ns_t_tsig, "TSIG", "transaction signature"},
444 {ns_t_ixfr, "IXFR", "incremental zone transfer"},
445 {ns_t_axfr, "AXFR", "zone transfer"},
446 {ns_t_zxfr, "ZXFR", "compressed zone transfer"},
447 {ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
448 {ns_t_maila, "MAILA", "mail agent (deprecated)"},
449 {ns_t_naptr, "NAPTR", "URN Naming Authority"},
450 {ns_t_kx, "KX", "Key Exchange"},
451 {ns_t_cert, "CERT", "Certificate"},
452 {ns_t_any, "ANY", "\"any\""},
453 {0, NULL, NULL}
455 libresolv_hidden_data_def (__p_type_syms)
458 * Names of DNS rcodes.
460 const struct res_sym __p_rcode_syms[] attribute_hidden = {
461 {ns_r_noerror, "NOERROR", "no error"},
462 {ns_r_formerr, "FORMERR", "format error"},
463 {ns_r_servfail, "SERVFAIL", "server failed"},
464 {ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
465 {ns_r_notimpl, "NOTIMP", "not implemented"},
466 {ns_r_refused, "REFUSED", "refused"},
467 {ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
468 {ns_r_yxrrset, "YXRRSET", "rrset exists"},
469 {ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
470 {ns_r_notauth, "NOTAUTH", "not authoritative"},
471 {ns_r_notzone, "NOTZONE", "Not in zone"},
472 {ns_r_max, "", ""},
473 {ns_r_badsig, "BADSIG", "bad signature"},
474 {ns_r_badkey, "BADKEY", "bad key"},
475 {ns_r_badtime, "BADTIME", "bad time"},
476 {0, NULL, NULL}
480 sym_ston(const struct res_sym *syms, const char *name, int *success) {
481 for ((void)NULL; syms->name != 0; syms++) {
482 if (strcasecmp (name, syms->name) == 0) {
483 if (success)
484 *success = 1;
485 return (syms->number);
488 if (success)
489 *success = 0;
490 return (syms->number); /* The default value. */
493 const char *
494 sym_ntos(const struct res_sym *syms, int number, int *success) {
495 static char unname[20];
497 for ((void)NULL; syms->name != 0; syms++) {
498 if (number == syms->number) {
499 if (success)
500 *success = 1;
501 return (syms->name);
505 sprintf(unname, "%d", number); /* XXX nonreentrant */
506 if (success)
507 *success = 0;
508 return (unname);
510 libresolv_hidden_def (sym_ntos)
512 const char *
513 sym_ntop(const struct res_sym *syms, int number, int *success) {
514 static char unname[20];
516 for ((void)NULL; syms->name != 0; syms++) {
517 if (number == syms->number) {
518 if (success)
519 *success = 1;
520 return (syms->humanname);
523 sprintf(unname, "%d", number); /* XXX nonreentrant */
524 if (success)
525 *success = 0;
526 return (unname);
530 * Return a string for the type.
532 const char *
533 p_type(int type) {
534 return (sym_ntos(__p_type_syms, type, (int *)0));
536 libresolv_hidden_def (p_type)
539 * Return a string for the type.
541 const char *
542 p_section(int section, int opcode) {
543 const struct res_sym *symbols;
545 switch (opcode) {
546 case ns_o_update:
547 symbols = __p_update_section_syms;
548 break;
549 default:
550 symbols = __p_default_section_syms;
551 break;
553 return (sym_ntos(symbols, section, (int *)0));
557 * Return a mnemonic for class.
559 const char *
560 p_class(int class) {
561 return (sym_ntos(__p_class_syms, class, (int *)0));
563 libresolv_hidden_def (p_class)
566 * Return a mnemonic for an option
568 const char *
569 p_option(u_long option) {
570 static char nbuf[40];
572 switch (option) {
573 case RES_INIT: return "init";
574 case RES_DEBUG: return "debug";
575 case RES_AAONLY: return "aaonly(unimpl)";
576 case RES_USEVC: return "usevc";
577 case RES_PRIMARY: return "primry(unimpl)";
578 case RES_IGNTC: return "igntc";
579 case RES_RECURSE: return "recurs";
580 case RES_DEFNAMES: return "defnam";
581 case RES_STAYOPEN: return "styopn";
582 case RES_DNSRCH: return "dnsrch";
583 case RES_INSECURE1: return "insecure1";
584 case RES_INSECURE2: return "insecure2";
585 case RES_USE_INET6: return "inet6";
586 case RES_ROTATE: return "rotate";
587 case RES_NOCHECKNAME: return "no-check-names";
588 case RES_USEBSTRING: return "ip6-bytstring";
589 /* XXX nonreentrant */
590 default: sprintf(nbuf, "?0x%lx?", (u_long)option);
591 return (nbuf);
594 libresolv_hidden_def (p_option)
597 * Return a mnemonic for a time to live.
599 const char *
600 p_time(u_int32_t value) {
601 static char nbuf[40]; /* XXX nonreentrant */
603 if (ns_format_ttl(value, nbuf, sizeof nbuf) < 0)
604 sprintf(nbuf, "%u", value);
605 return (nbuf);
609 * Return a string for the rcode.
611 const char *
612 p_rcode(int rcode) {
613 return (sym_ntos(__p_rcode_syms, rcode, (int *)0));
615 libresolv_hidden_def (p_rcode)
618 * routines to convert between on-the-wire RR format and zone file format.
619 * Does not contain conversion to/from decimal degrees; divide or multiply
620 * by 60*60*1000 for that.
623 static const unsigned int poweroften[10]=
624 { 1, 10, 100, 1000, 10000, 100000,
625 1000000,10000000,100000000,1000000000};
627 /* takes an XeY precision/size value, returns a string representation. */
628 static const char *
629 precsize_ntoa(prec)
630 u_int8_t prec;
632 static char retbuf[sizeof "90000000.00"]; /* XXX nonreentrant */
633 unsigned long val;
634 int mantissa, exponent;
636 mantissa = (int)((prec >> 4) & 0x0f) % 10;
637 exponent = (int)((prec >> 0) & 0x0f) % 10;
639 val = mantissa * poweroften[exponent];
641 (void) sprintf(retbuf, "%ld.%.2ld", val/100, val%100);
642 return (retbuf);
645 /* converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */
646 static u_int8_t
647 precsize_aton(strptr)
648 const char **strptr;
650 unsigned int mval = 0, cmval = 0;
651 u_int8_t retval = 0;
652 const char *cp;
653 int exponent;
654 int mantissa;
656 cp = *strptr;
658 while (isdigit(*cp))
659 mval = mval * 10 + (*cp++ - '0');
661 if (*cp == '.') { /* centimeters */
662 cp++;
663 if (isdigit(*cp)) {
664 cmval = (*cp++ - '0') * 10;
665 if (isdigit(*cp)) {
666 cmval += (*cp++ - '0');
670 cmval = (mval * 100) + cmval;
672 for (exponent = 0; exponent < 9; exponent++)
673 if (cmval < poweroften[exponent+1])
674 break;
676 mantissa = cmval / poweroften[exponent];
677 if (mantissa > 9)
678 mantissa = 9;
680 retval = (mantissa << 4) | exponent;
682 *strptr = cp;
684 return (retval);
687 /* converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */
688 static u_int32_t
689 latlon2ul(latlonstrptr,which)
690 const char **latlonstrptr;
691 int *which;
693 const char *cp;
694 u_int32_t retval;
695 int deg = 0, min = 0, secs = 0, secsfrac = 0;
697 cp = *latlonstrptr;
699 while (isdigit(*cp))
700 deg = deg * 10 + (*cp++ - '0');
702 while (isspace(*cp))
703 cp++;
705 if (!(isdigit(*cp)))
706 goto fndhemi;
708 while (isdigit(*cp))
709 min = min * 10 + (*cp++ - '0');
711 while (isspace(*cp))
712 cp++;
714 if (!(isdigit(*cp)))
715 goto fndhemi;
717 while (isdigit(*cp))
718 secs = secs * 10 + (*cp++ - '0');
720 if (*cp == '.') { /* decimal seconds */
721 cp++;
722 if (isdigit(*cp)) {
723 secsfrac = (*cp++ - '0') * 100;
724 if (isdigit(*cp)) {
725 secsfrac += (*cp++ - '0') * 10;
726 if (isdigit(*cp)) {
727 secsfrac += (*cp++ - '0');
733 while (!isspace(*cp)) /* if any trailing garbage */
734 cp++;
736 while (isspace(*cp))
737 cp++;
739 fndhemi:
740 switch (*cp) {
741 case 'N': case 'n':
742 case 'E': case 'e':
743 retval = ((unsigned)1<<31)
744 + (((((deg * 60) + min) * 60) + secs) * 1000)
745 + secsfrac;
746 break;
747 case 'S': case 's':
748 case 'W': case 'w':
749 retval = ((unsigned)1<<31)
750 - (((((deg * 60) + min) * 60) + secs) * 1000)
751 - secsfrac;
752 break;
753 default:
754 retval = 0; /* invalid value -- indicates error */
755 break;
758 switch (*cp) {
759 case 'N': case 'n':
760 case 'S': case 's':
761 *which = 1; /* latitude */
762 break;
763 case 'E': case 'e':
764 case 'W': case 'w':
765 *which = 2; /* longitude */
766 break;
767 default:
768 *which = 0; /* error */
769 break;
772 cp++; /* skip the hemisphere */
774 while (!isspace(*cp)) /* if any trailing garbage */
775 cp++;
777 while (isspace(*cp)) /* move to next field */
778 cp++;
780 *latlonstrptr = cp;
782 return (retval);
785 /* converts a zone file representation in a string to an RDATA on-the-wire
786 * representation. */
788 loc_aton(ascii, binary)
789 const char *ascii;
790 u_char *binary;
792 const char *cp, *maxcp;
793 u_char *bcp;
795 u_int32_t latit = 0, longit = 0, alt = 0;
796 u_int32_t lltemp1 = 0, lltemp2 = 0;
797 int altmeters = 0, altfrac = 0, altsign = 1;
798 u_int8_t hp = 0x16; /* default = 1e6 cm = 10000.00m = 10km */
799 u_int8_t vp = 0x13; /* default = 1e3 cm = 10.00m */
800 u_int8_t siz = 0x12; /* default = 1e2 cm = 1.00m */
801 int which1 = 0, which2 = 0;
803 cp = ascii;
804 maxcp = cp + strlen(ascii);
806 lltemp1 = latlon2ul(&cp, &which1);
808 lltemp2 = latlon2ul(&cp, &which2);
810 switch (which1 + which2) {
811 case 3: /* 1 + 2, the only valid combination */
812 if ((which1 == 1) && (which2 == 2)) { /* normal case */
813 latit = lltemp1;
814 longit = lltemp2;
815 } else if ((which1 == 2) && (which2 == 1)) { /* reversed */
816 longit = lltemp1;
817 latit = lltemp2;
818 } else { /* some kind of brokenness */
819 return (0);
821 break;
822 default: /* we didn't get one of each */
823 return (0);
826 /* altitude */
827 if (*cp == '-') {
828 altsign = -1;
829 cp++;
832 if (*cp == '+')
833 cp++;
835 while (isdigit(*cp))
836 altmeters = altmeters * 10 + (*cp++ - '0');
838 if (*cp == '.') { /* decimal meters */
839 cp++;
840 if (isdigit(*cp)) {
841 altfrac = (*cp++ - '0') * 10;
842 if (isdigit(*cp)) {
843 altfrac += (*cp++ - '0');
848 alt = (10000000 + (altsign * (altmeters * 100 + altfrac)));
850 while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
851 cp++;
853 while (isspace(*cp) && (cp < maxcp))
854 cp++;
856 if (cp >= maxcp)
857 goto defaults;
859 siz = precsize_aton(&cp);
861 while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
862 cp++;
864 while (isspace(*cp) && (cp < maxcp))
865 cp++;
867 if (cp >= maxcp)
868 goto defaults;
870 hp = precsize_aton(&cp);
872 while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
873 cp++;
875 while (isspace(*cp) && (cp < maxcp))
876 cp++;
878 if (cp >= maxcp)
879 goto defaults;
881 vp = precsize_aton(&cp);
883 defaults:
885 bcp = binary;
886 *bcp++ = (u_int8_t) 0; /* version byte */
887 *bcp++ = siz;
888 *bcp++ = hp;
889 *bcp++ = vp;
890 PUTLONG(latit,bcp);
891 PUTLONG(longit,bcp);
892 PUTLONG(alt,bcp);
894 return (16); /* size of RR in octets */
897 /* takes an on-the-wire LOC RR and formats it in a human readable format. */
898 const char *
899 loc_ntoa(binary, ascii)
900 const u_char *binary;
901 char *ascii;
903 static char *error = "?";
904 static char tmpbuf[sizeof
905 "1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"];
906 const u_char *cp = binary;
908 int latdeg, latmin, latsec, latsecfrac;
909 int longdeg, longmin, longsec, longsecfrac;
910 char northsouth, eastwest;
911 int altmeters, altfrac, altsign;
913 const u_int32_t referencealt = 100000 * 100;
915 int32_t latval, longval, altval;
916 u_int32_t templ;
917 u_int8_t sizeval, hpval, vpval, versionval;
919 char *sizestr, *hpstr, *vpstr;
921 versionval = *cp++;
923 if (ascii == NULL)
924 ascii = tmpbuf;
926 if (versionval) {
927 (void) sprintf(ascii, "; error: unknown LOC RR version");
928 return (ascii);
931 sizeval = *cp++;
933 hpval = *cp++;
934 vpval = *cp++;
936 GETLONG(templ, cp);
937 latval = (templ - ((unsigned)1<<31));
939 GETLONG(templ, cp);
940 longval = (templ - ((unsigned)1<<31));
942 GETLONG(templ, cp);
943 if (templ < referencealt) { /* below WGS 84 spheroid */
944 altval = referencealt - templ;
945 altsign = -1;
946 } else {
947 altval = templ - referencealt;
948 altsign = 1;
951 if (latval < 0) {
952 northsouth = 'S';
953 latval = -latval;
954 } else
955 northsouth = 'N';
957 latsecfrac = latval % 1000;
958 latval = latval / 1000;
959 latsec = latval % 60;
960 latval = latval / 60;
961 latmin = latval % 60;
962 latval = latval / 60;
963 latdeg = latval;
965 if (longval < 0) {
966 eastwest = 'W';
967 longval = -longval;
968 } else
969 eastwest = 'E';
971 longsecfrac = longval % 1000;
972 longval = longval / 1000;
973 longsec = longval % 60;
974 longval = longval / 60;
975 longmin = longval % 60;
976 longval = longval / 60;
977 longdeg = longval;
979 altfrac = altval % 100;
980 altmeters = (altval / 100) * altsign;
982 if ((sizestr = strdup(precsize_ntoa(sizeval))) == NULL)
983 sizestr = error;
984 if ((hpstr = strdup(precsize_ntoa(hpval))) == NULL)
985 hpstr = error;
986 if ((vpstr = strdup(precsize_ntoa(vpval))) == NULL)
987 vpstr = error;
989 sprintf(ascii,
990 "%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %d.%.2dm %sm %sm %sm",
991 latdeg, latmin, latsec, latsecfrac, northsouth,
992 longdeg, longmin, longsec, longsecfrac, eastwest,
993 altmeters, altfrac, sizestr, hpstr, vpstr);
995 if (sizestr != error)
996 free(sizestr);
997 if (hpstr != error)
998 free(hpstr);
999 if (vpstr != error)
1000 free(vpstr);
1002 return (ascii);
1004 libresolv_hidden_def (loc_ntoa)
1007 /* Return the number of DNS hierarchy levels in the name. */
1009 dn_count_labels(const char *name) {
1010 int i, len, count;
1012 len = strlen(name);
1013 for (i = 0, count = 0; i < len; i++) {
1014 /* XXX need to check for \. or use named's nlabels(). */
1015 if (name[i] == '.')
1016 count++;
1019 /* don't count initial wildcard */
1020 if (name[0] == '*')
1021 if (count)
1022 count--;
1024 /* don't count the null label for root. */
1025 /* if terminating '.' not found, must adjust */
1026 /* count to include last label */
1027 if (len > 0 && name[len-1] != '.')
1028 count++;
1029 return (count);
1034 * Make dates expressed in seconds-since-Jan-1-1970 easy to read.
1035 * SIG records are required to be printed like this, by the Secure DNS RFC.
1037 char *
1038 p_secstodate (u_long secs) {
1039 /* XXX nonreentrant */
1040 static char output[15]; /* YYYYMMDDHHMMSS and null */
1041 time_t clock = secs;
1042 struct tm *time;
1044 #ifdef HAVE_TIME_R
1045 struct tm timebuf;
1047 time = gmtime_r(&clock, &timebuf);
1048 #else
1049 time = gmtime(&clock);
1050 #endif
1051 time->tm_year += 1900;
1052 time->tm_mon += 1;
1053 sprintf(output, "%04d%02d%02d%02d%02d%02d",
1054 time->tm_year, time->tm_mon, time->tm_mday,
1055 time->tm_hour, time->tm_min, time->tm_sec);
1056 return (output);