/*
|
/*
|
* Copyright (c) 1996,1999 by Internet Software Consortium.
|
* 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) && !defined(lint)
|
#if !defined(_LIBC) && !defined(lint)
|
static const char rcsid[] = "$BINDId: ns_name.c,v 8.15 2000/03/30 22:53:46 vixie Exp $";
|
static const char rcsid[] = "$BINDId: ns_name.c,v 8.15 2000/03/30 22:53:46 vixie Exp $";
|
#endif
|
#endif
|
|
|
#include <sys/types.h>
|
#include <sys/types.h>
|
|
|
#include <netinet/in.h>
|
#include <netinet/in.h>
|
#include <arpa/nameser.h>
|
#include <arpa/nameser.h>
|
|
|
#include <ctype.h>
|
#include <ctype.h>
|
#include <errno.h>
|
#include <errno.h>
|
#include <resolv.h>
|
#include <resolv.h>
|
#include <string.h>
|
#include <string.h>
|
#include <ctype.h>
|
#include <ctype.h>
|
#include "libc-symbols.h"
|
#include "libc-symbols.h"
|
|
|
/* Data. */
|
/* Data. */
|
|
|
static const char digits[] = "0123456789";
|
static const char digits[] = "0123456789";
|
|
|
/* Forward. */
|
/* Forward. */
|
|
|
static int special(int);
|
static int special(int);
|
static int printable(int);
|
static int printable(int);
|
static int dn_find(const u_char *, const u_char *,
|
static int dn_find(const u_char *, const u_char *,
|
const u_char * const *,
|
const u_char * const *,
|
const u_char * const *);
|
const u_char * const *);
|
|
|
/* Public. */
|
/* Public. */
|
|
|
/*
|
/*
|
* ns_name_ntop(src, dst, dstsiz)
|
* ns_name_ntop(src, dst, dstsiz)
|
* Convert an encoded domain name to printable ascii as per RFC1035.
|
* Convert an encoded domain name to printable ascii as per RFC1035.
|
* return:
|
* return:
|
* Number of bytes written to buffer, or -1 (with errno set)
|
* Number of bytes written to buffer, or -1 (with errno set)
|
* notes:
|
* notes:
|
* The root is returned as "."
|
* The root is returned as "."
|
* All other domains are returned in non absolute form
|
* All other domains are returned in non absolute form
|
*/
|
*/
|
int
|
int
|
ns_name_ntop(const u_char *src, char *dst, size_t dstsiz) {
|
ns_name_ntop(const u_char *src, char *dst, size_t dstsiz) {
|
const u_char *cp;
|
const u_char *cp;
|
char *dn, *eom;
|
char *dn, *eom;
|
u_char c;
|
u_char c;
|
u_int n;
|
u_int n;
|
|
|
cp = src;
|
cp = src;
|
dn = dst;
|
dn = dst;
|
eom = dst + dstsiz;
|
eom = dst + dstsiz;
|
|
|
while ((n = *cp++) != 0) {
|
while ((n = *cp++) != 0) {
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) {
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) {
|
/* Some kind of compression pointer. */
|
/* Some kind of compression pointer. */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
if (dn != dst) {
|
if (dn != dst) {
|
if (dn >= eom) {
|
if (dn >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '.';
|
*dn++ = '.';
|
}
|
}
|
|
|
if (n == 0x41) {
|
if (n == 0x41) {
|
n = *cp++ / 8;
|
n = *cp++ / 8;
|
if (dn + n * 2 + 4 >= eom) {
|
if (dn + n * 2 + 4 >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '\\';
|
*dn++ = '\\';
|
*dn++ = '[';
|
*dn++ = '[';
|
*dn++ = 'x';
|
*dn++ = 'x';
|
|
|
while (n-- > 0) {
|
while (n-- > 0) {
|
c = *cp++;
|
c = *cp++;
|
unsigned u = c >> 4;
|
unsigned u = c >> 4;
|
*dn++ = u > 9 ? 'a' + u - 10 : '0' + u;
|
*dn++ = u > 9 ? 'a' + u - 10 : '0' + u;
|
u = c & 0xf;
|
u = c & 0xf;
|
*dn++ = u > 9 ? 'a' + u - 10 : '0' + u;
|
*dn++ = u > 9 ? 'a' + u - 10 : '0' + u;
|
}
|
}
|
|
|
*dn++ = ']';
|
*dn++ = ']';
|
continue;
|
continue;
|
}
|
}
|
|
|
if (dn + n >= eom) {
|
if (dn + n >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
for ((void)NULL; n > 0; n--) {
|
for ((void)NULL; n > 0; n--) {
|
c = *cp++;
|
c = *cp++;
|
if (special(c)) {
|
if (special(c)) {
|
if (dn + 1 >= eom) {
|
if (dn + 1 >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '\\';
|
*dn++ = '\\';
|
*dn++ = (char)c;
|
*dn++ = (char)c;
|
} else if (!printable(c)) {
|
} else if (!printable(c)) {
|
if (dn + 3 >= eom) {
|
if (dn + 3 >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '\\';
|
*dn++ = '\\';
|
*dn++ = digits[c / 100];
|
*dn++ = digits[c / 100];
|
*dn++ = digits[(c % 100) / 10];
|
*dn++ = digits[(c % 100) / 10];
|
*dn++ = digits[c % 10];
|
*dn++ = digits[c % 10];
|
} else {
|
} else {
|
if (dn >= eom) {
|
if (dn >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = (char)c;
|
*dn++ = (char)c;
|
}
|
}
|
}
|
}
|
}
|
}
|
if (dn == dst) {
|
if (dn == dst) {
|
if (dn >= eom) {
|
if (dn >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '.';
|
*dn++ = '.';
|
}
|
}
|
if (dn >= eom) {
|
if (dn >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = '\0';
|
*dn++ = '\0';
|
return (dn - dst);
|
return (dn - dst);
|
}
|
}
|
libresolv_hidden_def (ns_name_ntop)
|
libresolv_hidden_def (ns_name_ntop)
|
|
|
/*
|
/*
|
* ns_name_pton(src, dst, dstsiz)
|
* ns_name_pton(src, dst, dstsiz)
|
* Convert a ascii string into an encoded domain name as per RFC1035.
|
* Convert a ascii string into an encoded domain name as per RFC1035.
|
* return:
|
* return:
|
* -1 if it fails
|
* -1 if it fails
|
* 1 if string was fully qualified
|
* 1 if string was fully qualified
|
* 0 is string was not fully qualified
|
* 0 is string was not fully qualified
|
* notes:
|
* notes:
|
* Enforces label and domain length limits.
|
* Enforces label and domain length limits.
|
*/
|
*/
|
|
|
int
|
int
|
ns_name_pton(const char *src, u_char *dst, size_t dstsiz) {
|
ns_name_pton(const char *src, u_char *dst, size_t dstsiz) {
|
u_char *label, *bp, *eom;
|
u_char *label, *bp, *eom;
|
int c, n, escaped;
|
int c, n, escaped;
|
char *cp;
|
char *cp;
|
|
|
escaped = 0;
|
escaped = 0;
|
bp = dst;
|
bp = dst;
|
eom = dst + dstsiz;
|
eom = dst + dstsiz;
|
label = bp++;
|
label = bp++;
|
|
|
while ((c = *src++) != 0) {
|
while ((c = *src++) != 0) {
|
if (escaped) {
|
if (escaped) {
|
if ((cp = strchr(digits, c)) != NULL) {
|
if ((cp = strchr(digits, c)) != NULL) {
|
n = (cp - digits) * 100;
|
n = (cp - digits) * 100;
|
if ((c = *src++) == 0 ||
|
if ((c = *src++) == 0 ||
|
(cp = strchr(digits, c)) == NULL) {
|
(cp = strchr(digits, c)) == NULL) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
n += (cp - digits) * 10;
|
n += (cp - digits) * 10;
|
if ((c = *src++) == 0 ||
|
if ((c = *src++) == 0 ||
|
(cp = strchr(digits, c)) == NULL) {
|
(cp = strchr(digits, c)) == NULL) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
n += (cp - digits);
|
n += (cp - digits);
|
if (n > 255) {
|
if (n > 255) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
c = n;
|
c = n;
|
} else if (c == '[' && label == bp - 1 && *src == 'x') {
|
} else if (c == '[' && label == bp - 1 && *src == 'x') {
|
/* Theoretically we would have to handle \[o
|
/* Theoretically we would have to handle \[o
|
as well but we do not since we do not need
|
as well but we do not since we do not need
|
it internally. */
|
it internally. */
|
*label = 0x41;
|
*label = 0x41;
|
label = bp++;
|
label = bp++;
|
++src;
|
++src;
|
while (isxdigit (*src)) {
|
while (isxdigit (*src)) {
|
n = *src > '9' ? *src - 'a' + 10 : *src - '0';
|
n = *src > '9' ? *src - 'a' + 10 : *src - '0';
|
++src;
|
++src;
|
if (! isxdigit(*src)) {
|
if (! isxdigit(*src)) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
n <<= 4;
|
n <<= 4;
|
n += *src > '9' ? *src - 'a' + 10 : *src - '0';
|
n += *src > '9' ? *src - 'a' + 10 : *src - '0';
|
if (bp + 1 >= eom) {
|
if (bp + 1 >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*bp++ = n;
|
*bp++ = n;
|
++src;
|
++src;
|
}
|
}
|
*label = (bp - label - 1) * 8;
|
*label = (bp - label - 1) * 8;
|
if (*src++ != ']' || *src++ != '.') {
|
if (*src++ != ']' || *src++ != '.') {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
escaped = 0;
|
escaped = 0;
|
label = bp++;
|
label = bp++;
|
if (bp >= eom) {
|
if (bp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
continue;
|
continue;
|
}
|
}
|
escaped = 0;
|
escaped = 0;
|
} else if (c == '\\') {
|
} else if (c == '\\') {
|
escaped = 1;
|
escaped = 1;
|
continue;
|
continue;
|
} else if (c == '.') {
|
} else if (c == '.') {
|
c = (bp - label - 1);
|
c = (bp - label - 1);
|
if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */
|
if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
if (label >= eom) {
|
if (label >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*label = c;
|
*label = c;
|
/* Fully qualified ? */
|
/* Fully qualified ? */
|
if (*src == '\0') {
|
if (*src == '\0') {
|
if (c != 0) {
|
if (c != 0) {
|
if (bp >= eom) {
|
if (bp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*bp++ = '\0';
|
*bp++ = '\0';
|
}
|
}
|
if ((bp - dst) > MAXCDNAME) {
|
if ((bp - dst) > MAXCDNAME) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
return (1);
|
return (1);
|
}
|
}
|
if (c == 0 || *src == '.') {
|
if (c == 0 || *src == '.') {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
label = bp++;
|
label = bp++;
|
continue;
|
continue;
|
}
|
}
|
if (bp >= eom) {
|
if (bp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*bp++ = (u_char)c;
|
*bp++ = (u_char)c;
|
}
|
}
|
c = (bp - label - 1);
|
c = (bp - label - 1);
|
if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */
|
if ((c & NS_CMPRSFLGS) != 0) { /* Label too big. */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
if (label >= eom) {
|
if (label >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*label = c;
|
*label = c;
|
if (c != 0) {
|
if (c != 0) {
|
if (bp >= eom) {
|
if (bp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*bp++ = 0;
|
*bp++ = 0;
|
}
|
}
|
if ((bp - dst) > MAXCDNAME) { /* src too big */
|
if ((bp - dst) > MAXCDNAME) { /* src too big */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
return (0);
|
return (0);
|
}
|
}
|
|
|
/*
|
/*
|
* ns_name_ntol(src, dst, dstsiz)
|
* ns_name_ntol(src, dst, dstsiz)
|
* Convert a network strings labels into all lowercase.
|
* Convert a network strings labels into all lowercase.
|
* return:
|
* return:
|
* Number of bytes written to buffer, or -1 (with errno set)
|
* Number of bytes written to buffer, or -1 (with errno set)
|
* notes:
|
* notes:
|
* Enforces label and domain length limits.
|
* Enforces label and domain length limits.
|
*/
|
*/
|
|
|
int
|
int
|
ns_name_ntol(const u_char *src, u_char *dst, size_t dstsiz) {
|
ns_name_ntol(const u_char *src, u_char *dst, size_t dstsiz) {
|
const u_char *cp;
|
const u_char *cp;
|
u_char *dn, *eom;
|
u_char *dn, *eom;
|
u_char c;
|
u_char c;
|
u_int n;
|
u_int n;
|
|
|
cp = src;
|
cp = src;
|
dn = dst;
|
dn = dst;
|
eom = dst + dstsiz;
|
eom = dst + dstsiz;
|
|
|
while ((n = *cp++) != 0) {
|
while ((n = *cp++) != 0) {
|
if ((n & NS_CMPRSFLGS) != 0) {
|
if ((n & NS_CMPRSFLGS) != 0) {
|
/* Some kind of compression pointer. */
|
/* Some kind of compression pointer. */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dn++ = n;
|
*dn++ = n;
|
if (dn + n >= eom) {
|
if (dn + n >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
for ((void)NULL; n > 0; n--) {
|
for ((void)NULL; n > 0; n--) {
|
c = *cp++;
|
c = *cp++;
|
if (isupper(c))
|
if (isupper(c))
|
*dn++ = tolower(c);
|
*dn++ = tolower(c);
|
else
|
else
|
*dn++ = c;
|
*dn++ = c;
|
}
|
}
|
}
|
}
|
*dn++ = '\0';
|
*dn++ = '\0';
|
return (dn - dst);
|
return (dn - dst);
|
}
|
}
|
|
|
/*
|
/*
|
* ns_name_unpack(msg, eom, src, dst, dstsiz)
|
* ns_name_unpack(msg, eom, src, dst, dstsiz)
|
* Unpack a domain name from a message, source may be compressed.
|
* Unpack a domain name from a message, source may be compressed.
|
* return:
|
* return:
|
* -1 if it fails, or consumed octets if it succeeds.
|
* -1 if it fails, or consumed octets if it succeeds.
|
*/
|
*/
|
int
|
int
|
ns_name_unpack(const u_char *msg, const u_char *eom, const u_char *src,
|
ns_name_unpack(const u_char *msg, const u_char *eom, const u_char *src,
|
u_char *dst, size_t dstsiz)
|
u_char *dst, size_t dstsiz)
|
{
|
{
|
const u_char *srcp, *dstlim;
|
const u_char *srcp, *dstlim;
|
u_char *dstp;
|
u_char *dstp;
|
int n, len, checked;
|
int n, len, checked;
|
|
|
len = -1;
|
len = -1;
|
checked = 0;
|
checked = 0;
|
dstp = dst;
|
dstp = dst;
|
srcp = src;
|
srcp = src;
|
dstlim = dst + dstsiz;
|
dstlim = dst + dstsiz;
|
if (srcp < msg || srcp >= eom) {
|
if (srcp < msg || srcp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
/* Fetch next label in domain name. */
|
/* Fetch next label in domain name. */
|
while ((n = *srcp++) != 0) {
|
while ((n = *srcp++) != 0) {
|
/* Check for indirection. */
|
/* Check for indirection. */
|
switch (n & NS_CMPRSFLGS) {
|
switch (n & NS_CMPRSFLGS) {
|
case 0x40:
|
case 0x40:
|
if (n == 0x41) {
|
if (n == 0x41) {
|
if (dstp + 1 >= dstlim) {
|
if (dstp + 1 >= dstlim) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*dstp++ = 0x41;
|
*dstp++ = 0x41;
|
n = *srcp++ / 8;
|
n = *srcp++ / 8;
|
++checked;
|
++checked;
|
} else {
|
} else {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1); /* flag error */
|
return (-1); /* flag error */
|
}
|
}
|
/* FALLTHROUGH */
|
/* FALLTHROUGH */
|
case 0:
|
case 0:
|
/* Limit checks. */
|
/* Limit checks. */
|
if (dstp + n + 1 >= dstlim || srcp + n >= eom) {
|
if (dstp + n + 1 >= dstlim || srcp + n >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
checked += n + 1;
|
checked += n + 1;
|
dstp = mempcpy(dstp, srcp - 1, n + 1);
|
dstp = mempcpy(dstp, srcp - 1, n + 1);
|
srcp += n;
|
srcp += n;
|
break;
|
break;
|
|
|
case NS_CMPRSFLGS:
|
case NS_CMPRSFLGS:
|
if (srcp >= eom) {
|
if (srcp >= eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
if (len < 0)
|
if (len < 0)
|
len = srcp - src + 1;
|
len = srcp - src + 1;
|
srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff));
|
srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff));
|
if (srcp < msg || srcp >= eom) { /* Out of range. */
|
if (srcp < msg || srcp >= eom) { /* Out of range. */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
checked += 2;
|
checked += 2;
|
/*
|
/*
|
* Check for loops in the compressed name;
|
* Check for loops in the compressed name;
|
* if we've looked at the whole message,
|
* if we've looked at the whole message,
|
* there must be a loop.
|
* there must be a loop.
|
*/
|
*/
|
if (checked >= eom - msg) {
|
if (checked >= eom - msg) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
break;
|
break;
|
|
|
default:
|
default:
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1); /* flag error */
|
return (-1); /* flag error */
|
}
|
}
|
}
|
}
|
*dstp = '\0';
|
*dstp = '\0';
|
if (len < 0)
|
if (len < 0)
|
len = srcp - src;
|
len = srcp - src;
|
return (len);
|
return (len);
|
}
|
}
|
libresolv_hidden_def (ns_name_unpack)
|
libresolv_hidden_def (ns_name_unpack)
|
|
|
/*
|
/*
|
* ns_name_pack(src, dst, dstsiz, dnptrs, lastdnptr)
|
* ns_name_pack(src, dst, dstsiz, dnptrs, lastdnptr)
|
* Pack domain name 'domain' into 'comp_dn'.
|
* Pack domain name 'domain' into 'comp_dn'.
|
* return:
|
* return:
|
* Size of the compressed name, or -1.
|
* Size of the compressed name, or -1.
|
* notes:
|
* notes:
|
* 'dnptrs' is an array of pointers to previous compressed names.
|
* 'dnptrs' is an array of pointers to previous compressed names.
|
* dnptrs[0] is a pointer to the beginning of the message. The array
|
* dnptrs[0] is a pointer to the beginning of the message. The array
|
* ends with NULL.
|
* ends with NULL.
|
* 'lastdnptr' is a pointer to the end of the array pointed to
|
* 'lastdnptr' is a pointer to the end of the array pointed to
|
* by 'dnptrs'.
|
* by 'dnptrs'.
|
* Side effects:
|
* Side effects:
|
* The list of pointers in dnptrs is updated for labels inserted into
|
* The list of pointers in dnptrs is updated for labels inserted into
|
* the message as we compress the name. If 'dnptr' is NULL, we don't
|
* the message as we compress the name. If 'dnptr' is NULL, we don't
|
* try to compress names. If 'lastdnptr' is NULL, we don't update the
|
* try to compress names. If 'lastdnptr' is NULL, we don't update the
|
* list.
|
* list.
|
*/
|
*/
|
int
|
int
|
ns_name_pack(const u_char *src, u_char *dst, int dstsiz,
|
ns_name_pack(const u_char *src, u_char *dst, int dstsiz,
|
const u_char **dnptrs, const u_char **lastdnptr)
|
const u_char **dnptrs, const u_char **lastdnptr)
|
{
|
{
|
u_char *dstp;
|
u_char *dstp;
|
const u_char **cpp, **lpp, *eob, *msg;
|
const u_char **cpp, **lpp, *eob, *msg;
|
const u_char *srcp;
|
const u_char *srcp;
|
int n, l, first = 1;
|
int n, l, first = 1;
|
|
|
srcp = src;
|
srcp = src;
|
dstp = dst;
|
dstp = dst;
|
eob = dstp + dstsiz;
|
eob = dstp + dstsiz;
|
lpp = cpp = NULL;
|
lpp = cpp = NULL;
|
if (dnptrs != NULL) {
|
if (dnptrs != NULL) {
|
if ((msg = *dnptrs++) != NULL) {
|
if ((msg = *dnptrs++) != NULL) {
|
for (cpp = dnptrs; *cpp != NULL; cpp++)
|
for (cpp = dnptrs; *cpp != NULL; cpp++)
|
(void)NULL;
|
(void)NULL;
|
lpp = cpp; /* end of list to search */
|
lpp = cpp; /* end of list to search */
|
}
|
}
|
} else
|
} else
|
msg = NULL;
|
msg = NULL;
|
|
|
/* make sure the domain we are about to add is legal */
|
/* make sure the domain we are about to add is legal */
|
l = 0;
|
l = 0;
|
do {
|
do {
|
n = *srcp;
|
n = *srcp;
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) {
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
if (n == 0x41)
|
if (n == 0x41)
|
n = *++srcp / 8;
|
n = *++srcp / 8;
|
l += n + 1;
|
l += n + 1;
|
if (l > MAXCDNAME) {
|
if (l > MAXCDNAME) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
srcp += n + 1;
|
srcp += n + 1;
|
} while (n != 0);
|
} while (n != 0);
|
|
|
/* from here on we need to reset compression pointer array on error */
|
/* from here on we need to reset compression pointer array on error */
|
srcp = src;
|
srcp = src;
|
do {
|
do {
|
/* Look to see if we can use pointers. */
|
/* Look to see if we can use pointers. */
|
n = *srcp;
|
n = *srcp;
|
if (n != 0 && n != 0x41 && msg != NULL) {
|
if (n != 0 && n != 0x41 && msg != NULL) {
|
l = dn_find(srcp, msg, (const u_char * const *)dnptrs,
|
l = dn_find(srcp, msg, (const u_char * const *)dnptrs,
|
(const u_char * const *)lpp);
|
(const u_char * const *)lpp);
|
if (l >= 0) {
|
if (l >= 0) {
|
if (dstp + 1 >= eob) {
|
if (dstp + 1 >= eob) {
|
goto cleanup;
|
goto cleanup;
|
}
|
}
|
*dstp++ = (l >> 8) | NS_CMPRSFLGS;
|
*dstp++ = (l >> 8) | NS_CMPRSFLGS;
|
*dstp++ = l % 256;
|
*dstp++ = l % 256;
|
return (dstp - dst);
|
return (dstp - dst);
|
}
|
}
|
/* Not found, save it. */
|
/* Not found, save it. */
|
if (lastdnptr != NULL && cpp < lastdnptr - 1 &&
|
if (lastdnptr != NULL && cpp < lastdnptr - 1 &&
|
(dstp - msg) < 0x4000 && first) {
|
(dstp - msg) < 0x4000 && first) {
|
*cpp++ = dstp;
|
*cpp++ = dstp;
|
*cpp = NULL;
|
*cpp = NULL;
|
first = 0;
|
first = 0;
|
}
|
}
|
}
|
}
|
/* copy label to buffer */
|
/* copy label to buffer */
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) { /* Should not happen. */
|
if ((n & NS_CMPRSFLGS) != 0 && n != 0x41) { /* Should not happen. */
|
goto cleanup;
|
goto cleanup;
|
}
|
}
|
if (n == 0x41) {
|
if (n == 0x41) {
|
n = *++srcp / 8;
|
n = *++srcp / 8;
|
if (dstp + 1 >= eob)
|
if (dstp + 1 >= eob)
|
goto cleanup;
|
goto cleanup;
|
*dstp++ = 0x41;
|
*dstp++ = 0x41;
|
}
|
}
|
if (dstp + 1 + n >= eob) {
|
if (dstp + 1 + n >= eob) {
|
goto cleanup;
|
goto cleanup;
|
}
|
}
|
memcpy(dstp, srcp, n + 1);
|
memcpy(dstp, srcp, n + 1);
|
srcp += n + 1;
|
srcp += n + 1;
|
dstp += n + 1;
|
dstp += n + 1;
|
} while (n != 0);
|
} while (n != 0);
|
|
|
if (dstp > eob) {
|
if (dstp > eob) {
|
cleanup:
|
cleanup:
|
if (msg != NULL)
|
if (msg != NULL)
|
*lpp = NULL;
|
*lpp = NULL;
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
return (dstp - dst);
|
return (dstp - dst);
|
}
|
}
|
|
|
/*
|
/*
|
* ns_name_uncompress(msg, eom, src, dst, dstsiz)
|
* ns_name_uncompress(msg, eom, src, dst, dstsiz)
|
* Expand compressed domain name to presentation format.
|
* Expand compressed domain name to presentation format.
|
* return:
|
* return:
|
* Number of bytes read out of `src', or -1 (with errno set).
|
* Number of bytes read out of `src', or -1 (with errno set).
|
* note:
|
* note:
|
* Root domain returns as "." not "".
|
* Root domain returns as "." not "".
|
*/
|
*/
|
int
|
int
|
ns_name_uncompress(const u_char *msg, const u_char *eom, const u_char *src,
|
ns_name_uncompress(const u_char *msg, const u_char *eom, const u_char *src,
|
char *dst, size_t dstsiz)
|
char *dst, size_t dstsiz)
|
{
|
{
|
u_char tmp[NS_MAXCDNAME];
|
u_char tmp[NS_MAXCDNAME];
|
int n;
|
int n;
|
|
|
if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -1)
|
if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -1)
|
return (-1);
|
return (-1);
|
if (ns_name_ntop(tmp, dst, dstsiz) == -1)
|
if (ns_name_ntop(tmp, dst, dstsiz) == -1)
|
return (-1);
|
return (-1);
|
return (n);
|
return (n);
|
}
|
}
|
|
|
/*
|
/*
|
* ns_name_compress(src, dst, dstsiz, dnptrs, lastdnptr)
|
* ns_name_compress(src, dst, dstsiz, dnptrs, lastdnptr)
|
* Compress a domain name into wire format, using compression pointers.
|
* Compress a domain name into wire format, using compression pointers.
|
* return:
|
* return:
|
* Number of bytes consumed in `dst' or -1 (with errno set).
|
* Number of bytes consumed in `dst' or -1 (with errno set).
|
* notes:
|
* notes:
|
* 'dnptrs' is an array of pointers to previous compressed names.
|
* 'dnptrs' is an array of pointers to previous compressed names.
|
* dnptrs[0] is a pointer to the beginning of the message.
|
* dnptrs[0] is a pointer to the beginning of the message.
|
* The list ends with NULL. 'lastdnptr' is a pointer to the end of the
|
* The list ends with NULL. 'lastdnptr' is a pointer to the end of the
|
* array pointed to by 'dnptrs'. Side effect is to update the list of
|
* array pointed to by 'dnptrs'. Side effect is to update the list of
|
* pointers for labels inserted into the message as we compress the name.
|
* pointers for labels inserted into the message as we compress the name.
|
* If 'dnptr' is NULL, we don't try to compress names. If 'lastdnptr'
|
* If 'dnptr' is NULL, we don't try to compress names. If 'lastdnptr'
|
* is NULL, we don't update the list.
|
* is NULL, we don't update the list.
|
*/
|
*/
|
int
|
int
|
ns_name_compress(const char *src, u_char *dst, size_t dstsiz,
|
ns_name_compress(const char *src, u_char *dst, size_t dstsiz,
|
const u_char **dnptrs, const u_char **lastdnptr)
|
const u_char **dnptrs, const u_char **lastdnptr)
|
{
|
{
|
u_char tmp[NS_MAXCDNAME];
|
u_char tmp[NS_MAXCDNAME];
|
|
|
if (ns_name_pton(src, tmp, sizeof tmp) == -1)
|
if (ns_name_pton(src, tmp, sizeof tmp) == -1)
|
return (-1);
|
return (-1);
|
return (ns_name_pack(tmp, dst, dstsiz, dnptrs, lastdnptr));
|
return (ns_name_pack(tmp, dst, dstsiz, dnptrs, lastdnptr));
|
}
|
}
|
|
|
/*
|
/*
|
* Reset dnptrs so that there are no active references to pointers at or
|
* Reset dnptrs so that there are no active references to pointers at or
|
* after src.
|
* after src.
|
*/
|
*/
|
void
|
void
|
ns_name_rollback(const u_char *src, const u_char **dnptrs,
|
ns_name_rollback(const u_char *src, const u_char **dnptrs,
|
const u_char **lastdnptr)
|
const u_char **lastdnptr)
|
{
|
{
|
while (dnptrs < lastdnptr && *dnptrs != NULL) {
|
while (dnptrs < lastdnptr && *dnptrs != NULL) {
|
if (*dnptrs >= src) {
|
if (*dnptrs >= src) {
|
*dnptrs = NULL;
|
*dnptrs = NULL;
|
break;
|
break;
|
}
|
}
|
dnptrs++;
|
dnptrs++;
|
}
|
}
|
}
|
}
|
|
|
/*
|
/*
|
* ns_name_skip(ptrptr, eom)
|
* ns_name_skip(ptrptr, eom)
|
* Advance *ptrptr to skip over the compressed name it points at.
|
* Advance *ptrptr to skip over the compressed name it points at.
|
* return:
|
* return:
|
* 0 on success, -1 (with errno set) on failure.
|
* 0 on success, -1 (with errno set) on failure.
|
*/
|
*/
|
int
|
int
|
ns_name_skip(const u_char **ptrptr, const u_char *eom) {
|
ns_name_skip(const u_char **ptrptr, const u_char *eom) {
|
const u_char *cp;
|
const u_char *cp;
|
u_int n;
|
u_int n;
|
|
|
cp = *ptrptr;
|
cp = *ptrptr;
|
while (cp < eom && (n = *cp++) != 0) {
|
while (cp < eom && (n = *cp++) != 0) {
|
/* Check for indirection. */
|
/* Check for indirection. */
|
switch (n & NS_CMPRSFLGS) {
|
switch (n & NS_CMPRSFLGS) {
|
case 0: /* normal case, n == len */
|
case 0: /* normal case, n == len */
|
cp += n;
|
cp += n;
|
continue;
|
continue;
|
case NS_CMPRSFLGS: /* indirection */
|
case NS_CMPRSFLGS: /* indirection */
|
cp++;
|
cp++;
|
break;
|
break;
|
default: /* illegal type */
|
default: /* illegal type */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
break;
|
break;
|
}
|
}
|
if (cp > eom) {
|
if (cp > eom) {
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
*ptrptr = cp;
|
*ptrptr = cp;
|
return (0);
|
return (0);
|
}
|
}
|
|
|
/* Private. */
|
/* Private. */
|
|
|
/*
|
/*
|
* special(ch)
|
* special(ch)
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* is this characted special ("in need of quoting") ?
|
* is this characted special ("in need of quoting") ?
|
* return:
|
* return:
|
* boolean.
|
* boolean.
|
*/
|
*/
|
static int
|
static int
|
special(int ch) {
|
special(int ch) {
|
switch (ch) {
|
switch (ch) {
|
case 0x22: /* '"' */
|
case 0x22: /* '"' */
|
case 0x2E: /* '.' */
|
case 0x2E: /* '.' */
|
case 0x3B: /* ';' */
|
case 0x3B: /* ';' */
|
case 0x5C: /* '\\' */
|
case 0x5C: /* '\\' */
|
/* Special modifiers in zone files. */
|
/* Special modifiers in zone files. */
|
case 0x40: /* '@' */
|
case 0x40: /* '@' */
|
case 0x24: /* '$' */
|
case 0x24: /* '$' */
|
return (1);
|
return (1);
|
default:
|
default:
|
return (0);
|
return (0);
|
}
|
}
|
}
|
}
|
|
|
/*
|
/*
|
* printable(ch)
|
* printable(ch)
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* is this character visible and not a space when printed ?
|
* is this character visible and not a space when printed ?
|
* return:
|
* return:
|
* boolean.
|
* boolean.
|
*/
|
*/
|
static int
|
static int
|
printable(int ch) {
|
printable(int ch) {
|
return (ch > 0x20 && ch < 0x7f);
|
return (ch > 0x20 && ch < 0x7f);
|
}
|
}
|
|
|
/*
|
/*
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* Thinking in noninternationalized USASCII (per the DNS spec),
|
* convert this character to lower case if it's upper case.
|
* convert this character to lower case if it's upper case.
|
*/
|
*/
|
static int
|
static int
|
mklower(int ch) {
|
mklower(int ch) {
|
if (ch >= 0x41 && ch <= 0x5A)
|
if (ch >= 0x41 && ch <= 0x5A)
|
return (ch + 0x20);
|
return (ch + 0x20);
|
return (ch);
|
return (ch);
|
}
|
}
|
|
|
/*
|
/*
|
* dn_find(domain, msg, dnptrs, lastdnptr)
|
* dn_find(domain, msg, dnptrs, lastdnptr)
|
* Search for the counted-label name in an array of compressed names.
|
* Search for the counted-label name in an array of compressed names.
|
* return:
|
* return:
|
* offset from msg if found, or -1.
|
* offset from msg if found, or -1.
|
* notes:
|
* notes:
|
* dnptrs is the pointer to the first name on the list,
|
* dnptrs is the pointer to the first name on the list,
|
* not the pointer to the start of the message.
|
* not the pointer to the start of the message.
|
*/
|
*/
|
static int
|
static int
|
dn_find(const u_char *domain, const u_char *msg,
|
dn_find(const u_char *domain, const u_char *msg,
|
const u_char * const *dnptrs,
|
const u_char * const *dnptrs,
|
const u_char * const *lastdnptr)
|
const u_char * const *lastdnptr)
|
{
|
{
|
const u_char *dn, *cp, *sp;
|
const u_char *dn, *cp, *sp;
|
const u_char * const *cpp;
|
const u_char * const *cpp;
|
u_int n;
|
u_int n;
|
|
|
for (cpp = dnptrs; cpp < lastdnptr; cpp++) {
|
for (cpp = dnptrs; cpp < lastdnptr; cpp++) {
|
sp = *cpp;
|
sp = *cpp;
|
/*
|
/*
|
* terminate search on:
|
* terminate search on:
|
* root label
|
* root label
|
* compression pointer
|
* compression pointer
|
* unusable offset
|
* unusable offset
|
*/
|
*/
|
while (*sp != 0 && (*sp & NS_CMPRSFLGS) == 0 &&
|
while (*sp != 0 && (*sp & NS_CMPRSFLGS) == 0 &&
|
(sp - msg) < 0x4000) {
|
(sp - msg) < 0x4000) {
|
dn = domain;
|
dn = domain;
|
cp = sp;
|
cp = sp;
|
while ((n = *cp++) != 0) {
|
while ((n = *cp++) != 0) {
|
/*
|
/*
|
* check for indirection
|
* check for indirection
|
*/
|
*/
|
switch (n & NS_CMPRSFLGS) {
|
switch (n & NS_CMPRSFLGS) {
|
case 0: /* normal case, n == len */
|
case 0: /* normal case, n == len */
|
if (n != *dn++)
|
if (n != *dn++)
|
goto next;
|
goto next;
|
for ((void)NULL; n > 0; n--)
|
for ((void)NULL; n > 0; n--)
|
if (mklower(*dn++) !=
|
if (mklower(*dn++) !=
|
mklower(*cp++))
|
mklower(*cp++))
|
goto next;
|
goto next;
|
/* Is next root for both ? */
|
/* Is next root for both ? */
|
if (*dn == '\0' && *cp == '\0')
|
if (*dn == '\0' && *cp == '\0')
|
return (sp - msg);
|
return (sp - msg);
|
if (*dn)
|
if (*dn)
|
continue;
|
continue;
|
goto next;
|
goto next;
|
|
|
case NS_CMPRSFLGS: /* indirection */
|
case NS_CMPRSFLGS: /* indirection */
|
cp = msg + (((n & 0x3f) << 8) | *cp);
|
cp = msg + (((n & 0x3f) << 8) | *cp);
|
break;
|
break;
|
|
|
default: /* illegal type */
|
default: /* illegal type */
|
__set_errno (EMSGSIZE);
|
__set_errno (EMSGSIZE);
|
return (-1);
|
return (-1);
|
}
|
}
|
}
|
}
|
next:
|
next:
|
sp += *sp + 1;
|
sp += *sp + 1;
|
}
|
}
|
}
|
}
|
__set_errno (ENOENT);
|
__set_errno (ENOENT);
|
return (-1);
|
return (-1);
|
}
|
}
|
|
|
