/*
|
/*
|
* Copyright (c) 1985, 1993
|
* Copyright (c) 1985, 1993
|
* 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) 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_comp.c 8.1 (Berkeley) 6/4/93";
|
static const char sccsid[] = "@(#)res_comp.c 8.1 (Berkeley) 6/4/93";
|
static const char rcsid[] = "$BINDId: res_comp.c,v 8.15 1999/10/13 16:39:39 vixie Exp $";
|
static const char rcsid[] = "$BINDId: res_comp.c,v 8.15 1999/10/13 16:39:39 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 <netinet/in.h>
|
#include <netinet/in.h>
|
#include <arpa/nameser.h>
|
#include <arpa/nameser.h>
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <resolv.h>
|
#include <resolv.h>
|
#include <stdio.h>
|
#include <stdio.h>
|
#include <string.h>
|
#include <string.h>
|
#include <unistd.h>
|
#include <unistd.h>
|
#include "libc-symbols.h"
|
#include "libc-symbols.h"
|
|
|
/*
|
/*
|
* Expand compressed domain name 'comp_dn' to full domain name.
|
* Expand compressed domain name 'comp_dn' to full domain name.
|
* 'msg' is a pointer to the begining of the message,
|
* 'msg' is a pointer to the begining of the message,
|
* 'eomorig' points to the first location after the message,
|
* 'eomorig' points to the first location after the message,
|
* 'exp_dn' is a pointer to a buffer of size 'length' for the result.
|
* 'exp_dn' is a pointer to a buffer of size 'length' for the result.
|
* Return size of compressed name or -1 if there was an error.
|
* Return size of compressed name or -1 if there was an error.
|
*/
|
*/
|
int
|
int
|
dn_expand(const u_char *msg, const u_char *eom, const u_char *src,
|
dn_expand(const u_char *msg, const u_char *eom, const u_char *src,
|
char *dst, int dstsiz)
|
char *dst, int dstsiz)
|
{
|
{
|
int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
|
int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
|
|
|
if (n > 0 && dst[0] == '.')
|
if (n > 0 && dst[0] == '.')
|
dst[0] = '\0';
|
dst[0] = '\0';
|
return (n);
|
return (n);
|
}
|
}
|
libresolv_hidden_def (dn_expand)
|
libresolv_hidden_def (dn_expand)
|
|
|
/*
|
/*
|
* Pack domain name 'exp_dn' in presentation form into 'comp_dn'.
|
* Pack domain name 'exp_dn' in presentation form into 'comp_dn'.
|
* Return the size of the compressed name or -1.
|
* Return the size of the compressed name or -1.
|
* 'length' is the size of the array pointed to by 'comp_dn'.
|
* 'length' is the size of the array pointed to by 'comp_dn'.
|
*/
|
*/
|
int
|
int
|
dn_comp(const char *src, u_char *dst, int dstsiz,
|
dn_comp(const char *src, u_char *dst, int dstsiz,
|
u_char **dnptrs, u_char **lastdnptr)
|
u_char **dnptrs, u_char **lastdnptr)
|
{
|
{
|
return (ns_name_compress(src, dst, (size_t)dstsiz,
|
return (ns_name_compress(src, dst, (size_t)dstsiz,
|
(const u_char **)dnptrs,
|
(const u_char **)dnptrs,
|
(const u_char **)lastdnptr));
|
(const u_char **)lastdnptr));
|
}
|
}
|
libresolv_hidden_def (dn_comp)
|
libresolv_hidden_def (dn_comp)
|
|
|
/*
|
/*
|
* Skip over a compressed domain name. Return the size or -1.
|
* Skip over a compressed domain name. Return the size or -1.
|
*/
|
*/
|
int
|
int
|
dn_skipname(const u_char *ptr, const u_char *eom) {
|
dn_skipname(const u_char *ptr, const u_char *eom) {
|
const u_char *saveptr = ptr;
|
const u_char *saveptr = ptr;
|
|
|
if (ns_name_skip(&ptr, eom) == -1)
|
if (ns_name_skip(&ptr, eom) == -1)
|
return (-1);
|
return (-1);
|
return (ptr - saveptr);
|
return (ptr - saveptr);
|
}
|
}
|
libresolv_hidden_def (dn_skipname)
|
libresolv_hidden_def (dn_skipname)
|
|
|
/*
|
/*
|
* Verify that a domain name uses an acceptable character set.
|
* Verify that a domain name uses an acceptable character set.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Note the conspicuous absence of ctype macros in these definitions. On
|
* Note the conspicuous absence of ctype macros in these definitions. On
|
* non-ASCII hosts, we can't depend on string literals or ctype macros to
|
* non-ASCII hosts, we can't depend on string literals or ctype macros to
|
* tell us anything about network-format data. The rest of the BIND system
|
* tell us anything about network-format data. The rest of the BIND system
|
* is not careful about this, but for some reason, we're doing it right here.
|
* is not careful about this, but for some reason, we're doing it right here.
|
*/
|
*/
|
#define PERIOD 0x2e
|
#define PERIOD 0x2e
|
#define hyphenchar(c) ((c) == 0x2d)
|
#define hyphenchar(c) ((c) == 0x2d)
|
#define underscorechar(c) ((c) == 0x5f)
|
#define underscorechar(c) ((c) == 0x5f)
|
#define bslashchar(c) ((c) == 0x5c)
|
#define bslashchar(c) ((c) == 0x5c)
|
#define periodchar(c) ((c) == PERIOD)
|
#define periodchar(c) ((c) == PERIOD)
|
#define asterchar(c) ((c) == 0x2a)
|
#define asterchar(c) ((c) == 0x2a)
|
#define alphachar(c) (((c) >= 0x41 && (c) <= 0x5a) \
|
#define alphachar(c) (((c) >= 0x41 && (c) <= 0x5a) \
|
|| ((c) >= 0x61 && (c) <= 0x7a))
|
|| ((c) >= 0x61 && (c) <= 0x7a))
|
#define digitchar(c) ((c) >= 0x30 && (c) <= 0x39)
|
#define digitchar(c) ((c) >= 0x30 && (c) <= 0x39)
|
|
|
#define borderchar(c) (alphachar(c) || digitchar(c))
|
#define borderchar(c) (alphachar(c) || digitchar(c))
|
#define middlechar(c) (borderchar(c) || hyphenchar(c) || underscorechar(c))
|
#define middlechar(c) (borderchar(c) || hyphenchar(c) || underscorechar(c))
|
#define domainchar(c) ((c) > 0x20 && (c) < 0x7f)
|
#define domainchar(c) ((c) > 0x20 && (c) < 0x7f)
|
|
|
int
|
int
|
res_hnok(const char *dn) {
|
res_hnok(const char *dn) {
|
int ppch = '\0', pch = PERIOD, ch = *dn++;
|
int ppch = '\0', pch = PERIOD, ch = *dn++;
|
|
|
while (ch != '\0') {
|
while (ch != '\0') {
|
int nch = *dn++;
|
int nch = *dn++;
|
|
|
if (periodchar(ch)) {
|
if (periodchar(ch)) {
|
(void)NULL;
|
(void)NULL;
|
} else if (periodchar(pch)) {
|
} else if (periodchar(pch)) {
|
if (!borderchar(ch))
|
if (!borderchar(ch))
|
return (0);
|
return (0);
|
} else if (periodchar(nch) || nch == '\0') {
|
} else if (periodchar(nch) || nch == '\0') {
|
if (!borderchar(ch))
|
if (!borderchar(ch))
|
return (0);
|
return (0);
|
} else {
|
} else {
|
if (!middlechar(ch))
|
if (!middlechar(ch))
|
return (0);
|
return (0);
|
}
|
}
|
ppch = pch, pch = ch, ch = nch;
|
ppch = pch, pch = ch, ch = nch;
|
}
|
}
|
return (1);
|
return (1);
|
}
|
}
|
libresolv_hidden_def (res_hnok)
|
libresolv_hidden_def (res_hnok)
|
|
|
/*
|
/*
|
* hostname-like (A, MX, WKS) owners can have "*" as their first label
|
* hostname-like (A, MX, WKS) owners can have "*" as their first label
|
* but must otherwise be as a host name.
|
* but must otherwise be as a host name.
|
*/
|
*/
|
int
|
int
|
res_ownok(const char *dn) {
|
res_ownok(const char *dn) {
|
if (asterchar(dn[0])) {
|
if (asterchar(dn[0])) {
|
if (periodchar(dn[1]))
|
if (periodchar(dn[1]))
|
return (res_hnok(dn+2));
|
return (res_hnok(dn+2));
|
if (dn[1] == '\0')
|
if (dn[1] == '\0')
|
return (1);
|
return (1);
|
}
|
}
|
return (res_hnok(dn));
|
return (res_hnok(dn));
|
}
|
}
|
|
|
/*
|
/*
|
* SOA RNAMEs and RP RNAMEs can have any printable character in their first
|
* SOA RNAMEs and RP RNAMEs can have any printable character in their first
|
* label, but the rest of the name has to look like a host name.
|
* label, but the rest of the name has to look like a host name.
|
*/
|
*/
|
int
|
int
|
res_mailok(const char *dn) {
|
res_mailok(const char *dn) {
|
int ch, escaped = 0;
|
int ch, escaped = 0;
|
|
|
/* "." is a valid missing representation */
|
/* "." is a valid missing representation */
|
if (*dn == '\0')
|
if (*dn == '\0')
|
return (1);
|
return (1);
|
|
|
/* otherwise <label>.<hostname> */
|
/* otherwise <label>.<hostname> */
|
while ((ch = *dn++) != '\0') {
|
while ((ch = *dn++) != '\0') {
|
if (!domainchar(ch))
|
if (!domainchar(ch))
|
return (0);
|
return (0);
|
if (!escaped && periodchar(ch))
|
if (!escaped && periodchar(ch))
|
break;
|
break;
|
if (escaped)
|
if (escaped)
|
escaped = 0;
|
escaped = 0;
|
else if (bslashchar(ch))
|
else if (bslashchar(ch))
|
escaped = 1;
|
escaped = 1;
|
}
|
}
|
if (periodchar(ch))
|
if (periodchar(ch))
|
return (res_hnok(dn));
|
return (res_hnok(dn));
|
return (0);
|
return (0);
|
}
|
}
|
|
|
/*
|
/*
|
* This function is quite liberal, since RFC 1034's character sets are only
|
* This function is quite liberal, since RFC 1034's character sets are only
|
* recommendations.
|
* recommendations.
|
*/
|
*/
|
int
|
int
|
res_dnok(const char *dn) {
|
res_dnok(const char *dn) {
|
int ch;
|
int ch;
|
|
|
while ((ch = *dn++) != '\0')
|
while ((ch = *dn++) != '\0')
|
if (!domainchar(ch))
|
if (!domainchar(ch))
|
return (0);
|
return (0);
|
return (1);
|
return (1);
|
}
|
}
|
libresolv_hidden_def (res_dnok)
|
libresolv_hidden_def (res_dnok)
|
|
|
#ifdef BIND_4_COMPAT
|
#ifdef BIND_4_COMPAT
|
/*
|
/*
|
* This module must export the following externally-visible symbols:
|
* This module must export the following externally-visible symbols:
|
* ___putlong
|
* ___putlong
|
* ___putshort
|
* ___putshort
|
* __getlong
|
* __getlong
|
* __getshort
|
* __getshort
|
* Note that one _ comes from C and the others come from us.
|
* Note that one _ comes from C and the others come from us.
|
*/
|
*/
|
void __putlong(u_int32_t src, u_char *dst) { ns_put32(src, dst); }
|
void __putlong(u_int32_t src, u_char *dst) { ns_put32(src, dst); }
|
libresolv_hidden_def (__putlong)
|
libresolv_hidden_def (__putlong)
|
void __putshort(u_int16_t src, u_char *dst) { ns_put16(src, dst); }
|
void __putshort(u_int16_t src, u_char *dst) { ns_put16(src, dst); }
|
libresolv_hidden_def (__putshort)
|
libresolv_hidden_def (__putshort)
|
#ifndef __ultrix__
|
#ifndef __ultrix__
|
u_int32_t _getlong(const u_char *src) { return (ns_get32(src)); }
|
u_int32_t _getlong(const u_char *src) { return (ns_get32(src)); }
|
u_int16_t _getshort(const u_char *src) { return (ns_get16(src)); }
|
u_int16_t _getshort(const u_char *src) { return (ns_get16(src)); }
|
#endif /*__ultrix__*/
|
#endif /*__ultrix__*/
|
#endif /*BIND_4_COMPAT*/
|
#endif /*BIND_4_COMPAT*/
|
|
|
|
|
#include <shlib-compat.h>
|
#include <shlib-compat.h>
|
|
|
#if SHLIB_COMPAT(libresolv, GLIBC_2_0, GLIBC_2_2)
|
#if SHLIB_COMPAT(libresolv, GLIBC_2_0, GLIBC_2_2)
|
# undef dn_expand
|
# undef dn_expand
|
weak_alias (__dn_expand, dn_expand);
|
weak_alias (__dn_expand, dn_expand);
|
#endif
|
#endif
|
|
|
