/*
|
/*
|
* Copyright (c) 1985
|
* Copyright (c) 1985
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 4. Neither the name of the University nor the names of its contributors
|
* 4. Neither the name of the University nor the names of its contributors
|
* may be used to endorse or promote products derived from this software
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
|
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
|
*
|
*
|
* Permission to use, copy, modify, and distribute this software for any
|
* Permission to use, copy, modify, and distribute this software for any
|
* purpose with or without fee is hereby granted, provided that the above
|
* purpose with or without fee is hereby granted, provided that the above
|
* copyright notice and this permission notice appear in all copies, and that
|
* copyright notice and this permission notice appear in all copies, and that
|
* the name of Digital Equipment Corporation not be used in advertising or
|
* the name of Digital Equipment Corporation not be used in advertising or
|
* publicity pertaining to distribution of the document or software without
|
* publicity pertaining to distribution of the document or software without
|
* specific, written prior permission.
|
* specific, written prior permission.
|
*
|
*
|
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
|
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
|
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
|
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
|
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* SOFTWARE.
|
* SOFTWARE.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Portions Copyright (c) 1995 by International Business Machines, Inc.
|
* Portions Copyright (c) 1995 by International Business Machines, Inc.
|
*
|
*
|
* International Business Machines, Inc. (hereinafter called IBM) grants
|
* International Business Machines, Inc. (hereinafter called IBM) grants
|
* permission under its copyrights to use, copy, modify, and distribute this
|
* permission under its copyrights to use, copy, modify, and distribute this
|
* Software with or without fee, provided that the above copyright notice and
|
* Software with or without fee, provided that the above copyright notice and
|
* all paragraphs of this notice appear in all copies, and that the name of IBM
|
* all paragraphs of this notice appear in all copies, and that the name of IBM
|
* not be used in connection with the marketing of any product incorporating
|
* not be used in connection with the marketing of any product incorporating
|
* the Software or modifications thereof, without specific, written prior
|
* the Software or modifications thereof, without specific, written prior
|
* permission.
|
* permission.
|
*
|
*
|
* To the extent it has a right to do so, IBM grants an immunity from suit
|
* To the extent it has a right to do so, IBM grants an immunity from suit
|
* under its patents, if any, for the use, sale or manufacture of products to
|
* under its patents, if any, for the use, sale or manufacture of products to
|
* the extent that such products are used for performing Domain Name System
|
* the extent that such products are used for performing Domain Name System
|
* dynamic updates in TCP/IP networks by means of the Software. No immunity is
|
* dynamic updates in TCP/IP networks by means of the Software. No immunity is
|
* granted for any product per se or for any other function of any product.
|
* granted for any product per se or for any other function of any product.
|
*
|
*
|
* THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
|
* THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
* PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
|
* PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
|
* DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
|
* DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
|
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
|
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
|
* IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
|
* IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Portions Copyright (c) 1996-1999 by Internet Software Consortium.
|
* Portions Copyright (c) 1996-1999 by Internet Software Consortium.
|
*
|
*
|
* Permission to use, copy, modify, and distribute this software for any
|
* Permission to use, copy, modify, and distribute this software for any
|
* purpose with or without fee is hereby granted, provided that the above
|
* purpose with or without fee is hereby granted, provided that the above
|
* copyright notice and this permission notice appear in all copies.
|
* copyright notice and this permission notice appear in all copies.
|
*
|
*
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
* SOFTWARE.
|
* SOFTWARE.
|
*/
|
*/
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
#if defined(LIBC_SCCS) && !defined(lint)
|
static const char sccsid[] = "@(#)res_debug.c 8.1 (Berkeley) 6/4/93";
|
static const char sccsid[] = "@(#)res_debug.c 8.1 (Berkeley) 6/4/93";
|
static const char rcsid[] = "$BINDId: res_debug.c,v 8.34 2000/02/29 05:30:55 vixie Exp $";
|
static const char rcsid[] = "$BINDId: res_debug.c,v 8.34 2000/02/29 05:30:55 vixie Exp $";
|
#endif /* LIBC_SCCS and not lint */
|
#endif /* LIBC_SCCS and not lint */
|
|
|
#include <sys/types.h>
|
#include <sys/types.h>
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#include <sys/socket.h>
|
#include <sys/socket.h>
|
|
|
#include <netinet/in.h>
|
#include <netinet/in.h>
|
#include <arpa/inet.h>
|
#include <arpa/inet.h>
|
#include <arpa/nameser.h>
|
#include <arpa/nameser.h>
|
|
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <errno.h>
|
#include <errno.h>
|
#include <math.h>
|
#include <math.h>
|
#include <netdb.h>
|
#include <netdb.h>
|
#include <resolv.h>
|
#include <resolv.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <stdlib.h>
|
#include <stdlib.h>
|
#include <string.h>
|
#include <string.h>
|
#include <time.h>
|
#include <time.h>
|
#include "local.h"
|
#include "local.h"
|
|
|
#ifdef SPRINTF_CHAR
|
#ifdef SPRINTF_CHAR
|
# define SPRINTF(x) strlen(sprintf/**/x)
|
# define SPRINTF(x) strlen(sprintf/**/x)
|
#else
|
#else
|
# define SPRINTF(x) sprintf x
|
# define SPRINTF(x) sprintf x
|
#endif
|
#endif
|
|
|
extern const char *_res_sectioncodes[] attribute_hidden;
|
extern const char *_res_sectioncodes[] attribute_hidden;
|
|
|
/*
|
/*
|
* Print the current options.
|
* Print the current options.
|
*/
|
*/
|
void
|
void
|
fp_resstat(const res_state statp, FILE *file) {
|
fp_resstat(const res_state statp, FILE *file) {
|
u_long mask;
|
u_long mask;
|
|
|
fprintf(file, ";; res options:");
|
fprintf(file, ";; res options:");
|
for (mask = 1; mask != 0; mask <<= 1)
|
for (mask = 1; mask != 0; mask <<= 1)
|
if (statp->options & mask)
|
if (statp->options & mask)
|
fprintf(file, " %s", p_option(mask));
|
fprintf(file, " %s", p_option(mask));
|
putc('\n', file);
|
putc('\n', file);
|
}
|
}
|
|
|
static void
|
static void
|
do_section(const res_state statp,
|
do_section(const res_state statp,
|
ns_msg *handle, ns_sect section,
|
ns_msg *handle, ns_sect section,
|
int pflag, FILE *file)
|
int pflag, FILE *file)
|
{
|
{
|
int n, sflag, rrnum;
|
int n, sflag, rrnum;
|
static int buflen = 2048;
|
static int buflen = 2048;
|
char *buf;
|
char *buf;
|
ns_opcode opcode;
|
ns_opcode opcode;
|
ns_rr rr;
|
ns_rr rr;
|
|
|
/*
|
/*
|
* Print answer records.
|
* Print answer records.
|
*/
|
*/
|
sflag = (statp->pfcode & pflag);
|
sflag = (statp->pfcode & pflag);
|
if (statp->pfcode && !sflag)
|
if (statp->pfcode && !sflag)
|
return;
|
return;
|
|
|
buf = malloc(buflen);
|
buf = malloc(buflen);
|
if (buf == NULL) {
|
if (buf == NULL) {
|
fprintf(file, ";; memory allocation failure\n");
|
fprintf(file, ";; memory allocation failure\n");
|
return;
|
return;
|
}
|
}
|
|
|
opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode);
|
opcode = (ns_opcode) ns_msg_getflag(*handle, ns_f_opcode);
|
rrnum = 0;
|
rrnum = 0;
|
for (;;) {
|
for (;;) {
|
if (ns_parserr(handle, section, rrnum, &rr)) {
|
if (ns_parserr(handle, section, rrnum, &rr)) {
|
if (errno != ENODEV)
|
if (errno != ENODEV)
|
fprintf(file, ";; ns_parserr: %s\n",
|
fprintf(file, ";; ns_parserr: %s\n",
|
strerror(errno));
|
strerror(errno));
|
else if (rrnum > 0 && sflag != 0 &&
|
else if (rrnum > 0 && sflag != 0 &&
|
(statp->pfcode & RES_PRF_HEAD1))
|
(statp->pfcode & RES_PRF_HEAD1))
|
putc('\n', file);
|
putc('\n', file);
|
goto cleanup;
|
goto cleanup;
|
}
|
}
|
if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
|
if (rrnum == 0 && sflag != 0 && (statp->pfcode & RES_PRF_HEAD1))
|
fprintf(file, ";; %s SECTION:\n",
|
fprintf(file, ";; %s SECTION:\n",
|
p_section(section, opcode));
|
p_section(section, opcode));
|
if (section == ns_s_qd)
|
if (section == ns_s_qd)
|
fprintf(file, ";;\t%s, type = %s, class = %s\n",
|
fprintf(file, ";;\t%s, type = %s, class = %s\n",
|
ns_rr_name(rr),
|
ns_rr_name(rr),
|
p_type(ns_rr_type(rr)),
|
p_type(ns_rr_type(rr)),
|
p_class(ns_rr_class(rr)));
|
p_class(ns_rr_class(rr)));
|
else {
|
else {
|
n = ns_sprintrr(handle, &rr, NULL, NULL,
|
n = ns_sprintrr(handle, &rr, NULL, NULL,
|
buf, buflen);
|
buf, buflen);
|
if (n < 0) {
|
if (n < 0) {
|
if (errno == ENOSPC) {
|
if (errno == ENOSPC) {
|
free(buf);
|
free(buf);
|
buf = NULL;
|
buf = NULL;
|
if (buflen < 131072)
|
if (buflen < 131072)
|
buf = malloc(buflen += 1024);
|
buf = malloc(buflen += 1024);
|
if (buf == NULL) {
|
if (buf == NULL) {
|
fprintf(file,
|
fprintf(file,
|
";; memory allocation failure\n");
|
";; memory allocation failure\n");
|
return;
|
return;
|
}
|
}
|
continue;
|
continue;
|
}
|
}
|
fprintf(file, ";; ns_sprintrr: %s\n",
|
fprintf(file, ";; ns_sprintrr: %s\n",
|
strerror(errno));
|
strerror(errno));
|
goto cleanup;
|
goto cleanup;
|
}
|
}
|
fputs(buf, file);
|
fputs(buf, file);
|
fputc('\n', file);
|
fputc('\n', file);
|
}
|
}
|
rrnum++;
|
rrnum++;
|
}
|
}
|
cleanup:
|
cleanup:
|
if (buf != NULL)
|
if (buf != NULL)
|
free(buf);
|
free(buf);
|
}
|
}
|
|
|
/*
|
/*
|
* Print the contents of a query.
|
* Print the contents of a query.
|
* This is intended to be primarily a debugging routine.
|
* This is intended to be primarily a debugging routine.
|
*/
|
*/
|
void
|
void
|
res_pquery(const res_state statp, const u_char *msg, int len, FILE *file) {
|
res_pquery(const res_state statp, const u_char *msg, int len, FILE *file) {
|
ns_msg handle;
|
ns_msg handle;
|
int qdcount, ancount, nscount, arcount;
|
int qdcount, ancount, nscount, arcount;
|
u_int opcode, rcode, id;
|
u_int opcode, rcode, id;
|
|
|
if (ns_initparse(msg, len, &handle) < 0) {
|
if (ns_initparse(msg, len, &handle) < 0) {
|
fprintf(file, ";; ns_initparse: %s\n", strerror(errno));
|
fprintf(file, ";; ns_initparse: %s\n", strerror(errno));
|
return;
|
return;
|
}
|
}
|
opcode = ns_msg_getflag(handle, ns_f_opcode);
|
opcode = ns_msg_getflag(handle, ns_f_opcode);
|
rcode = ns_msg_getflag(handle, ns_f_rcode);
|
rcode = ns_msg_getflag(handle, ns_f_rcode);
|
id = ns_msg_id(handle);
|
id = ns_msg_id(handle);
|
qdcount = ns_msg_count(handle, ns_s_qd);
|
qdcount = ns_msg_count(handle, ns_s_qd);
|
ancount = ns_msg_count(handle, ns_s_an);
|
ancount = ns_msg_count(handle, ns_s_an);
|
nscount = ns_msg_count(handle, ns_s_ns);
|
nscount = ns_msg_count(handle, ns_s_ns);
|
arcount = ns_msg_count(handle, ns_s_ar);
|
arcount = ns_msg_count(handle, ns_s_ar);
|
|
|
/*
|
/*
|
* Print header fields.
|
* Print header fields.
|
*/
|
*/
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode)
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX) || rcode)
|
fprintf(file,
|
fprintf(file,
|
";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n",
|
";; ->>HEADER<<- opcode: %s, status: %s, id: %d\n",
|
_res_opcodes[opcode], p_rcode(rcode), id);
|
_res_opcodes[opcode], p_rcode(rcode), id);
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX))
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEADX))
|
putc(';', file);
|
putc(';', file);
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) {
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD2)) {
|
fprintf(file, "; flags:");
|
fprintf(file, "; flags:");
|
if (ns_msg_getflag(handle, ns_f_qr))
|
if (ns_msg_getflag(handle, ns_f_qr))
|
fprintf(file, " qr");
|
fprintf(file, " qr");
|
if (ns_msg_getflag(handle, ns_f_aa))
|
if (ns_msg_getflag(handle, ns_f_aa))
|
fprintf(file, " aa");
|
fprintf(file, " aa");
|
if (ns_msg_getflag(handle, ns_f_tc))
|
if (ns_msg_getflag(handle, ns_f_tc))
|
fprintf(file, " tc");
|
fprintf(file, " tc");
|
if (ns_msg_getflag(handle, ns_f_rd))
|
if (ns_msg_getflag(handle, ns_f_rd))
|
fprintf(file, " rd");
|
fprintf(file, " rd");
|
if (ns_msg_getflag(handle, ns_f_ra))
|
if (ns_msg_getflag(handle, ns_f_ra))
|
fprintf(file, " ra");
|
fprintf(file, " ra");
|
if (ns_msg_getflag(handle, ns_f_z))
|
if (ns_msg_getflag(handle, ns_f_z))
|
fprintf(file, " ??");
|
fprintf(file, " ??");
|
if (ns_msg_getflag(handle, ns_f_ad))
|
if (ns_msg_getflag(handle, ns_f_ad))
|
fprintf(file, " ad");
|
fprintf(file, " ad");
|
if (ns_msg_getflag(handle, ns_f_cd))
|
if (ns_msg_getflag(handle, ns_f_cd))
|
fprintf(file, " cd");
|
fprintf(file, " cd");
|
}
|
}
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) {
|
if ((!statp->pfcode) || (statp->pfcode & RES_PRF_HEAD1)) {
|
fprintf(file, "; %s: %d",
|
fprintf(file, "; %s: %d",
|
p_section(ns_s_qd, opcode), qdcount);
|
p_section(ns_s_qd, opcode), qdcount);
|
fprintf(file, ", %s: %d",
|
fprintf(file, ", %s: %d",
|
p_section(ns_s_an, opcode), ancount);
|
p_section(ns_s_an, opcode), ancount);
|
fprintf(file, ", %s: %d",
|
fprintf(file, ", %s: %d",
|
p_section(ns_s_ns, opcode), nscount);
|
p_section(ns_s_ns, opcode), nscount);
|
fprintf(file, ", %s: %d",
|
fprintf(file, ", %s: %d",
|
p_section(ns_s_ar, opcode), arcount);
|
p_section(ns_s_ar, opcode), arcount);
|
}
|
}
|
if ((!statp->pfcode) || (statp->pfcode &
|
if ((!statp->pfcode) || (statp->pfcode &
|
(RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) {
|
(RES_PRF_HEADX | RES_PRF_HEAD2 | RES_PRF_HEAD1))) {
|
putc('\n',file);
|
putc('\n',file);
|
}
|
}
|
/*
|
/*
|
* Print the various sections.
|
* Print the various sections.
|
*/
|
*/
|
do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file);
|
do_section(statp, &handle, ns_s_qd, RES_PRF_QUES, file);
|
do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file);
|
do_section(statp, &handle, ns_s_an, RES_PRF_ANS, file);
|
do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file);
|
do_section(statp, &handle, ns_s_ns, RES_PRF_AUTH, file);
|
do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file);
|
do_section(statp, &handle, ns_s_ar, RES_PRF_ADD, file);
|
if (qdcount == 0 && ancount == 0 &&
|
if (qdcount == 0 && ancount == 0 &&
|
nscount == 0 && arcount == 0)
|
nscount == 0 && arcount == 0)
|
putc('\n', file);
|
putc('\n', file);
|
}
|
}
|
|
|
const u_char *
|
const u_char *
|
p_cdnname(const u_char *cp, const u_char *msg, int len, FILE *file) {
|
p_cdnname(const u_char *cp, const u_char *msg, int len, FILE *file) {
|
char name[MAXDNAME];
|
char name[MAXDNAME];
|
int n;
|
int n;
|
|
|
if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0)
|
if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0)
|
return (NULL);
|
return (NULL);
|
if (name[0] == '\0')
|
if (name[0] == '\0')
|
putc('.', file);
|
putc('.', file);
|
else
|
else
|
fputs(name, file);
|
fputs(name, file);
|
return (cp + n);
|
return (cp + n);
|
}
|
}
|
libresolv_hidden_def (p_cdnname)
|
libresolv_hidden_def (p_cdnname)
|
|
|
const u_char *
|
const u_char *
|
p_cdname(const u_char *cp, const u_char *msg, FILE *file) {
|
p_cdname(const u_char *cp, const u_char *msg, FILE *file) {
|
return (p_cdnname(cp, msg, PACKETSZ, file));
|
return (p_cdnname(cp, msg, PACKETSZ, file));
|
}
|
}
|
|
|
/* Return a fully-qualified domain name from a compressed name (with
|
/* Return a fully-qualified domain name from a compressed name (with
|
length supplied). */
|
length supplied). */
|
|
|
const u_char *
|
const u_char *
|
p_fqnname(cp, msg, msglen, name, namelen)
|
p_fqnname(cp, msg, msglen, name, namelen)
|
const u_char *cp, *msg;
|
const u_char *cp, *msg;
|
int msglen;
|
int msglen;
|
char *name;
|
char *name;
|
int namelen;
|
int namelen;
|
{
|
{
|
int n, newlen;
|
int n, newlen;
|
|
|
if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0)
|
if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0)
|
return (NULL);
|
return (NULL);
|
newlen = strlen(name);
|
newlen = strlen(name);
|
if (newlen == 0 || name[newlen - 1] != '.') {
|
if (newlen == 0 || name[newlen - 1] != '.') {
|
if (newlen + 1 >= namelen) /* Lack space for final dot */
|
if (newlen + 1 >= namelen) /* Lack space for final dot */
|
return (NULL);
|
return (NULL);
|
else
|
else
|
strcpy(name + newlen, ".");
|
strcpy(name + newlen, ".");
|
}
|
}
|
return (cp + n);
|
return (cp + n);
|
}
|
}
|
libresolv_hidden_def (p_fqnname)
|
libresolv_hidden_def (p_fqnname)
|
|
|
/* XXX: the rest of these functions need to become length-limited, too. */
|
/* XXX: the rest of these functions need to become length-limited, too. */
|
|
|
const u_char *
|
const u_char *
|
p_fqname(const u_char *cp, const u_char *msg, FILE *file) {
|
p_fqname(const u_char *cp, const u_char *msg, FILE *file) {
|
char name[MAXDNAME];
|
char name[MAXDNAME];
|
const u_char *n;
|
const u_char *n;
|
|
|
n = p_fqnname(cp, msg, MAXCDNAME, name, sizeof name);
|
n = p_fqnname(cp, msg, MAXCDNAME, name, sizeof name);
|
if (n == NULL)
|
if (n == NULL)
|
return (NULL);
|
return (NULL);
|
fputs(name, file);
|
fputs(name, file);
|
return (n);
|
return (n);
|
}
|
}
|
|
|
/*
|
/*
|
* Names of RR classes and qclasses. Classes and qclasses are the same, except
|
* Names of RR classes and qclasses. Classes and qclasses are the same, except
|
* that C_ANY is a qclass but not a class. (You can ask for records of class
|
* that C_ANY is a qclass but not a class. (You can ask for records of class
|
* C_ANY, but you can't have any records of that class in the database.)
|
* C_ANY, but you can't have any records of that class in the database.)
|
*/
|
*/
|
extern const struct res_sym __p_class_syms[];
|
extern const struct res_sym __p_class_syms[];
|
libresolv_hidden_proto (__p_class_syms)
|
libresolv_hidden_proto (__p_class_syms)
|
const struct res_sym __p_class_syms[] = {
|
const struct res_sym __p_class_syms[] = {
|
{C_IN, "IN"},
|
{C_IN, "IN"},
|
{C_CHAOS, "CHAOS"},
|
{C_CHAOS, "CHAOS"},
|
{C_HS, "HS"},
|
{C_HS, "HS"},
|
{C_HS, "HESIOD"},
|
{C_HS, "HESIOD"},
|
{C_ANY, "ANY"},
|
{C_ANY, "ANY"},
|
{C_NONE, "NONE"},
|
{C_NONE, "NONE"},
|
{C_IN, (char *)0}
|
{C_IN, (char *)0}
|
};
|
};
|
libresolv_hidden_data_def (__p_class_syms)
|
libresolv_hidden_data_def (__p_class_syms)
|
|
|
/*
|
/*
|
* Names of message sections.
|
* Names of message sections.
|
*/
|
*/
|
const struct res_sym __p_default_section_syms[] attribute_hidden = {
|
const struct res_sym __p_default_section_syms[] attribute_hidden = {
|
{ns_s_qd, "QUERY"},
|
{ns_s_qd, "QUERY"},
|
{ns_s_an, "ANSWER"},
|
{ns_s_an, "ANSWER"},
|
{ns_s_ns, "AUTHORITY"},
|
{ns_s_ns, "AUTHORITY"},
|
{ns_s_ar, "ADDITIONAL"},
|
{ns_s_ar, "ADDITIONAL"},
|
{0, (char *)0}
|
{0, (char *)0}
|
};
|
};
|
|
|
const struct res_sym __p_update_section_syms[] attribute_hidden = {
|
const struct res_sym __p_update_section_syms[] attribute_hidden = {
|
{S_ZONE, "ZONE"},
|
{S_ZONE, "ZONE"},
|
{S_PREREQ, "PREREQUISITE"},
|
{S_PREREQ, "PREREQUISITE"},
|
{S_UPDATE, "UPDATE"},
|
{S_UPDATE, "UPDATE"},
|
{S_ADDT, "ADDITIONAL"},
|
{S_ADDT, "ADDITIONAL"},
|
{0, (char *)0}
|
{0, (char *)0}
|
};
|
};
|
|
|
const struct res_sym __p_key_syms[] attribute_hidden = {
|
const struct res_sym __p_key_syms[] attribute_hidden = {
|
{NS_ALG_MD5RSA, "RSA", "RSA KEY with MD5 hash"},
|
{NS_ALG_MD5RSA, "RSA", "RSA KEY with MD5 hash"},
|
{NS_ALG_DH, "DH", "Diffie Hellman"},
|
{NS_ALG_DH, "DH", "Diffie Hellman"},
|
{NS_ALG_DSA, "DSA", "Digital Signature Algorithm"},
|
{NS_ALG_DSA, "DSA", "Digital Signature Algorithm"},
|
{NS_ALG_EXPIRE_ONLY, "EXPIREONLY", "No algorithm"},
|
{NS_ALG_EXPIRE_ONLY, "EXPIREONLY", "No algorithm"},
|
{NS_ALG_PRIVATE_OID, "PRIVATE", "Algorithm obtained from OID"},
|
{NS_ALG_PRIVATE_OID, "PRIVATE", "Algorithm obtained from OID"},
|
{0, NULL, NULL}
|
{0, NULL, NULL}
|
};
|
};
|
|
|
const struct res_sym __p_cert_syms[] attribute_hidden = {
|
const struct res_sym __p_cert_syms[] attribute_hidden = {
|
{cert_t_pkix, "PKIX", "PKIX (X.509v3) Certificate"},
|
{cert_t_pkix, "PKIX", "PKIX (X.509v3) Certificate"},
|
{cert_t_spki, "SPKI", "SPKI certificate"},
|
{cert_t_spki, "SPKI", "SPKI certificate"},
|
{cert_t_pgp, "PGP", "PGP certificate"},
|
{cert_t_pgp, "PGP", "PGP certificate"},
|
{cert_t_url, "URL", "URL Private"},
|
{cert_t_url, "URL", "URL Private"},
|
{cert_t_oid, "OID", "OID Private"},
|
{cert_t_oid, "OID", "OID Private"},
|
{0, NULL, NULL}
|
{0, NULL, NULL}
|
};
|
};
|
|
|
/*
|
/*
|
* Names of RR types and qtypes. Types and qtypes are the same, except
|
* Names of RR types and qtypes. Types and qtypes are the same, except
|
* that T_ANY is a qtype but not a type. (You can ask for records of type
|
* that T_ANY is a qtype but not a type. (You can ask for records of type
|
* T_ANY, but you can't have any records of that type in the database.)
|
* T_ANY, but you can't have any records of that type in the database.)
|
*/
|
*/
|
extern const struct res_sym __p_type_syms[];
|
extern const struct res_sym __p_type_syms[];
|
libresolv_hidden_proto (__p_type_syms)
|
libresolv_hidden_proto (__p_type_syms)
|
const struct res_sym __p_type_syms[] = {
|
const struct res_sym __p_type_syms[] = {
|
{ns_t_a, "A", "address"},
|
{ns_t_a, "A", "address"},
|
{ns_t_ns, "NS", "name server"},
|
{ns_t_ns, "NS", "name server"},
|
{ns_t_md, "MD", "mail destination (deprecated)"},
|
{ns_t_md, "MD", "mail destination (deprecated)"},
|
{ns_t_mf, "MF", "mail forwarder (deprecated)"},
|
{ns_t_mf, "MF", "mail forwarder (deprecated)"},
|
{ns_t_cname, "CNAME", "canonical name"},
|
{ns_t_cname, "CNAME", "canonical name"},
|
{ns_t_soa, "SOA", "start of authority"},
|
{ns_t_soa, "SOA", "start of authority"},
|
{ns_t_mb, "MB", "mailbox"},
|
{ns_t_mb, "MB", "mailbox"},
|
{ns_t_mg, "MG", "mail group member"},
|
{ns_t_mg, "MG", "mail group member"},
|
{ns_t_mr, "MR", "mail rename"},
|
{ns_t_mr, "MR", "mail rename"},
|
{ns_t_null, "NULL", "null"},
|
{ns_t_null, "NULL", "null"},
|
{ns_t_wks, "WKS", "well-known service (deprecated)"},
|
{ns_t_wks, "WKS", "well-known service (deprecated)"},
|
{ns_t_ptr, "PTR", "domain name pointer"},
|
{ns_t_ptr, "PTR", "domain name pointer"},
|
{ns_t_hinfo, "HINFO", "host information"},
|
{ns_t_hinfo, "HINFO", "host information"},
|
{ns_t_minfo, "MINFO", "mailbox information"},
|
{ns_t_minfo, "MINFO", "mailbox information"},
|
{ns_t_mx, "MX", "mail exchanger"},
|
{ns_t_mx, "MX", "mail exchanger"},
|
{ns_t_txt, "TXT", "text"},
|
{ns_t_txt, "TXT", "text"},
|
{ns_t_rp, "RP", "responsible person"},
|
{ns_t_rp, "RP", "responsible person"},
|
{ns_t_afsdb, "AFSDB", "DCE or AFS server"},
|
{ns_t_afsdb, "AFSDB", "DCE or AFS server"},
|
{ns_t_x25, "X25", "X25 address"},
|
{ns_t_x25, "X25", "X25 address"},
|
{ns_t_isdn, "ISDN", "ISDN address"},
|
{ns_t_isdn, "ISDN", "ISDN address"},
|
{ns_t_rt, "RT", "router"},
|
{ns_t_rt, "RT", "router"},
|
{ns_t_nsap, "NSAP", "nsap address"},
|
{ns_t_nsap, "NSAP", "nsap address"},
|
{ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"},
|
{ns_t_nsap_ptr, "NSAP_PTR", "domain name pointer"},
|
{ns_t_sig, "SIG", "signature"},
|
{ns_t_sig, "SIG", "signature"},
|
{ns_t_key, "KEY", "key"},
|
{ns_t_key, "KEY", "key"},
|
{ns_t_px, "PX", "mapping information"},
|
{ns_t_px, "PX", "mapping information"},
|
{ns_t_gpos, "GPOS", "geographical position (withdrawn)"},
|
{ns_t_gpos, "GPOS", "geographical position (withdrawn)"},
|
{ns_t_aaaa, "AAAA", "IPv6 address"},
|
{ns_t_aaaa, "AAAA", "IPv6 address"},
|
{ns_t_loc, "LOC", "location"},
|
{ns_t_loc, "LOC", "location"},
|
{ns_t_nxt, "NXT", "next valid name (unimplemented)"},
|
{ns_t_nxt, "NXT", "next valid name (unimplemented)"},
|
{ns_t_eid, "EID", "endpoint identifier (unimplemented)"},
|
{ns_t_eid, "EID", "endpoint identifier (unimplemented)"},
|
{ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"},
|
{ns_t_nimloc, "NIMLOC", "NIMROD locator (unimplemented)"},
|
{ns_t_srv, "SRV", "server selection"},
|
{ns_t_srv, "SRV", "server selection"},
|
{ns_t_atma, "ATMA", "ATM address (unimplemented)"},
|
{ns_t_atma, "ATMA", "ATM address (unimplemented)"},
|
{ns_t_tsig, "TSIG", "transaction signature"},
|
{ns_t_tsig, "TSIG", "transaction signature"},
|
{ns_t_ixfr, "IXFR", "incremental zone transfer"},
|
{ns_t_ixfr, "IXFR", "incremental zone transfer"},
|
{ns_t_axfr, "AXFR", "zone transfer"},
|
{ns_t_axfr, "AXFR", "zone transfer"},
|
{ns_t_zxfr, "ZXFR", "compressed zone transfer"},
|
{ns_t_zxfr, "ZXFR", "compressed zone transfer"},
|
{ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
|
{ns_t_mailb, "MAILB", "mailbox-related data (deprecated)"},
|
{ns_t_maila, "MAILA", "mail agent (deprecated)"},
|
{ns_t_maila, "MAILA", "mail agent (deprecated)"},
|
{ns_t_naptr, "NAPTR", "URN Naming Authority"},
|
{ns_t_naptr, "NAPTR", "URN Naming Authority"},
|
{ns_t_kx, "KX", "Key Exchange"},
|
{ns_t_kx, "KX", "Key Exchange"},
|
{ns_t_cert, "CERT", "Certificate"},
|
{ns_t_cert, "CERT", "Certificate"},
|
{ns_t_any, "ANY", "\"any\""},
|
{ns_t_any, "ANY", "\"any\""},
|
{0, NULL, NULL}
|
{0, NULL, NULL}
|
};
|
};
|
libresolv_hidden_data_def (__p_type_syms)
|
libresolv_hidden_data_def (__p_type_syms)
|
|
|
/*
|
/*
|
* Names of DNS rcodes.
|
* Names of DNS rcodes.
|
*/
|
*/
|
const struct res_sym __p_rcode_syms[] attribute_hidden = {
|
const struct res_sym __p_rcode_syms[] attribute_hidden = {
|
{ns_r_noerror, "NOERROR", "no error"},
|
{ns_r_noerror, "NOERROR", "no error"},
|
{ns_r_formerr, "FORMERR", "format error"},
|
{ns_r_formerr, "FORMERR", "format error"},
|
{ns_r_servfail, "SERVFAIL", "server failed"},
|
{ns_r_servfail, "SERVFAIL", "server failed"},
|
{ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
|
{ns_r_nxdomain, "NXDOMAIN", "no such domain name"},
|
{ns_r_notimpl, "NOTIMP", "not implemented"},
|
{ns_r_notimpl, "NOTIMP", "not implemented"},
|
{ns_r_refused, "REFUSED", "refused"},
|
{ns_r_refused, "REFUSED", "refused"},
|
{ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
|
{ns_r_yxdomain, "YXDOMAIN", "domain name exists"},
|
{ns_r_yxrrset, "YXRRSET", "rrset exists"},
|
{ns_r_yxrrset, "YXRRSET", "rrset exists"},
|
{ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
|
{ns_r_nxrrset, "NXRRSET", "rrset doesn't exist"},
|
{ns_r_notauth, "NOTAUTH", "not authoritative"},
|
{ns_r_notauth, "NOTAUTH", "not authoritative"},
|
{ns_r_notzone, "NOTZONE", "Not in zone"},
|
{ns_r_notzone, "NOTZONE", "Not in zone"},
|
{ns_r_max, "", ""},
|
{ns_r_max, "", ""},
|
{ns_r_badsig, "BADSIG", "bad signature"},
|
{ns_r_badsig, "BADSIG", "bad signature"},
|
{ns_r_badkey, "BADKEY", "bad key"},
|
{ns_r_badkey, "BADKEY", "bad key"},
|
{ns_r_badtime, "BADTIME", "bad time"},
|
{ns_r_badtime, "BADTIME", "bad time"},
|
{0, NULL, NULL}
|
{0, NULL, NULL}
|
};
|
};
|
|
|
int
|
int
|
sym_ston(const struct res_sym *syms, const char *name, int *success) {
|
sym_ston(const struct res_sym *syms, const char *name, int *success) {
|
for ((void)NULL; syms->name != 0; syms++) {
|
for ((void)NULL; syms->name != 0; syms++) {
|
if (strcasecmp (name, syms->name) == 0) {
|
if (strcasecmp (name, syms->name) == 0) {
|
if (success)
|
if (success)
|
*success = 1;
|
*success = 1;
|
return (syms->number);
|
return (syms->number);
|
}
|
}
|
}
|
}
|
if (success)
|
if (success)
|
*success = 0;
|
*success = 0;
|
return (syms->number); /* The default value. */
|
return (syms->number); /* The default value. */
|
}
|
}
|
|
|
const char *
|
const char *
|
sym_ntos(const struct res_sym *syms, int number, int *success) {
|
sym_ntos(const struct res_sym *syms, int number, int *success) {
|
static char unname[20];
|
static char unname[20];
|
|
|
for ((void)NULL; syms->name != 0; syms++) {
|
for ((void)NULL; syms->name != 0; syms++) {
|
if (number == syms->number) {
|
if (number == syms->number) {
|
if (success)
|
if (success)
|
*success = 1;
|
*success = 1;
|
return (syms->name);
|
return (syms->name);
|
}
|
}
|
}
|
}
|
|
|
sprintf(unname, "%d", number); /* XXX nonreentrant */
|
sprintf(unname, "%d", number); /* XXX nonreentrant */
|
if (success)
|
if (success)
|
*success = 0;
|
*success = 0;
|
return (unname);
|
return (unname);
|
}
|
}
|
libresolv_hidden_def (sym_ntos)
|
libresolv_hidden_def (sym_ntos)
|
|
|
const char *
|
const char *
|
sym_ntop(const struct res_sym *syms, int number, int *success) {
|
sym_ntop(const struct res_sym *syms, int number, int *success) {
|
static char unname[20];
|
static char unname[20];
|
|
|
for ((void)NULL; syms->name != 0; syms++) {
|
for ((void)NULL; syms->name != 0; syms++) {
|
if (number == syms->number) {
|
if (number == syms->number) {
|
if (success)
|
if (success)
|
*success = 1;
|
*success = 1;
|
return (syms->humanname);
|
return (syms->humanname);
|
}
|
}
|
}
|
}
|
sprintf(unname, "%d", number); /* XXX nonreentrant */
|
sprintf(unname, "%d", number); /* XXX nonreentrant */
|
if (success)
|
if (success)
|
*success = 0;
|
*success = 0;
|
return (unname);
|
return (unname);
|
}
|
}
|
|
|
/*
|
/*
|
* Return a string for the type.
|
* Return a string for the type.
|
*/
|
*/
|
const char *
|
const char *
|
p_type(int type) {
|
p_type(int type) {
|
return (sym_ntos(__p_type_syms, type, (int *)0));
|
return (sym_ntos(__p_type_syms, type, (int *)0));
|
}
|
}
|
libresolv_hidden_def (p_type)
|
libresolv_hidden_def (p_type)
|
|
|
/*
|
/*
|
* Return a string for the type.
|
* Return a string for the type.
|
*/
|
*/
|
const char *
|
const char *
|
p_section(int section, int opcode) {
|
p_section(int section, int opcode) {
|
const struct res_sym *symbols;
|
const struct res_sym *symbols;
|
|
|
switch (opcode) {
|
switch (opcode) {
|
case ns_o_update:
|
case ns_o_update:
|
symbols = __p_update_section_syms;
|
symbols = __p_update_section_syms;
|
break;
|
break;
|
default:
|
default:
|
symbols = __p_default_section_syms;
|
symbols = __p_default_section_syms;
|
break;
|
break;
|
}
|
}
|
return (sym_ntos(symbols, section, (int *)0));
|
return (sym_ntos(symbols, section, (int *)0));
|
}
|
}
|
|
|
/*
|
/*
|
* Return a mnemonic for class.
|
* Return a mnemonic for class.
|
*/
|
*/
|
const char *
|
const char *
|
p_class(int class) {
|
p_class(int class) {
|
return (sym_ntos(__p_class_syms, class, (int *)0));
|
return (sym_ntos(__p_class_syms, class, (int *)0));
|
}
|
}
|
libresolv_hidden_def (p_class)
|
libresolv_hidden_def (p_class)
|
|
|
/*
|
/*
|
* Return a mnemonic for an option
|
* Return a mnemonic for an option
|
*/
|
*/
|
const char *
|
const char *
|
p_option(u_long option) {
|
p_option(u_long option) {
|
static char nbuf[40];
|
static char nbuf[40];
|
|
|
switch (option) {
|
switch (option) {
|
case RES_INIT: return "init";
|
case RES_INIT: return "init";
|
case RES_DEBUG: return "debug";
|
case RES_DEBUG: return "debug";
|
case RES_AAONLY: return "aaonly(unimpl)";
|
case RES_AAONLY: return "aaonly(unimpl)";
|
case RES_USEVC: return "usevc";
|
case RES_USEVC: return "usevc";
|
case RES_PRIMARY: return "primry(unimpl)";
|
case RES_PRIMARY: return "primry(unimpl)";
|
case RES_IGNTC: return "igntc";
|
case RES_IGNTC: return "igntc";
|
case RES_RECURSE: return "recurs";
|
case RES_RECURSE: return "recurs";
|
case RES_DEFNAMES: return "defnam";
|
case RES_DEFNAMES: return "defnam";
|
case RES_STAYOPEN: return "styopn";
|
case RES_STAYOPEN: return "styopn";
|
case RES_DNSRCH: return "dnsrch";
|
case RES_DNSRCH: return "dnsrch";
|
case RES_INSECURE1: return "insecure1";
|
case RES_INSECURE1: return "insecure1";
|
case RES_INSECURE2: return "insecure2";
|
case RES_INSECURE2: return "insecure2";
|
case RES_USE_INET6: return "inet6";
|
case RES_USE_INET6: return "inet6";
|
case RES_ROTATE: return "rotate";
|
case RES_ROTATE: return "rotate";
|
case RES_NOCHECKNAME: return "no-check-names";
|
case RES_NOCHECKNAME: return "no-check-names";
|
case RES_USEBSTRING: return "ip6-bytstring";
|
case RES_USEBSTRING: return "ip6-bytstring";
|
/* XXX nonreentrant */
|
/* XXX nonreentrant */
|
default: sprintf(nbuf, "?0x%lx?", (u_long)option);
|
default: sprintf(nbuf, "?0x%lx?", (u_long)option);
|
return (nbuf);
|
return (nbuf);
|
}
|
}
|
}
|
}
|
libresolv_hidden_def (p_option)
|
libresolv_hidden_def (p_option)
|
|
|
/*
|
/*
|
* Return a mnemonic for a time to live.
|
* Return a mnemonic for a time to live.
|
*/
|
*/
|
const char *
|
const char *
|
p_time(u_int32_t value) {
|
p_time(u_int32_t value) {
|
static char nbuf[40]; /* XXX nonreentrant */
|
static char nbuf[40]; /* XXX nonreentrant */
|
|
|
if (ns_format_ttl(value, nbuf, sizeof nbuf) < 0)
|
if (ns_format_ttl(value, nbuf, sizeof nbuf) < 0)
|
sprintf(nbuf, "%u", value);
|
sprintf(nbuf, "%u", value);
|
return (nbuf);
|
return (nbuf);
|
}
|
}
|
|
|
/*
|
/*
|
* Return a string for the rcode.
|
* Return a string for the rcode.
|
*/
|
*/
|
const char *
|
const char *
|
p_rcode(int rcode) {
|
p_rcode(int rcode) {
|
return (sym_ntos(__p_rcode_syms, rcode, (int *)0));
|
return (sym_ntos(__p_rcode_syms, rcode, (int *)0));
|
}
|
}
|
libresolv_hidden_def (p_rcode)
|
libresolv_hidden_def (p_rcode)
|
|
|
/*
|
/*
|
* routines to convert between on-the-wire RR format and zone file format.
|
* routines to convert between on-the-wire RR format and zone file format.
|
* Does not contain conversion to/from decimal degrees; divide or multiply
|
* Does not contain conversion to/from decimal degrees; divide or multiply
|
* by 60*60*1000 for that.
|
* by 60*60*1000 for that.
|
*/
|
*/
|
|
|
static const unsigned int poweroften[10]=
|
static const unsigned int poweroften[10]=
|
{ 1, 10, 100, 1000, 10000, 100000,
|
{ 1, 10, 100, 1000, 10000, 100000,
|
1000000,10000000,100000000,1000000000};
|
1000000,10000000,100000000,1000000000};
|
|
|
/* takes an XeY precision/size value, returns a string representation. */
|
/* takes an XeY precision/size value, returns a string representation. */
|
static const char *
|
static const char *
|
precsize_ntoa(prec)
|
precsize_ntoa(prec)
|
u_int8_t prec;
|
u_int8_t prec;
|
{
|
{
|
static char retbuf[sizeof "90000000.00"]; /* XXX nonreentrant */
|
static char retbuf[sizeof "90000000.00"]; /* XXX nonreentrant */
|
unsigned long val;
|
unsigned long val;
|
int mantissa, exponent;
|
int mantissa, exponent;
|
|
|
mantissa = (int)((prec >> 4) & 0x0f) % 10;
|
mantissa = (int)((prec >> 4) & 0x0f) % 10;
|
exponent = (int)((prec >> 0) & 0x0f) % 10;
|
exponent = (int)((prec >> 0) & 0x0f) % 10;
|
|
|
val = mantissa * poweroften[exponent];
|
val = mantissa * poweroften[exponent];
|
|
|
(void) sprintf(retbuf, "%ld.%.2ld", val/100, val%100);
|
(void) sprintf(retbuf, "%ld.%.2ld", val/100, val%100);
|
return (retbuf);
|
return (retbuf);
|
}
|
}
|
|
|
/* converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */
|
/* converts ascii size/precision X * 10**Y(cm) to 0xXY. moves pointer. */
|
static u_int8_t
|
static u_int8_t
|
precsize_aton(strptr)
|
precsize_aton(strptr)
|
const char **strptr;
|
const char **strptr;
|
{
|
{
|
unsigned int mval = 0, cmval = 0;
|
unsigned int mval = 0, cmval = 0;
|
u_int8_t retval = 0;
|
u_int8_t retval = 0;
|
const char *cp;
|
const char *cp;
|
int exponent;
|
int exponent;
|
int mantissa;
|
int mantissa;
|
|
|
cp = *strptr;
|
cp = *strptr;
|
|
|
while (isdigit(*cp))
|
while (isdigit(*cp))
|
mval = mval * 10 + (*cp++ - '0');
|
mval = mval * 10 + (*cp++ - '0');
|
|
|
if (*cp == '.') { /* centimeters */
|
if (*cp == '.') { /* centimeters */
|
cp++;
|
cp++;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
cmval = (*cp++ - '0') * 10;
|
cmval = (*cp++ - '0') * 10;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
cmval += (*cp++ - '0');
|
cmval += (*cp++ - '0');
|
}
|
}
|
}
|
}
|
}
|
}
|
cmval = (mval * 100) + cmval;
|
cmval = (mval * 100) + cmval;
|
|
|
for (exponent = 0; exponent < 9; exponent++)
|
for (exponent = 0; exponent < 9; exponent++)
|
if (cmval < poweroften[exponent+1])
|
if (cmval < poweroften[exponent+1])
|
break;
|
break;
|
|
|
mantissa = cmval / poweroften[exponent];
|
mantissa = cmval / poweroften[exponent];
|
if (mantissa > 9)
|
if (mantissa > 9)
|
mantissa = 9;
|
mantissa = 9;
|
|
|
retval = (mantissa << 4) | exponent;
|
retval = (mantissa << 4) | exponent;
|
|
|
*strptr = cp;
|
*strptr = cp;
|
|
|
return (retval);
|
return (retval);
|
}
|
}
|
|
|
/* converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */
|
/* converts ascii lat/lon to unsigned encoded 32-bit number. moves pointer. */
|
static u_int32_t
|
static u_int32_t
|
latlon2ul(latlonstrptr,which)
|
latlon2ul(latlonstrptr,which)
|
const char **latlonstrptr;
|
const char **latlonstrptr;
|
int *which;
|
int *which;
|
{
|
{
|
const char *cp;
|
const char *cp;
|
u_int32_t retval;
|
u_int32_t retval;
|
int deg = 0, min = 0, secs = 0, secsfrac = 0;
|
int deg = 0, min = 0, secs = 0, secsfrac = 0;
|
|
|
cp = *latlonstrptr;
|
cp = *latlonstrptr;
|
|
|
while (isdigit(*cp))
|
while (isdigit(*cp))
|
deg = deg * 10 + (*cp++ - '0');
|
deg = deg * 10 + (*cp++ - '0');
|
|
|
while (isspace(*cp))
|
while (isspace(*cp))
|
cp++;
|
cp++;
|
|
|
if (!(isdigit(*cp)))
|
if (!(isdigit(*cp)))
|
goto fndhemi;
|
goto fndhemi;
|
|
|
while (isdigit(*cp))
|
while (isdigit(*cp))
|
min = min * 10 + (*cp++ - '0');
|
min = min * 10 + (*cp++ - '0');
|
|
|
while (isspace(*cp))
|
while (isspace(*cp))
|
cp++;
|
cp++;
|
|
|
if (!(isdigit(*cp)))
|
if (!(isdigit(*cp)))
|
goto fndhemi;
|
goto fndhemi;
|
|
|
while (isdigit(*cp))
|
while (isdigit(*cp))
|
secs = secs * 10 + (*cp++ - '0');
|
secs = secs * 10 + (*cp++ - '0');
|
|
|
if (*cp == '.') { /* decimal seconds */
|
if (*cp == '.') { /* decimal seconds */
|
cp++;
|
cp++;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
secsfrac = (*cp++ - '0') * 100;
|
secsfrac = (*cp++ - '0') * 100;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
secsfrac += (*cp++ - '0') * 10;
|
secsfrac += (*cp++ - '0') * 10;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
secsfrac += (*cp++ - '0');
|
secsfrac += (*cp++ - '0');
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
while (!isspace(*cp)) /* if any trailing garbage */
|
while (!isspace(*cp)) /* if any trailing garbage */
|
cp++;
|
cp++;
|
|
|
while (isspace(*cp))
|
while (isspace(*cp))
|
cp++;
|
cp++;
|
|
|
fndhemi:
|
fndhemi:
|
switch (*cp) {
|
switch (*cp) {
|
case 'N': case 'n':
|
case 'N': case 'n':
|
case 'E': case 'e':
|
case 'E': case 'e':
|
retval = ((unsigned)1<<31)
|
retval = ((unsigned)1<<31)
|
+ (((((deg * 60) + min) * 60) + secs) * 1000)
|
+ (((((deg * 60) + min) * 60) + secs) * 1000)
|
+ secsfrac;
|
+ secsfrac;
|
break;
|
break;
|
case 'S': case 's':
|
case 'S': case 's':
|
case 'W': case 'w':
|
case 'W': case 'w':
|
retval = ((unsigned)1<<31)
|
retval = ((unsigned)1<<31)
|
- (((((deg * 60) + min) * 60) + secs) * 1000)
|
- (((((deg * 60) + min) * 60) + secs) * 1000)
|
- secsfrac;
|
- secsfrac;
|
break;
|
break;
|
default:
|
default:
|
retval = 0; /* invalid value -- indicates error */
|
retval = 0; /* invalid value -- indicates error */
|
break;
|
break;
|
}
|
}
|
|
|
switch (*cp) {
|
switch (*cp) {
|
case 'N': case 'n':
|
case 'N': case 'n':
|
case 'S': case 's':
|
case 'S': case 's':
|
*which = 1; /* latitude */
|
*which = 1; /* latitude */
|
break;
|
break;
|
case 'E': case 'e':
|
case 'E': case 'e':
|
case 'W': case 'w':
|
case 'W': case 'w':
|
*which = 2; /* longitude */
|
*which = 2; /* longitude */
|
break;
|
break;
|
default:
|
default:
|
*which = 0; /* error */
|
*which = 0; /* error */
|
break;
|
break;
|
}
|
}
|
|
|
cp++; /* skip the hemisphere */
|
cp++; /* skip the hemisphere */
|
|
|
while (!isspace(*cp)) /* if any trailing garbage */
|
while (!isspace(*cp)) /* if any trailing garbage */
|
cp++;
|
cp++;
|
|
|
while (isspace(*cp)) /* move to next field */
|
while (isspace(*cp)) /* move to next field */
|
cp++;
|
cp++;
|
|
|
*latlonstrptr = cp;
|
*latlonstrptr = cp;
|
|
|
return (retval);
|
return (retval);
|
}
|
}
|
|
|
/* converts a zone file representation in a string to an RDATA on-the-wire
|
/* converts a zone file representation in a string to an RDATA on-the-wire
|
* representation. */
|
* representation. */
|
int
|
int
|
loc_aton(ascii, binary)
|
loc_aton(ascii, binary)
|
const char *ascii;
|
const char *ascii;
|
u_char *binary;
|
u_char *binary;
|
{
|
{
|
const char *cp, *maxcp;
|
const char *cp, *maxcp;
|
u_char *bcp;
|
u_char *bcp;
|
|
|
u_int32_t latit = 0, longit = 0, alt = 0;
|
u_int32_t latit = 0, longit = 0, alt = 0;
|
u_int32_t lltemp1 = 0, lltemp2 = 0;
|
u_int32_t lltemp1 = 0, lltemp2 = 0;
|
int altmeters = 0, altfrac = 0, altsign = 1;
|
int altmeters = 0, altfrac = 0, altsign = 1;
|
u_int8_t hp = 0x16; /* default = 1e6 cm = 10000.00m = 10km */
|
u_int8_t hp = 0x16; /* default = 1e6 cm = 10000.00m = 10km */
|
u_int8_t vp = 0x13; /* default = 1e3 cm = 10.00m */
|
u_int8_t vp = 0x13; /* default = 1e3 cm = 10.00m */
|
u_int8_t siz = 0x12; /* default = 1e2 cm = 1.00m */
|
u_int8_t siz = 0x12; /* default = 1e2 cm = 1.00m */
|
int which1 = 0, which2 = 0;
|
int which1 = 0, which2 = 0;
|
|
|
cp = ascii;
|
cp = ascii;
|
maxcp = cp + strlen(ascii);
|
maxcp = cp + strlen(ascii);
|
|
|
lltemp1 = latlon2ul(&cp, &which1);
|
lltemp1 = latlon2ul(&cp, &which1);
|
|
|
lltemp2 = latlon2ul(&cp, &which2);
|
lltemp2 = latlon2ul(&cp, &which2);
|
|
|
switch (which1 + which2) {
|
switch (which1 + which2) {
|
case 3: /* 1 + 2, the only valid combination */
|
case 3: /* 1 + 2, the only valid combination */
|
if ((which1 == 1) && (which2 == 2)) { /* normal case */
|
if ((which1 == 1) && (which2 == 2)) { /* normal case */
|
latit = lltemp1;
|
latit = lltemp1;
|
longit = lltemp2;
|
longit = lltemp2;
|
} else if ((which1 == 2) && (which2 == 1)) { /* reversed */
|
} else if ((which1 == 2) && (which2 == 1)) { /* reversed */
|
longit = lltemp1;
|
longit = lltemp1;
|
latit = lltemp2;
|
latit = lltemp2;
|
} else { /* some kind of brokenness */
|
} else { /* some kind of brokenness */
|
return (0);
|
return (0);
|
}
|
}
|
break;
|
break;
|
default: /* we didn't get one of each */
|
default: /* we didn't get one of each */
|
return (0);
|
return (0);
|
}
|
}
|
|
|
/* altitude */
|
/* altitude */
|
if (*cp == '-') {
|
if (*cp == '-') {
|
altsign = -1;
|
altsign = -1;
|
cp++;
|
cp++;
|
}
|
}
|
|
|
if (*cp == '+')
|
if (*cp == '+')
|
cp++;
|
cp++;
|
|
|
while (isdigit(*cp))
|
while (isdigit(*cp))
|
altmeters = altmeters * 10 + (*cp++ - '0');
|
altmeters = altmeters * 10 + (*cp++ - '0');
|
|
|
if (*cp == '.') { /* decimal meters */
|
if (*cp == '.') { /* decimal meters */
|
cp++;
|
cp++;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
altfrac = (*cp++ - '0') * 10;
|
altfrac = (*cp++ - '0') * 10;
|
if (isdigit(*cp)) {
|
if (isdigit(*cp)) {
|
altfrac += (*cp++ - '0');
|
altfrac += (*cp++ - '0');
|
}
|
}
|
}
|
}
|
}
|
}
|
|
|
alt = (10000000 + (altsign * (altmeters * 100 + altfrac)));
|
alt = (10000000 + (altsign * (altmeters * 100 + altfrac)));
|
|
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
cp++;
|
cp++;
|
|
|
while (isspace(*cp) && (cp < maxcp))
|
while (isspace(*cp) && (cp < maxcp))
|
cp++;
|
cp++;
|
|
|
if (cp >= maxcp)
|
if (cp >= maxcp)
|
goto defaults;
|
goto defaults;
|
|
|
siz = precsize_aton(&cp);
|
siz = precsize_aton(&cp);
|
|
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
cp++;
|
cp++;
|
|
|
while (isspace(*cp) && (cp < maxcp))
|
while (isspace(*cp) && (cp < maxcp))
|
cp++;
|
cp++;
|
|
|
if (cp >= maxcp)
|
if (cp >= maxcp)
|
goto defaults;
|
goto defaults;
|
|
|
hp = precsize_aton(&cp);
|
hp = precsize_aton(&cp);
|
|
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
while (!isspace(*cp) && (cp < maxcp)) /* if trailing garbage or m */
|
cp++;
|
cp++;
|
|
|
while (isspace(*cp) && (cp < maxcp))
|
while (isspace(*cp) && (cp < maxcp))
|
cp++;
|
cp++;
|
|
|
if (cp >= maxcp)
|
if (cp >= maxcp)
|
goto defaults;
|
goto defaults;
|
|
|
vp = precsize_aton(&cp);
|
vp = precsize_aton(&cp);
|
|
|
defaults:
|
defaults:
|
|
|
bcp = binary;
|
bcp = binary;
|
*bcp++ = (u_int8_t) 0; /* version byte */
|
*bcp++ = (u_int8_t) 0; /* version byte */
|
*bcp++ = siz;
|
*bcp++ = siz;
|
*bcp++ = hp;
|
*bcp++ = hp;
|
*bcp++ = vp;
|
*bcp++ = vp;
|
PUTLONG(latit,bcp);
|
PUTLONG(latit,bcp);
|
PUTLONG(longit,bcp);
|
PUTLONG(longit,bcp);
|
PUTLONG(alt,bcp);
|
PUTLONG(alt,bcp);
|
|
|
return (16); /* size of RR in octets */
|
return (16); /* size of RR in octets */
|
}
|
}
|
|
|
/* takes an on-the-wire LOC RR and formats it in a human readable format. */
|
/* takes an on-the-wire LOC RR and formats it in a human readable format. */
|
const char *
|
const char *
|
loc_ntoa(binary, ascii)
|
loc_ntoa(binary, ascii)
|
const u_char *binary;
|
const u_char *binary;
|
char *ascii;
|
char *ascii;
|
{
|
{
|
static char *error = "?";
|
static char *error = "?";
|
static char tmpbuf[sizeof
|
static char tmpbuf[sizeof
|
"1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"];
|
"1000 60 60.000 N 1000 60 60.000 W -12345678.00m 90000000.00m 90000000.00m 90000000.00m"];
|
const u_char *cp = binary;
|
const u_char *cp = binary;
|
|
|
int latdeg, latmin, latsec, latsecfrac;
|
int latdeg, latmin, latsec, latsecfrac;
|
int longdeg, longmin, longsec, longsecfrac;
|
int longdeg, longmin, longsec, longsecfrac;
|
char northsouth, eastwest;
|
char northsouth, eastwest;
|
int altmeters, altfrac, altsign;
|
int altmeters, altfrac, altsign;
|
|
|
const u_int32_t referencealt = 100000 * 100;
|
const u_int32_t referencealt = 100000 * 100;
|
|
|
int32_t latval, longval, altval;
|
int32_t latval, longval, altval;
|
u_int32_t templ;
|
u_int32_t templ;
|
u_int8_t sizeval, hpval, vpval, versionval;
|
u_int8_t sizeval, hpval, vpval, versionval;
|
|
|
char *sizestr, *hpstr, *vpstr;
|
char *sizestr, *hpstr, *vpstr;
|
|
|
versionval = *cp++;
|
versionval = *cp++;
|
|
|
if (ascii == NULL)
|
if (ascii == NULL)
|
ascii = tmpbuf;
|
ascii = tmpbuf;
|
|
|
if (versionval) {
|
if (versionval) {
|
(void) sprintf(ascii, "; error: unknown LOC RR version");
|
(void) sprintf(ascii, "; error: unknown LOC RR version");
|
return (ascii);
|
return (ascii);
|
}
|
}
|
|
|
sizeval = *cp++;
|
sizeval = *cp++;
|
|
|
hpval = *cp++;
|
hpval = *cp++;
|
vpval = *cp++;
|
vpval = *cp++;
|
|
|
GETLONG(templ, cp);
|
GETLONG(templ, cp);
|
latval = (templ - ((unsigned)1<<31));
|
latval = (templ - ((unsigned)1<<31));
|
|
|
GETLONG(templ, cp);
|
GETLONG(templ, cp);
|
longval = (templ - ((unsigned)1<<31));
|
longval = (templ - ((unsigned)1<<31));
|
|
|
GETLONG(templ, cp);
|
GETLONG(templ, cp);
|
if (templ < referencealt) { /* below WGS 84 spheroid */
|
if (templ < referencealt) { /* below WGS 84 spheroid */
|
altval = referencealt - templ;
|
altval = referencealt - templ;
|
altsign = -1;
|
altsign = -1;
|
} else {
|
} else {
|
altval = templ - referencealt;
|
altval = templ - referencealt;
|
altsign = 1;
|
altsign = 1;
|
}
|
}
|
|
|
if (latval < 0) {
|
if (latval < 0) {
|
northsouth = 'S';
|
northsouth = 'S';
|
latval = -latval;
|
latval = -latval;
|
} else
|
} else
|
northsouth = 'N';
|
northsouth = 'N';
|
|
|
latsecfrac = latval % 1000;
|
latsecfrac = latval % 1000;
|
latval = latval / 1000;
|
latval = latval / 1000;
|
latsec = latval % 60;
|
latsec = latval % 60;
|
latval = latval / 60;
|
latval = latval / 60;
|
latmin = latval % 60;
|
latmin = latval % 60;
|
latval = latval / 60;
|
latval = latval / 60;
|
latdeg = latval;
|
latdeg = latval;
|
|
|
if (longval < 0) {
|
if (longval < 0) {
|
eastwest = 'W';
|
eastwest = 'W';
|
longval = -longval;
|
longval = -longval;
|
} else
|
} else
|
eastwest = 'E';
|
eastwest = 'E';
|
|
|
longsecfrac = longval % 1000;
|
longsecfrac = longval % 1000;
|
longval = longval / 1000;
|
longval = longval / 1000;
|
longsec = longval % 60;
|
longsec = longval % 60;
|
longval = longval / 60;
|
longval = longval / 60;
|
longmin = longval % 60;
|
longmin = longval % 60;
|
longval = longval / 60;
|
longval = longval / 60;
|
longdeg = longval;
|
longdeg = longval;
|
|
|
altfrac = altval % 100;
|
altfrac = altval % 100;
|
altmeters = (altval / 100) * altsign;
|
altmeters = (altval / 100) * altsign;
|
|
|
if ((sizestr = strdup(precsize_ntoa(sizeval))) == NULL)
|
if ((sizestr = strdup(precsize_ntoa(sizeval))) == NULL)
|
sizestr = error;
|
sizestr = error;
|
if ((hpstr = strdup(precsize_ntoa(hpval))) == NULL)
|
if ((hpstr = strdup(precsize_ntoa(hpval))) == NULL)
|
hpstr = error;
|
hpstr = error;
|
if ((vpstr = strdup(precsize_ntoa(vpval))) == NULL)
|
if ((vpstr = strdup(precsize_ntoa(vpval))) == NULL)
|
vpstr = error;
|
vpstr = error;
|
|
|
sprintf(ascii,
|
sprintf(ascii,
|
"%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %d.%.2dm %sm %sm %sm",
|
"%d %.2d %.2d.%.3d %c %d %.2d %.2d.%.3d %c %d.%.2dm %sm %sm %sm",
|
latdeg, latmin, latsec, latsecfrac, northsouth,
|
latdeg, latmin, latsec, latsecfrac, northsouth,
|
longdeg, longmin, longsec, longsecfrac, eastwest,
|
longdeg, longmin, longsec, longsecfrac, eastwest,
|
altmeters, altfrac, sizestr, hpstr, vpstr);
|
altmeters, altfrac, sizestr, hpstr, vpstr);
|
|
|
if (sizestr != error)
|
if (sizestr != error)
|
free(sizestr);
|
free(sizestr);
|
if (hpstr != error)
|
if (hpstr != error)
|
free(hpstr);
|
free(hpstr);
|
if (vpstr != error)
|
if (vpstr != error)
|
free(vpstr);
|
free(vpstr);
|
|
|
return (ascii);
|
return (ascii);
|
}
|
}
|
libresolv_hidden_def (loc_ntoa)
|
libresolv_hidden_def (loc_ntoa)
|
|
|
|
|
/* Return the number of DNS hierarchy levels in the name. */
|
/* Return the number of DNS hierarchy levels in the name. */
|
int
|
int
|
dn_count_labels(const char *name) {
|
dn_count_labels(const char *name) {
|
int i, len, count;
|
int i, len, count;
|
|
|
len = strlen(name);
|
len = strlen(name);
|
for (i = 0, count = 0; i < len; i++) {
|
for (i = 0, count = 0; i < len; i++) {
|
/* XXX need to check for \. or use named's nlabels(). */
|
/* XXX need to check for \. or use named's nlabels(). */
|
if (name[i] == '.')
|
if (name[i] == '.')
|
count++;
|
count++;
|
}
|
}
|
|
|
/* don't count initial wildcard */
|
/* don't count initial wildcard */
|
if (name[0] == '*')
|
if (name[0] == '*')
|
if (count)
|
if (count)
|
count--;
|
count--;
|
|
|
/* don't count the null label for root. */
|
/* don't count the null label for root. */
|
/* if terminating '.' not found, must adjust */
|
/* if terminating '.' not found, must adjust */
|
/* count to include last label */
|
/* count to include last label */
|
if (len > 0 && name[len-1] != '.')
|
if (len > 0 && name[len-1] != '.')
|
count++;
|
count++;
|
return (count);
|
return (count);
|
}
|
}
|
|
|
|
|
/*
|
/*
|
* Make dates expressed in seconds-since-Jan-1-1970 easy to read.
|
* Make dates expressed in seconds-since-Jan-1-1970 easy to read.
|
* SIG records are required to be printed like this, by the Secure DNS RFC.
|
* SIG records are required to be printed like this, by the Secure DNS RFC.
|
*/
|
*/
|
char *
|
char *
|
p_secstodate (u_long secs) {
|
p_secstodate (u_long secs) {
|
/* XXX nonreentrant */
|
/* XXX nonreentrant */
|
static char output[15]; /* YYYYMMDDHHMMSS and null */
|
static char output[15]; /* YYYYMMDDHHMMSS and null */
|
time_t clock = secs;
|
time_t clock = secs;
|
struct tm *time;
|
struct tm *time;
|
|
|
#ifdef HAVE_TIME_R
|
#ifdef HAVE_TIME_R
|
struct tm timebuf;
|
struct tm timebuf;
|
|
|
time = gmtime_r(&clock, &timebuf);
|
time = gmtime_r(&clock, &timebuf);
|
#else
|
#else
|
time = gmtime(&clock);
|
time = gmtime(&clock);
|
#endif
|
#endif
|
time->tm_year += 1900;
|
time->tm_year += 1900;
|
time->tm_mon += 1;
|
time->tm_mon += 1;
|
sprintf(output, "%04d%02d%02d%02d%02d%02d",
|
sprintf(output, "%04d%02d%02d%02d%02d%02d",
|
time->tm_year, time->tm_mon, time->tm_mday,
|
time->tm_year, time->tm_mon, time->tm_mday,
|
time->tm_hour, time->tm_min, time->tm_sec);
|
time->tm_hour, time->tm_min, time->tm_sec);
|
return (output);
|
return (output);
|
}
|
}
|
|
|
