1998-12-12 20:48:14 +00:00
|
|
|
/*
|
1999-01-04 19:47:40 +00:00
|
|
|
* Copyright (C) 1998, 1999 Internet Software Consortium.
|
1998-12-12 20:48:14 +00:00
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
|
|
* copyright notice and this permission notice appear in all copies.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
|
|
|
|
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
|
|
|
|
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
|
|
* 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
|
|
|
|
* SOFTWARE.
|
|
|
|
*/
|
1998-12-12 19:25:20 +00:00
|
|
|
|
|
|
|
#include <config.h>
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
#include <ctype.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include <isc/assertions.h>
|
1999-01-06 05:41:20 +00:00
|
|
|
#include <isc/error.h>
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
#include <dns/types.h>
|
|
|
|
#include <dns/result.h>
|
|
|
|
#include <dns/name.h>
|
1999-01-06 20:04:41 +00:00
|
|
|
#include <dns/compress.h>
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
#define NAME_MAGIC 0x444E536EU /* DNSn. */
|
|
|
|
#define VALID_NAME(n) ((n) != NULL && \
|
|
|
|
(n)->magic == NAME_MAGIC)
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
typedef enum {
|
1999-01-06 05:41:20 +00:00
|
|
|
ft_init = 0,
|
|
|
|
ft_start,
|
|
|
|
ft_ordinary,
|
|
|
|
ft_initialescape,
|
|
|
|
ft_escape,
|
|
|
|
ft_escdecimal,
|
|
|
|
ft_bitstring,
|
|
|
|
ft_binary,
|
|
|
|
ft_octal,
|
|
|
|
ft_hex,
|
|
|
|
ft_dottedquad,
|
|
|
|
ft_dqdecimal,
|
|
|
|
ft_maybeslash,
|
|
|
|
ft_finishbitstring,
|
|
|
|
ft_bitlength,
|
1999-01-27 23:39:40 +00:00
|
|
|
ft_eatdot,
|
|
|
|
ft_at
|
1999-01-06 05:41:20 +00:00
|
|
|
} ft_state;
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
fw_start = 0,
|
|
|
|
fw_ordinary,
|
|
|
|
fw_copy,
|
|
|
|
fw_bitstring,
|
|
|
|
fw_newcurrent,
|
|
|
|
fw_local
|
|
|
|
} fw_state;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
static char digitvalue[256] = {
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*16*/
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*32*/
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*48*/
|
|
|
|
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, -1, -1, -1, -1, -1, /*64*/
|
|
|
|
-1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*80*/
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*96*/
|
|
|
|
-1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*112*/
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*128*/
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
|
|
|
|
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /*256*/
|
|
|
|
};
|
|
|
|
|
|
|
|
static char hexdigits[16] = {
|
|
|
|
'0', '1', '2', '3', '4', '5', '6', '7',
|
|
|
|
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F'
|
|
|
|
};
|
|
|
|
|
|
|
|
static unsigned char maptolower[] = {
|
|
|
|
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
|
|
|
|
0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f,
|
|
|
|
0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17,
|
|
|
|
0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,
|
|
|
|
0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27,
|
|
|
|
0x28, 0x29, 0x2a, 0x2b, 0x2c, 0x2d, 0x2e, 0x2f,
|
|
|
|
0x30, 0x31, 0x32, 0x33, 0x34, 0x35, 0x36, 0x37,
|
|
|
|
0x38, 0x39, 0x3a, 0x3b, 0x3c, 0x3d, 0x3e, 0x3f,
|
|
|
|
0x40, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
|
|
|
|
0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f,
|
|
|
|
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
|
|
|
|
0x78, 0x79, 0x7a, 0x5b, 0x5c, 0x5d, 0x5e, 0x5f,
|
|
|
|
0x60, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67,
|
|
|
|
0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e, 0x6f,
|
|
|
|
0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76, 0x77,
|
|
|
|
0x78, 0x79, 0x7a, 0x7b, 0x7c, 0x7d, 0x7e, 0x7f,
|
|
|
|
0x80, 0x81, 0x82, 0x83, 0x84, 0x85, 0x86, 0x87,
|
|
|
|
0x88, 0x89, 0x8a, 0x8b, 0x8c, 0x8d, 0x8e, 0x8f,
|
|
|
|
0x90, 0x91, 0x92, 0x93, 0x94, 0x95, 0x96, 0x97,
|
|
|
|
0x98, 0x99, 0x9a, 0x9b, 0x9c, 0x9d, 0x9e, 0x9f,
|
|
|
|
0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5, 0xa6, 0xa7,
|
|
|
|
0xa8, 0xa9, 0xaa, 0xab, 0xac, 0xad, 0xae, 0xaf,
|
|
|
|
0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7,
|
|
|
|
0xb8, 0xb9, 0xba, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf,
|
|
|
|
0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7,
|
|
|
|
0xc8, 0xc9, 0xca, 0xcb, 0xcc, 0xcd, 0xce, 0xcf,
|
|
|
|
0xd0, 0xd1, 0xd2, 0xd3, 0xd4, 0xd5, 0xd6, 0xd7,
|
|
|
|
0xd8, 0xd9, 0xda, 0xdb, 0xdc, 0xdd, 0xde, 0xdf,
|
|
|
|
0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7,
|
|
|
|
0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef,
|
|
|
|
0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7,
|
|
|
|
0xf8, 0xf9, 0xfa, 0xfb, 0xfc, 0xfd, 0xfe, 0xff
|
|
|
|
};
|
|
|
|
|
1998-12-05 01:42:30 +00:00
|
|
|
#define CONVERTTOASCII(c)
|
|
|
|
#define CONVERTFROMASCII(c)
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
#define INIT_OFFSETS(name, var, default) \
|
|
|
|
if (name->offsets != NULL) \
|
|
|
|
var = name->offsets; \
|
|
|
|
else \
|
|
|
|
var = default;
|
|
|
|
|
|
|
|
#define SETUP_OFFSETS(name, var, default) \
|
|
|
|
if (name->offsets != NULL) \
|
|
|
|
var = name->offsets; \
|
|
|
|
else { \
|
|
|
|
var = default; \
|
1999-02-06 01:26:00 +00:00
|
|
|
set_offsets(name, var, ISC_FALSE, ISC_FALSE, ISC_FALSE); \
|
1999-01-09 00:33:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct dns_name root = {
|
|
|
|
NAME_MAGIC,
|
1999-03-08 18:55:28 +00:00
|
|
|
(unsigned char *)"", 1, 1, DNS_NAMEATTR_ABSOLUTE, NULL, NULL,
|
1999-01-13 19:17:22 +00:00
|
|
|
{(void *)-1, (void *)-1},
|
|
|
|
{NULL, NULL}
|
1999-01-09 00:33:15 +00:00
|
|
|
};
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_t *dns_rootname = &root;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
static void set_offsets(dns_name_t *name, unsigned char *offsets,
|
1999-02-06 01:26:00 +00:00
|
|
|
isc_boolean_t set_labels, isc_boolean_t set_length,
|
|
|
|
isc_boolean_t set_absolute);
|
1999-01-09 00:33:15 +00:00
|
|
|
static void compact(dns_name_t *name, unsigned char *offsets);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1998-12-05 01:42:30 +00:00
|
|
|
/*
|
|
|
|
* Yes, get_bit and set_bit are lame. We define them here so they can
|
|
|
|
* be inlined by smart compilers.
|
|
|
|
*/
|
|
|
|
|
|
|
|
static unsigned int
|
|
|
|
get_bit(unsigned char *array, unsigned int index) {
|
|
|
|
unsigned int byte, shift;
|
|
|
|
|
|
|
|
byte = array[index / 8];
|
|
|
|
shift = 7 - (index % 8);
|
|
|
|
|
|
|
|
return ((byte >> shift) & 0x01);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
set_bit(unsigned char *array, unsigned int index, unsigned int bit) {
|
|
|
|
unsigned int byte, shift, mask;
|
|
|
|
|
|
|
|
byte = array[index / 8];
|
|
|
|
shift = 7 - (index % 8);
|
|
|
|
mask = 1 << shift;
|
|
|
|
|
|
|
|
if (bit)
|
|
|
|
array[index / 8] |= mask;
|
|
|
|
else
|
|
|
|
array[index / 8] &= (~mask & 0xFF);
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
dns_labeltype_t
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_label_type(dns_label_t *label) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Get the type of 'label'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(label != NULL);
|
|
|
|
REQUIRE(label->length > 0);
|
|
|
|
REQUIRE(label->base[0] <= 63 ||
|
|
|
|
label->base[0] == DNS_LABELTYPE_BITSTRING);
|
|
|
|
|
|
|
|
if (label->base[0] <= 63)
|
|
|
|
return (dns_labeltype_ordinary);
|
|
|
|
else
|
|
|
|
return (dns_labeltype_bitstring);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_label_countbits(dns_label_t *label) {
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int count;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The number of bits in a bitstring label.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(label != NULL);
|
|
|
|
REQUIRE(label->length > 2);
|
|
|
|
REQUIRE(label->base[0] == DNS_LABELTYPE_BITSTRING);
|
|
|
|
|
|
|
|
count = label->base[1];
|
|
|
|
if (count == 0)
|
|
|
|
count = 256;
|
|
|
|
|
|
|
|
return (count);
|
|
|
|
}
|
|
|
|
|
|
|
|
dns_bitlabel_t
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_label_getbit(dns_label_t *label, unsigned int n) {
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int count, bit;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The 'n'th most significant bit of 'label'.
|
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* Numbering starts at 0.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(label != NULL);
|
|
|
|
REQUIRE(label->length > 2);
|
|
|
|
REQUIRE(label->base[0] == DNS_LABELTYPE_BITSTRING);
|
|
|
|
|
|
|
|
count = label->base[1];
|
|
|
|
if (count == 0)
|
|
|
|
count = 256;
|
|
|
|
|
|
|
|
REQUIRE(n < count);
|
|
|
|
|
|
|
|
bit = get_bit(&label->base[2], n);
|
|
|
|
if (bit == 0)
|
|
|
|
return (dns_bitlabel_0);
|
|
|
|
return (dns_bitlabel_1);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1999-01-09 00:33:15 +00:00
|
|
|
dns_name_init(dns_name_t *name, unsigned char *offsets) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Make 'name' empty.
|
|
|
|
*/
|
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
name->magic = NAME_MAGIC;
|
|
|
|
name->ndata = NULL;
|
|
|
|
name->length = 0;
|
|
|
|
name->labels = 0;
|
1999-02-06 01:26:00 +00:00
|
|
|
name->attributes = 0;
|
1999-01-09 00:33:15 +00:00
|
|
|
name->offsets = offsets;
|
1999-03-08 18:55:28 +00:00
|
|
|
name->buffer = NULL;
|
1999-01-09 00:33:15 +00:00
|
|
|
ISC_LINK_INIT(name, link);
|
1999-01-13 19:17:22 +00:00
|
|
|
ISC_LIST_INIT(name->list);
|
1999-01-06 05:41:20 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
dns_name_invalidate(dns_name_t *name) {
|
|
|
|
/*
|
|
|
|
* Make 'name' invalid.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
|
|
|
|
name->magic = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
name->ndata = NULL;
|
|
|
|
name->length = 0;
|
|
|
|
name->labels = 0;
|
1999-02-06 01:26:00 +00:00
|
|
|
name->attributes = 0;
|
1999-01-09 00:33:15 +00:00
|
|
|
name->offsets = NULL;
|
1999-03-08 18:55:28 +00:00
|
|
|
name->buffer = NULL;
|
1999-01-09 00:33:15 +00:00
|
|
|
ISC_LINK_INIT(name, link);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
void
|
|
|
|
dns_name_setbuffer(dns_name_t *name, isc_buffer_t *buffer) {
|
|
|
|
/*
|
|
|
|
* Dedicate a binary buffer for use with 'name'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
REQUIRE(name->buffer == NULL);
|
|
|
|
REQUIRE(isc_buffer_type(buffer) == ISC_BUFFERTYPE_BINARY);
|
|
|
|
|
|
|
|
name->buffer = buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
isc_boolean_t
|
|
|
|
dns_name_hasbuffer(dns_name_t *name) {
|
|
|
|
/*
|
|
|
|
* Does 'name' have a dedicated buffer?
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
|
|
|
|
if (name->buffer != NULL)
|
|
|
|
return (ISC_TRUE);
|
|
|
|
|
|
|
|
return (ISC_FALSE);
|
|
|
|
}
|
|
|
|
|
1999-01-04 19:14:00 +00:00
|
|
|
isc_boolean_t
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_isabsolute(dns_name_t *name) {
|
1999-01-09 00:33:15 +00:00
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Does 'name' end in the root label?
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(name->labels > 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-02-06 01:26:00 +00:00
|
|
|
if ((name->attributes & DNS_NAMEATTR_ABSOLUTE) != 0)
|
1999-01-04 19:14:00 +00:00
|
|
|
return (ISC_TRUE);
|
|
|
|
return (ISC_FALSE);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
1999-01-28 23:52:00 +00:00
|
|
|
unsigned int
|
1999-02-06 00:03:19 +00:00
|
|
|
dns_name_hash(dns_name_t *name, isc_boolean_t case_sensitive) {
|
1999-01-28 23:52:00 +00:00
|
|
|
unsigned int length;
|
1999-02-02 01:28:48 +00:00
|
|
|
const unsigned char *s;
|
1999-01-28 23:52:00 +00:00
|
|
|
unsigned int h = 0;
|
|
|
|
unsigned int g;
|
1999-02-06 00:03:19 +00:00
|
|
|
unsigned char c;
|
1999-01-28 23:52:00 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Provide a hash value for 'name'.
|
|
|
|
*/
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
|
|
|
|
if (name->labels == 0)
|
|
|
|
return (0);
|
|
|
|
length = name->length;
|
|
|
|
if (length > 16)
|
|
|
|
length = 16;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* P. J. Weinberger's hash function, adapted from p. 436 of
|
|
|
|
* _Compilers: Principles, Techniques, and Tools_, Aho, Sethi
|
|
|
|
* and Ullman, Addison-Wesley, 1986, ISBN 0-201-10088-6.
|
|
|
|
*/
|
|
|
|
|
|
|
|
s = name->ndata;
|
1999-02-06 00:03:19 +00:00
|
|
|
if (case_sensitive) {
|
|
|
|
while (length > 0) {
|
|
|
|
h = ( h << 4 ) + *s;
|
|
|
|
if ((g = ( h & 0xf0000000 )) != 0) {
|
|
|
|
h = h ^ (g >> 24);
|
|
|
|
h = h ^ g;
|
|
|
|
}
|
|
|
|
s++;
|
|
|
|
length--;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
while (length > 0) {
|
|
|
|
c = maptolower[*s];
|
|
|
|
h = ( h << 4 ) + c;
|
|
|
|
if ((g = ( h & 0xf0000000 )) != 0) {
|
|
|
|
h = h ^ (g >> 24);
|
|
|
|
h = h ^ g;
|
|
|
|
}
|
|
|
|
s++;
|
|
|
|
length--;
|
1999-01-28 23:52:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (h);
|
|
|
|
}
|
|
|
|
|
1999-02-16 08:18:44 +00:00
|
|
|
dns_namereln_t
|
|
|
|
dns_name_fullcompare(dns_name_t *name1, dns_name_t *name2,
|
|
|
|
int *orderp,
|
|
|
|
unsigned int *nlabelsp, unsigned int *nbitsp)
|
|
|
|
{
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int l1, l2, l, count1, count2, count;
|
1999-02-16 08:18:44 +00:00
|
|
|
unsigned int b1, b2, n, nlabels, nbits;
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned char c1, c2;
|
|
|
|
int cdiff, ldiff;
|
|
|
|
unsigned char *label1, *label2;
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets1, *offsets2;
|
|
|
|
dns_offsets_t odata1, odata2;
|
1999-02-16 08:18:44 +00:00
|
|
|
dns_namereln_t namereln = dns_namereln_none;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine the relative ordering under the DNSSEC order relation of
|
1999-02-16 08:18:44 +00:00
|
|
|
* 'name1' and 'name2', and also determine the hierarchical
|
|
|
|
* relationship of the names.
|
|
|
|
*
|
|
|
|
* Note: It makes no sense for one of the names to be relative and the
|
|
|
|
* other absolute. If both names are relative, then to be meaningfully
|
|
|
|
* compared the caller must ensure that they are both relative to the
|
|
|
|
* same domain.
|
1998-12-04 02:27:01 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name1));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(name1->labels > 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
REQUIRE(VALID_NAME(name2));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(name2->labels > 0);
|
1999-02-16 08:18:44 +00:00
|
|
|
REQUIRE(orderp != NULL);
|
|
|
|
REQUIRE(nlabelsp != NULL);
|
|
|
|
REQUIRE(nbitsp != NULL);
|
|
|
|
/*
|
|
|
|
* Either name1 is absolute and name2 is absolute, or neither is.
|
|
|
|
*/
|
|
|
|
REQUIRE(((name1->attributes & DNS_NAMEATTR_ABSOLUTE) ^
|
|
|
|
(name2->attributes & DNS_NAMEATTR_ABSOLUTE)) == 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
SETUP_OFFSETS(name1, offsets1, odata1);
|
|
|
|
SETUP_OFFSETS(name2, offsets2, odata2);
|
|
|
|
|
1999-02-16 08:18:44 +00:00
|
|
|
nlabels = 0;
|
|
|
|
nbits = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
l1 = name1->labels;
|
|
|
|
l2 = name2->labels;
|
|
|
|
if (l1 < l2) {
|
|
|
|
l = l1;
|
|
|
|
ldiff = -1;
|
|
|
|
} else {
|
|
|
|
l = l2;
|
|
|
|
if (l1 > l2)
|
|
|
|
ldiff = 1;
|
|
|
|
else
|
|
|
|
ldiff = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (l > 0) {
|
|
|
|
l--;
|
|
|
|
l1--;
|
|
|
|
l2--;
|
1999-01-09 00:33:15 +00:00
|
|
|
label1 = &name1->ndata[offsets1[l1]];
|
|
|
|
label2 = &name2->ndata[offsets2[l2]];
|
1998-12-04 02:27:01 +00:00
|
|
|
count1 = *label1++;
|
|
|
|
count2 = *label2++;
|
|
|
|
if (count1 <= 63 && count2 <= 63) {
|
|
|
|
if (count1 < count2) {
|
|
|
|
cdiff = -1;
|
|
|
|
count = count1;
|
|
|
|
} else {
|
|
|
|
count = count2;
|
|
|
|
if (count1 > count2)
|
|
|
|
cdiff = 1;
|
|
|
|
else
|
|
|
|
cdiff = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (count > 0) {
|
|
|
|
count--;
|
|
|
|
c1 = maptolower[*label1++];
|
|
|
|
c2 = maptolower[*label2++];
|
1999-02-16 08:18:44 +00:00
|
|
|
if (c1 < c2) {
|
|
|
|
*orderp = -1;
|
|
|
|
goto done;
|
|
|
|
} else if (c1 > c2) {
|
|
|
|
*orderp = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-02-16 08:18:44 +00:00
|
|
|
if (cdiff != 0) {
|
|
|
|
*orderp = cdiff;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
nlabels++;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (count1 == DNS_LABELTYPE_BITSTRING && count2 <= 63) {
|
|
|
|
if (count2 == 0)
|
1999-02-16 08:18:44 +00:00
|
|
|
*orderp = 1;
|
|
|
|
else
|
|
|
|
*orderp = -1;
|
|
|
|
goto done;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (count2 == DNS_LABELTYPE_BITSTRING && count1 <= 63) {
|
|
|
|
if (count1 == 0)
|
1999-02-16 08:18:44 +00:00
|
|
|
*orderp = -1;
|
|
|
|
else
|
|
|
|
*orderp = 1;
|
|
|
|
goto done;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else {
|
|
|
|
INSIST(count1 == DNS_LABELTYPE_BITSTRING &&
|
|
|
|
count2 == DNS_LABELTYPE_BITSTRING);
|
|
|
|
count1 = *label1++;
|
|
|
|
if (count1 == 0)
|
|
|
|
count1 = 256;
|
|
|
|
count2 = *label2++;
|
|
|
|
if (count2 == 0)
|
|
|
|
count2 = 256;
|
|
|
|
if (count1 < count2) {
|
|
|
|
cdiff = -1;
|
|
|
|
count = count1;
|
|
|
|
} else {
|
|
|
|
count = count2;
|
|
|
|
if (count1 > count2)
|
|
|
|
cdiff = 1;
|
|
|
|
else
|
|
|
|
cdiff = 0;
|
|
|
|
}
|
|
|
|
/* Yes, this loop is really slow! */
|
|
|
|
for (n = 0; n < count; n++) {
|
|
|
|
b1 = get_bit(label1, n);
|
|
|
|
b2 = get_bit(label2, n);
|
1999-02-16 08:18:44 +00:00
|
|
|
if (b1 < b2) {
|
|
|
|
*orderp = -1;
|
|
|
|
goto done;
|
|
|
|
} else if (b1 > b2) {
|
|
|
|
*orderp = 1;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (nbits == 0)
|
|
|
|
nlabels++;
|
|
|
|
nbits++;
|
|
|
|
}
|
|
|
|
if (cdiff != 0) {
|
|
|
|
/*
|
|
|
|
* If we're here, then we have two bitstrings
|
|
|
|
* of differing length.
|
|
|
|
*
|
|
|
|
* If the name with the shorter bitstring
|
|
|
|
* has any labels, then it must be greater
|
|
|
|
* than the longer bitstring. This is a bit
|
|
|
|
* counterintuitive. If the name with the
|
|
|
|
* shorter bitstring has any more labels, then
|
|
|
|
* the next label must be an ordinary label.
|
|
|
|
* It can't be a bitstring label because if it
|
|
|
|
* were, then there would be room for it in
|
|
|
|
* the current bitstring label (since all
|
|
|
|
* bitstrings are canonicalized). Since
|
|
|
|
* there's at least one more bit in the
|
|
|
|
* name with the longer bitstring, and since
|
|
|
|
* a bitlabel sorts before any ordinary label,
|
|
|
|
* the name with the longer bitstring must
|
|
|
|
* be lexically before the one with the shorter
|
|
|
|
* bitstring.
|
|
|
|
*
|
|
|
|
* On the other hand, if there are no more
|
|
|
|
* labels in the name with the shorter
|
|
|
|
* bitstring, then that name contains the
|
|
|
|
* other name.
|
|
|
|
*/
|
|
|
|
namereln = dns_namereln_commonancestor;
|
|
|
|
if (cdiff < 0) {
|
|
|
|
if (l1 > 0)
|
|
|
|
*orderp = 1;
|
|
|
|
else {
|
|
|
|
*orderp = -1;
|
|
|
|
namereln =
|
|
|
|
dns_namereln_contains;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (l2 > 0)
|
|
|
|
*orderp = -1;
|
|
|
|
else {
|
|
|
|
*orderp = 1;
|
|
|
|
namereln =
|
|
|
|
dns_namereln_subdomain;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
goto done;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-02-16 08:18:44 +00:00
|
|
|
nbits = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-02-16 08:18:44 +00:00
|
|
|
*orderp = ldiff;
|
|
|
|
if (ldiff < 0)
|
|
|
|
namereln = dns_namereln_contains;
|
|
|
|
else if (ldiff > 0)
|
|
|
|
namereln = dns_namereln_subdomain;
|
|
|
|
else
|
|
|
|
namereln = dns_namereln_equal;
|
|
|
|
|
|
|
|
done:
|
|
|
|
*nlabelsp = nlabels;
|
|
|
|
*nbitsp = nbits;
|
|
|
|
|
|
|
|
if (nlabels > 0 && namereln == dns_namereln_none)
|
|
|
|
namereln = dns_namereln_commonancestor;
|
|
|
|
|
|
|
|
return (namereln);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
dns_name_compare(dns_name_t *name1, dns_name_t *name2) {
|
|
|
|
int order;
|
|
|
|
unsigned int nlabels, nbits;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine the relative ordering under the DNSSEC order relation of
|
|
|
|
* 'name1' and 'name2'.
|
|
|
|
*
|
|
|
|
* Note: It makes no sense for one of the names to be relative and the
|
|
|
|
* other absolute. If both names are relative, then to be meaningfully
|
|
|
|
* compared the caller must ensure that they are both relative to the
|
|
|
|
* same domain.
|
|
|
|
*/
|
|
|
|
|
|
|
|
(void)dns_name_fullcompare(name1, name2, &order, &nlabels, &nbits);
|
|
|
|
|
|
|
|
return (order);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
1999-02-15 05:44:22 +00:00
|
|
|
int
|
|
|
|
dns_name_rdatacompare(dns_name_t *name1, dns_name_t *name2) {
|
|
|
|
unsigned int l1, l2, l, count1, count2, count;
|
|
|
|
unsigned char c1, c2;
|
|
|
|
unsigned char *label1, *label2;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compare two absolute names as rdata.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name1));
|
|
|
|
REQUIRE(name1->labels > 0);
|
|
|
|
REQUIRE((name1->attributes & DNS_NAMEATTR_ABSOLUTE) != 0);
|
|
|
|
REQUIRE(VALID_NAME(name2));
|
|
|
|
REQUIRE(name2->labels > 0);
|
|
|
|
REQUIRE((name2->attributes & DNS_NAMEATTR_ABSOLUTE) != 0);
|
|
|
|
|
|
|
|
l1 = name1->labels;
|
|
|
|
l2 = name2->labels;
|
|
|
|
|
|
|
|
l = (l1 < l2) ? l1 : l2;
|
|
|
|
|
|
|
|
label1 = name1->ndata;
|
|
|
|
label2 = name2->ndata;
|
|
|
|
while (l > 0) {
|
|
|
|
l--;
|
|
|
|
count1 = *label1++;
|
|
|
|
count2 = *label2++;
|
|
|
|
if (count1 <= 63 && count2 <= 63) {
|
|
|
|
if (count1 != count2)
|
|
|
|
return ((count1 < count2) ? -1 : 1);
|
|
|
|
count = count1;
|
|
|
|
while (count > 0) {
|
|
|
|
count--;
|
|
|
|
c1 = maptolower[*label1++];
|
|
|
|
c2 = maptolower[*label2++];
|
|
|
|
if (c1 < c2)
|
|
|
|
return (-1);
|
|
|
|
else if (c1 > c2)
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
} else if (count1 == DNS_LABELTYPE_BITSTRING && count2 <= 63) {
|
|
|
|
return (1);
|
|
|
|
} else if (count2 == DNS_LABELTYPE_BITSTRING && count1 <= 63) {
|
|
|
|
return (-1);
|
|
|
|
} else {
|
|
|
|
INSIST(count1 == DNS_LABELTYPE_BITSTRING &&
|
|
|
|
count2 == DNS_LABELTYPE_BITSTRING);
|
|
|
|
count2 = *label2++;
|
|
|
|
count1 = *label1++;
|
|
|
|
if (count1 != count2)
|
|
|
|
return ((count1 < count2) ? -1 : 1);
|
|
|
|
if (count1 == 0)
|
|
|
|
count1 = 256;
|
|
|
|
if (count2 == 0)
|
|
|
|
count2 = 256;
|
|
|
|
/* number of bytes */
|
|
|
|
count = (count1 + 7) / 8;
|
|
|
|
while (count > 0) {
|
|
|
|
c1 = *label1++;
|
|
|
|
c2 = *label2++;
|
|
|
|
if (c1 != c2)
|
|
|
|
return ((c1 < c2) ? -1 : 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
INSIST(l1 == l2);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1999-01-04 19:14:00 +00:00
|
|
|
isc_boolean_t
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_issubdomain(dns_name_t *name1, dns_name_t *name2) {
|
1999-02-16 08:18:44 +00:00
|
|
|
int order;
|
|
|
|
unsigned int nlabels, nbits;
|
|
|
|
dns_namereln_t namereln;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Is 'name1' a subdomain of 'name2'?
|
|
|
|
*
|
|
|
|
* Note: It makes no sense for one of the names to be relative and the
|
|
|
|
* other absolute. If both names are relative, then to be meaningfully
|
|
|
|
* compared the caller must ensure that they are both relative to the
|
|
|
|
* same domain.
|
|
|
|
*/
|
|
|
|
|
1999-02-16 08:18:44 +00:00
|
|
|
namereln = dns_name_fullcompare(name1, name2, &order, &nlabels,
|
|
|
|
&nbits);
|
|
|
|
if (namereln == dns_namereln_subdomain ||
|
|
|
|
namereln == dns_namereln_equal)
|
|
|
|
return (ISC_TRUE);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-02-16 08:18:44 +00:00
|
|
|
return (ISC_FALSE);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_countlabels(dns_name_t *name) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* How many labels does 'name' have?
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
|
|
|
|
ENSURE(name->labels <= 128);
|
|
|
|
|
|
|
|
return (name->labels);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_getlabel(dns_name_t *name, unsigned int n, dns_label_t *label) {
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Make 'label' refer to the 'n'th least significant label of 'name'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(name->labels > 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
REQUIRE(n < name->labels);
|
|
|
|
REQUIRE(label != NULL);
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
SETUP_OFFSETS(name, offsets, odata);
|
|
|
|
|
|
|
|
label->base = &name->ndata[offsets[n]];
|
1998-12-04 02:27:01 +00:00
|
|
|
if (n == name->labels - 1)
|
1999-01-09 00:33:15 +00:00
|
|
|
label->length = name->length - offsets[n];
|
1998-12-04 02:27:01 +00:00
|
|
|
else
|
1999-01-09 00:33:15 +00:00
|
|
|
label->length = offsets[n + 1] - offsets[n];
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_getlabelsequence(dns_name_t *source,
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int first, unsigned int n,
|
1998-12-13 23:45:21 +00:00
|
|
|
dns_name_t *target)
|
1998-12-04 02:27:01 +00:00
|
|
|
{
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Make 'target' refer to the 'n' labels including and following
|
|
|
|
* 'first' in 'source'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(source));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(source->labels > 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
REQUIRE(n > 0);
|
|
|
|
REQUIRE(first < source->labels);
|
|
|
|
REQUIRE(first + n <= source->labels);
|
1999-02-06 01:26:00 +00:00
|
|
|
REQUIRE((target->attributes & DNS_NAMEATTR_READONLY) == 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
SETUP_OFFSETS(source, offsets, odata);
|
|
|
|
|
|
|
|
target->ndata = &source->ndata[offsets[first]];
|
1999-02-06 01:26:00 +00:00
|
|
|
if (first + n == source->labels) {
|
1999-01-09 00:33:15 +00:00
|
|
|
target->length = source->length - offsets[first];
|
1999-02-06 01:26:00 +00:00
|
|
|
if ((source->attributes & DNS_NAMEATTR_ABSOLUTE) != 0)
|
|
|
|
target->attributes |= DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
else
|
|
|
|
target->attributes &= ~DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
} else {
|
1999-01-09 00:33:15 +00:00
|
|
|
target->length = offsets[first + n] - offsets[first];
|
1999-02-06 01:26:00 +00:00
|
|
|
target->attributes &= ~DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
target->labels = n;
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
if (target->offsets != NULL)
|
1999-02-06 01:26:00 +00:00
|
|
|
set_offsets(target, target->offsets, ISC_FALSE, ISC_FALSE,
|
|
|
|
ISC_FALSE);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1999-01-04 19:14:00 +00:00
|
|
|
dns_name_fromregion(dns_name_t *name, isc_region_t *r) {
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Make 'name' refer to region 'r'.
|
|
|
|
*/
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
REQUIRE(VALID_NAME(name));
|
1998-12-04 02:27:01 +00:00
|
|
|
REQUIRE(r != NULL);
|
|
|
|
REQUIRE(r->length <= 255);
|
1999-02-06 01:26:00 +00:00
|
|
|
REQUIRE((name->attributes & DNS_NAMEATTR_READONLY) == 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
INIT_OFFSETS(name, offsets, odata);
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
name->ndata = r->base;
|
|
|
|
name->length = r->length;
|
|
|
|
|
|
|
|
if (r->length > 0)
|
1999-02-06 01:26:00 +00:00
|
|
|
set_offsets(name, offsets, ISC_TRUE, ISC_TRUE, ISC_TRUE);
|
1999-02-23 02:25:41 +00:00
|
|
|
else {
|
1998-12-04 02:27:01 +00:00
|
|
|
name->labels = 0;
|
1999-02-23 02:25:41 +00:00
|
|
|
name->attributes &= ~DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
1999-01-04 19:14:00 +00:00
|
|
|
dns_name_toregion(dns_name_t *name, isc_region_t *r) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Make 'r' refer to 'name'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
REQUIRE(r != NULL);
|
|
|
|
|
|
|
|
r->base = name->ndata;
|
|
|
|
r->length = name->length;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
dns_result_t
|
1999-01-06 05:41:20 +00:00
|
|
|
dns_name_fromtext(dns_name_t *name, isc_buffer_t *source,
|
1999-01-04 19:14:00 +00:00
|
|
|
dns_name_t *origin, isc_boolean_t downcase,
|
1999-01-06 05:41:20 +00:00
|
|
|
isc_buffer_t *target)
|
1998-12-04 02:27:01 +00:00
|
|
|
{
|
|
|
|
unsigned char *ndata, *label;
|
|
|
|
char *tdata;
|
|
|
|
char c;
|
1999-01-06 05:41:20 +00:00
|
|
|
ft_state state, kind;
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int value, count, tbcount, bitlength, maxlength;
|
1999-01-13 19:17:22 +00:00
|
|
|
unsigned int n1, n2, vlen, tlen, nrem, nused, digits, labels, tused;
|
1999-01-04 19:14:00 +00:00
|
|
|
isc_boolean_t done, saw_bitstring;
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned char dqchars[4];
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert the textual representation of a DNS name at source
|
|
|
|
* into uncompressed wire form stored in target.
|
|
|
|
*
|
|
|
|
* Notes:
|
|
|
|
* Relative domain names will have 'origin' appended to them
|
|
|
|
* unless 'origin' is NULL, in which case relative domain names
|
|
|
|
* will remain relative.
|
|
|
|
*/
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
REQUIRE(VALID_NAME(name));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(isc_buffer_type(source) == ISC_BUFFERTYPE_TEXT);
|
1999-03-08 18:55:28 +00:00
|
|
|
if (target == NULL && name->buffer != NULL) {
|
|
|
|
target = name->buffer;
|
|
|
|
isc_buffer_clear(target);
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(isc_buffer_type(target) == ISC_BUFFERTYPE_BINARY);
|
1999-02-06 01:26:00 +00:00
|
|
|
REQUIRE((name->attributes & DNS_NAMEATTR_READONLY) == 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
INIT_OFFSETS(name, offsets, odata);
|
1999-02-06 01:26:00 +00:00
|
|
|
offsets[0] = 0;
|
1999-01-09 00:33:15 +00:00
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Initialize things to make the compiler happy; they're not required.
|
|
|
|
*/
|
|
|
|
n1 = 0;
|
|
|
|
n2 = 0;
|
|
|
|
vlen = 0;
|
|
|
|
label = NULL;
|
|
|
|
digits = 0;
|
|
|
|
value = 0;
|
|
|
|
count = 0;
|
|
|
|
tbcount = 0;
|
|
|
|
bitlength = 0;
|
|
|
|
maxlength = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_init;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Invalidate 'name'.
|
|
|
|
*/
|
1999-01-06 05:41:20 +00:00
|
|
|
name->magic = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
name->ndata = NULL;
|
|
|
|
name->length = 0;
|
|
|
|
name->labels = 0;
|
1999-02-06 01:26:00 +00:00
|
|
|
name->attributes = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up the state machine.
|
|
|
|
*/
|
1999-01-06 05:41:20 +00:00
|
|
|
tdata = (char *)source->base + source->current;
|
|
|
|
tlen = source->used - source->current;
|
|
|
|
tused = 0;
|
|
|
|
ndata = (unsigned char *)target->base + target->used;
|
|
|
|
nrem = target->length - target->used;
|
1998-12-04 02:27:01 +00:00
|
|
|
if (nrem > 255)
|
|
|
|
nrem = 255;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused = 0;
|
1998-12-04 02:27:01 +00:00
|
|
|
labels = 0;
|
1999-01-04 19:14:00 +00:00
|
|
|
done = ISC_FALSE;
|
|
|
|
saw_bitstring = ISC_FALSE;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_init;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
while (nrem > 0 && tlen > 0 && !done) {
|
|
|
|
c = *tdata++;
|
|
|
|
tlen--;
|
1999-01-06 05:41:20 +00:00
|
|
|
tused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
no_read:
|
|
|
|
switch (state) {
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_init:
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Is this the root name?
|
|
|
|
*/
|
|
|
|
if (c == '.') {
|
|
|
|
if (tlen != 0)
|
|
|
|
return (DNS_R_EMPTYLABEL);
|
|
|
|
labels++;
|
|
|
|
*ndata++ = 0;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-04 19:14:00 +00:00
|
|
|
done = ISC_TRUE;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
1999-02-06 01:26:00 +00:00
|
|
|
if (c == '@' && tlen == 0) {
|
|
|
|
state = ft_at;
|
|
|
|
break;
|
1999-01-27 23:39:40 +00:00
|
|
|
}
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/* FALLTHROUGH */
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_start:
|
1998-12-04 02:27:01 +00:00
|
|
|
label = ndata;
|
|
|
|
ndata++;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
count = 0;
|
|
|
|
if (c == '\\') {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_initialescape;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_ordinary;
|
|
|
|
state = ft_ordinary;
|
1998-12-04 02:27:01 +00:00
|
|
|
/* FALLTHROUGH */
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_ordinary:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c == '.') {
|
|
|
|
if (count == 0)
|
|
|
|
return (DNS_R_EMPTYLABEL);
|
|
|
|
*label = count;
|
|
|
|
labels++;
|
1999-02-06 01:26:00 +00:00
|
|
|
INSIST(labels <= 127);
|
|
|
|
offsets[labels] = nused;
|
1998-12-04 02:27:01 +00:00
|
|
|
if (tlen == 0) {
|
|
|
|
labels++;
|
|
|
|
*ndata++ = 0;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-04 19:14:00 +00:00
|
|
|
done = ISC_TRUE;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_start;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (c == '\\') {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_escape;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else {
|
|
|
|
if (count >= 63)
|
|
|
|
return (DNS_R_LABELTOOLONG);
|
|
|
|
count++;
|
1998-12-05 01:42:30 +00:00
|
|
|
CONVERTTOASCII(c);
|
1998-12-04 02:27:01 +00:00
|
|
|
if (downcase)
|
|
|
|
c = maptolower[(int)c];
|
|
|
|
*ndata++ = c;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_initialescape:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c == '[') {
|
1999-01-04 19:14:00 +00:00
|
|
|
saw_bitstring = ISC_TRUE;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_bitstring;
|
|
|
|
state = ft_bitstring;
|
1998-12-04 02:27:01 +00:00
|
|
|
*label = DNS_LABELTYPE_BITSTRING;
|
|
|
|
label = ndata;
|
|
|
|
ndata++;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_ordinary;
|
|
|
|
state = ft_escape;
|
1998-12-04 02:27:01 +00:00
|
|
|
/* FALLTHROUGH */
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_escape:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isdigit(c)) {
|
|
|
|
if (count >= 63)
|
|
|
|
return (DNS_R_LABELTOOLONG);
|
|
|
|
count++;
|
1998-12-05 01:42:30 +00:00
|
|
|
CONVERTTOASCII(c);
|
1998-12-04 02:27:01 +00:00
|
|
|
if (downcase)
|
|
|
|
c = maptolower[(int)c];
|
|
|
|
*ndata++ = c;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_ordinary;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
digits = 0;
|
|
|
|
value = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_escdecimal;
|
1998-12-04 02:27:01 +00:00
|
|
|
/* FALLTHROUGH */
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_escdecimal:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isdigit(c))
|
|
|
|
return (DNS_R_BADESCAPE);
|
|
|
|
value *= 10;
|
|
|
|
value += digitvalue[(int)c];
|
|
|
|
digits++;
|
|
|
|
if (digits == 3) {
|
|
|
|
if (value > 255)
|
|
|
|
return (DNS_R_BADESCAPE);
|
|
|
|
if (count >= 63)
|
|
|
|
return (DNS_R_LABELTOOLONG);
|
|
|
|
count++;
|
|
|
|
if (downcase)
|
|
|
|
value = maptolower[value];
|
|
|
|
*ndata++ = value;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_ordinary;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_bitstring:
|
1998-12-04 02:27:01 +00:00
|
|
|
/* count is zero */
|
|
|
|
tbcount = 0;
|
|
|
|
value = 0;
|
|
|
|
if (c == 'b') {
|
|
|
|
vlen = 8;
|
|
|
|
maxlength = 256;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_binary;
|
|
|
|
state = ft_binary;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (c == 'o') {
|
|
|
|
vlen = 8;
|
|
|
|
maxlength = 256;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_octal;
|
|
|
|
state = ft_octal;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (c == 'x') {
|
|
|
|
vlen = 8;
|
|
|
|
maxlength = 256;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_hex;
|
|
|
|
state = ft_hex;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else if (isdigit(c)) {
|
|
|
|
vlen = 32;
|
|
|
|
maxlength = 32;
|
|
|
|
n1 = 0;
|
|
|
|
n2 = 0;
|
|
|
|
digits = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
kind = ft_dottedquad;
|
|
|
|
state = ft_dqdecimal;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
} else
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_binary:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c != '0' && c != '1') {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_maybeslash;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
value <<= 1;
|
|
|
|
if (c == '1')
|
|
|
|
value |= 1;
|
|
|
|
count++;
|
|
|
|
tbcount++;
|
|
|
|
if (tbcount > 256)
|
|
|
|
return (DNS_R_BITSTRINGTOOLONG);
|
|
|
|
if (count == 8) {
|
|
|
|
*ndata++ = value;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
count = 0;
|
|
|
|
}
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_octal:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isdigit(c) || c == '9') {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_maybeslash;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
value <<= 3;
|
|
|
|
value += digitvalue[(int)c];
|
|
|
|
count += 3;
|
|
|
|
tbcount += 3;
|
|
|
|
if (tbcount > 256)
|
|
|
|
return (DNS_R_BITSTRINGTOOLONG);
|
|
|
|
if (count == 8) {
|
|
|
|
*ndata++ = value;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
count = 0;
|
|
|
|
} else if (count == 9) {
|
|
|
|
*ndata++ = (value >> 1);
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
value &= 1;
|
|
|
|
count = 1;
|
|
|
|
} else if (count == 10) {
|
|
|
|
*ndata++ = (value >> 2);
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
value &= 3;
|
|
|
|
count = 2;
|
|
|
|
}
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_hex:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isxdigit(c)) {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_maybeslash;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
value <<= 4;
|
|
|
|
value += digitvalue[(int)c];
|
|
|
|
count += 4;
|
|
|
|
tbcount += 4;
|
|
|
|
if (tbcount > 256)
|
|
|
|
return (DNS_R_BITSTRINGTOOLONG);
|
|
|
|
if (count == 8) {
|
|
|
|
*ndata++ = value;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
count = 0;
|
|
|
|
}
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_dottedquad:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c != '.' && n1 < 3)
|
|
|
|
return (DNS_R_BADDOTTEDQUAD);
|
|
|
|
dqchars[n1] = value;
|
|
|
|
n2 *= 256;
|
|
|
|
n2 += value;
|
|
|
|
n1++;
|
|
|
|
if (n1 == 4) {
|
|
|
|
tbcount = 32;
|
|
|
|
value = n2;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_maybeslash;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
value = 0;
|
|
|
|
digits = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_dqdecimal;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_dqdecimal:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isdigit(c)) {
|
|
|
|
if (digits == 0 || value > 255)
|
|
|
|
return (DNS_R_BADDOTTEDQUAD);
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_dottedquad;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
digits++;
|
|
|
|
if (digits > 3)
|
|
|
|
return (DNS_R_BADDOTTEDQUAD);
|
|
|
|
value *= 10;
|
|
|
|
value += digitvalue[(int)c];
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_maybeslash:
|
1998-12-04 02:27:01 +00:00
|
|
|
bitlength = 0;
|
|
|
|
if (c == '/') {
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_bitlength;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* FALLTHROUGH */
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_finishbitstring:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c == ']') {
|
|
|
|
if (tbcount == 0)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
if (count > 0) {
|
|
|
|
n1 = count % 8;
|
|
|
|
if (n1 != 0)
|
|
|
|
value <<= (8 - n1);
|
|
|
|
*ndata++ = value;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
if (bitlength != 0) {
|
|
|
|
if (bitlength > tbcount)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
1999-01-06 05:41:20 +00:00
|
|
|
if (kind == ft_binary &&
|
1998-12-04 02:27:01 +00:00
|
|
|
bitlength != tbcount) {
|
|
|
|
return (DNS_R_BADBITSTRING);
|
1999-01-06 05:41:20 +00:00
|
|
|
} else if (kind == ft_octal) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Figure out correct number
|
|
|
|
* of octal digits for the
|
|
|
|
* bitlength, and compare to
|
|
|
|
* what was given.
|
|
|
|
*/
|
|
|
|
n1 = bitlength / 3;
|
|
|
|
if (bitlength % 3 != 0)
|
|
|
|
n1++;
|
|
|
|
n2 = tbcount / 3;
|
|
|
|
/* tbcount % 3 == 0 */
|
|
|
|
if (n1 != n2)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
1999-01-06 05:41:20 +00:00
|
|
|
} else if (kind == ft_hex) {
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* Figure out correct number
|
|
|
|
* of hex digits for the
|
|
|
|
* bitlength, and compare to
|
|
|
|
* what was given.
|
|
|
|
*/
|
|
|
|
n1 = bitlength / 4;
|
|
|
|
if (bitlength % 4 != 0)
|
|
|
|
n1++;
|
|
|
|
n2 = tbcount / 4;
|
|
|
|
/* tbcount % 4 == 0 */
|
|
|
|
if (n1 != n2)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
}
|
|
|
|
n1 = bitlength % vlen;
|
|
|
|
if (n1 != 0) {
|
|
|
|
/*
|
|
|
|
* Are the pad bits in the
|
|
|
|
* last 'vlen' bits zero?
|
|
|
|
*/
|
|
|
|
if ((value &
|
|
|
|
~((~0) << (vlen-n1))) != 0)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
} else if (kind == ft_dottedquad)
|
1998-12-04 02:27:01 +00:00
|
|
|
bitlength = 32;
|
|
|
|
else
|
|
|
|
bitlength = tbcount;
|
1999-01-06 05:41:20 +00:00
|
|
|
if (kind == ft_dottedquad) {
|
1998-12-04 02:27:01 +00:00
|
|
|
n1 = bitlength / 8;
|
|
|
|
if (bitlength % 8 != 0)
|
|
|
|
n1++;
|
|
|
|
if (nrem < n1)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
for (n2 = 0; n2 < n1; n2++) {
|
|
|
|
*ndata++ = dqchars[n2];
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (bitlength == 256)
|
|
|
|
*label = 0;
|
|
|
|
else
|
|
|
|
*label = bitlength;
|
|
|
|
labels++;
|
1999-02-06 01:26:00 +00:00
|
|
|
INSIST(labels <= 127);
|
|
|
|
offsets[labels] = nused;
|
1998-12-04 02:27:01 +00:00
|
|
|
} else
|
|
|
|
return (DNS_R_BADBITSTRING);
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_eatdot;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_bitlength:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!isdigit(c)) {
|
|
|
|
if (bitlength == 0)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_finishbitstring;
|
1998-12-04 02:27:01 +00:00
|
|
|
goto no_read;
|
|
|
|
}
|
|
|
|
bitlength *= 10;
|
|
|
|
bitlength += digitvalue[(int)c];
|
|
|
|
if (bitlength > maxlength)
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
case ft_eatdot:
|
1998-12-04 02:27:01 +00:00
|
|
|
if (c != '.')
|
|
|
|
return (DNS_R_BADBITSTRING);
|
|
|
|
if (tlen == 0) {
|
|
|
|
labels++;
|
|
|
|
*ndata++ = 0;
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-04 19:14:00 +00:00
|
|
|
done = ISC_TRUE;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
state = ft_start;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
default:
|
1999-01-06 05:41:20 +00:00
|
|
|
FATAL_ERROR(__FILE__, __LINE__,
|
|
|
|
"Unexpected state %d", state);
|
|
|
|
/* Does not return. */
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
if (!done) {
|
|
|
|
if (nrem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
1999-01-06 05:41:20 +00:00
|
|
|
INSIST(tlen == 0);
|
1999-01-27 23:39:40 +00:00
|
|
|
if (state != ft_ordinary && state != ft_eatdot &&
|
|
|
|
state != ft_at)
|
1998-12-04 02:27:01 +00:00
|
|
|
return (DNS_R_UNEXPECTEDEND);
|
1999-01-06 05:41:20 +00:00
|
|
|
if (state == ft_ordinary) {
|
|
|
|
INSIST(count != 0);
|
1998-12-04 02:27:01 +00:00
|
|
|
*label = count;
|
|
|
|
labels++;
|
1999-02-06 01:26:00 +00:00
|
|
|
INSIST(labels <= 127);
|
|
|
|
offsets[labels] = nused;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
if (origin != NULL) {
|
1998-12-04 02:27:01 +00:00
|
|
|
if (nrem < origin->length)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
label = origin->ndata;
|
|
|
|
n1 = origin->length;
|
|
|
|
nrem -= n1;
|
|
|
|
while (n1 > 0) {
|
1999-02-06 01:26:00 +00:00
|
|
|
n2 = *label++;
|
|
|
|
if (n2 <= 63) {
|
|
|
|
*ndata++ = n2;
|
|
|
|
n1 -= n2 + 1;
|
|
|
|
nused += n2 + 1;
|
|
|
|
while (n2 > 0) {
|
|
|
|
c = *label++;
|
|
|
|
if (downcase)
|
|
|
|
c = maptolower[(int)c];
|
|
|
|
*ndata++ = c;
|
|
|
|
n2--;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
INSIST(n2 == DNS_LABELTYPE_BITSTRING);
|
|
|
|
*ndata++ = n2;
|
|
|
|
bitlength = *label++;
|
|
|
|
*ndata++ = bitlength;
|
|
|
|
if (bitlength == 0)
|
|
|
|
bitlength = 256;
|
|
|
|
n2 = bitlength / 8;
|
|
|
|
if (bitlength % 8 != 0)
|
|
|
|
n2++;
|
|
|
|
n1 -= n2 + 2;
|
|
|
|
nused += n2 + 2;
|
|
|
|
while (n2 > 0) {
|
|
|
|
*ndata++ = *label++;
|
|
|
|
n2--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
labels++;
|
|
|
|
if (n1 > 0) {
|
|
|
|
INSIST(labels <= 127);
|
|
|
|
offsets[labels] = nused;
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-02-06 01:26:00 +00:00
|
|
|
if ((origin->attributes & DNS_NAMEATTR_ABSOLUTE) != 0)
|
|
|
|
name->attributes |= DNS_NAMEATTR_ABSOLUTE;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-02-06 01:26:00 +00:00
|
|
|
} else
|
|
|
|
name->attributes |= DNS_NAMEATTR_ABSOLUTE;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
name->magic = NAME_MAGIC;
|
|
|
|
name->ndata = (unsigned char *)target->base + target->used;
|
1998-12-04 02:27:01 +00:00
|
|
|
name->labels = labels;
|
1999-01-13 19:17:22 +00:00
|
|
|
name->length = nused;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
if (saw_bitstring)
|
1999-01-09 00:33:15 +00:00
|
|
|
compact(name, offsets);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
isc_buffer_forward(source, tused);
|
|
|
|
isc_buffer_add(target, name->length);
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
return (DNS_R_SUCCESS);
|
|
|
|
}
|
|
|
|
|
|
|
|
dns_result_t
|
1999-01-04 19:14:00 +00:00
|
|
|
dns_name_totext(dns_name_t *name, isc_boolean_t omit_final_dot,
|
1999-01-06 05:41:20 +00:00
|
|
|
isc_buffer_t *target)
|
1998-12-04 02:27:01 +00:00
|
|
|
{
|
|
|
|
unsigned char *ndata;
|
|
|
|
char *tdata;
|
|
|
|
unsigned int nlen, tlen;
|
|
|
|
unsigned char c;
|
|
|
|
unsigned int trem, count;
|
|
|
|
unsigned int bytes, nibbles;
|
|
|
|
size_t i, len;
|
|
|
|
unsigned int labels;
|
1999-01-04 19:14:00 +00:00
|
|
|
isc_boolean_t saw_root = ISC_FALSE;
|
1998-12-04 02:27:01 +00:00
|
|
|
char num[4];
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function assumes the name is in proper uncompressed
|
|
|
|
* wire format.
|
|
|
|
*/
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(VALID_NAME(name));
|
1998-12-04 02:27:01 +00:00
|
|
|
REQUIRE(name->labels > 0);
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(isc_buffer_type(target) == ISC_BUFFERTYPE_TEXT);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
ndata = name->ndata;
|
|
|
|
nlen = name->length;
|
|
|
|
labels = name->labels;
|
1999-01-06 05:41:20 +00:00
|
|
|
tdata = (char *)target->base + target->used;
|
|
|
|
tlen = target->length - target->used;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
trem = tlen;
|
|
|
|
|
|
|
|
/* Special handling for root label. */
|
|
|
|
if (nlen == 1 && labels == 1 && *ndata == 0) {
|
1999-01-04 19:14:00 +00:00
|
|
|
saw_root = ISC_TRUE;
|
1998-12-04 02:27:01 +00:00
|
|
|
labels = 0;
|
|
|
|
nlen = 0;
|
|
|
|
if (trem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = '.';
|
|
|
|
trem--;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (labels > 0 && nlen > 0 && trem > 0) {
|
|
|
|
labels--;
|
|
|
|
count = *ndata++;
|
|
|
|
nlen--;
|
|
|
|
if (count == 0) {
|
1999-01-04 19:14:00 +00:00
|
|
|
saw_root = ISC_TRUE;
|
1998-12-04 02:27:01 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (count < 64) {
|
|
|
|
INSIST(nlen >= count);
|
|
|
|
while (count > 0) {
|
|
|
|
c = *ndata;
|
|
|
|
switch (c) {
|
|
|
|
case 0x22: /* '"' */
|
|
|
|
case 0x2E: /* '.' */
|
|
|
|
case 0x3B: /* ';' */
|
|
|
|
case 0x5C: /* '\\' */
|
|
|
|
/* Special modifiers in zone files. */
|
|
|
|
case 0x40: /* '@' */
|
|
|
|
case 0x24: /* '$' */
|
|
|
|
if (trem < 2)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = '\\';
|
|
|
|
*tdata++ = c;
|
|
|
|
ndata++;
|
|
|
|
trem -= 2;
|
|
|
|
nlen--;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
if (c > 0x20 && c < 0x7f) {
|
|
|
|
if (trem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = c;
|
|
|
|
ndata++;
|
|
|
|
trem--;
|
|
|
|
nlen--;
|
|
|
|
} else {
|
|
|
|
if (trem < 4)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
sprintf(tdata, "\\%03u",
|
|
|
|
c);
|
|
|
|
tdata += 4;
|
|
|
|
trem -= 4;
|
|
|
|
ndata++;
|
|
|
|
nlen--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
count--;
|
|
|
|
}
|
|
|
|
} else if (count == DNS_LABELTYPE_BITSTRING) {
|
|
|
|
if (trem < 3)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = '\\';
|
|
|
|
*tdata++ = '[';
|
|
|
|
*tdata++ = 'x';
|
|
|
|
trem -= 3;
|
|
|
|
INSIST(nlen > 0);
|
|
|
|
count = *ndata++;
|
|
|
|
if (count == 0)
|
|
|
|
count = 256;
|
|
|
|
nlen--;
|
|
|
|
len = sprintf(num, "%u", count); /* XXX */
|
|
|
|
INSIST(len <= 4);
|
|
|
|
bytes = count / 8;
|
|
|
|
if (count % 8 != 0)
|
|
|
|
bytes++;
|
|
|
|
INSIST(nlen >= bytes);
|
|
|
|
nibbles = count / 4;
|
|
|
|
if (count % 4 != 0)
|
|
|
|
nibbles++;
|
|
|
|
if (trem < nibbles)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
trem -= nibbles;
|
|
|
|
nlen -= bytes;
|
|
|
|
while (nibbles > 0) {
|
|
|
|
c = *ndata++;
|
|
|
|
*tdata++ = hexdigits[(c >> 4)];
|
|
|
|
nibbles--;
|
|
|
|
if (nibbles != 0) {
|
|
|
|
*tdata++ = hexdigits[c & 0xf];
|
|
|
|
i++;
|
|
|
|
nibbles--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (trem < 2 + len)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = '/';
|
|
|
|
for (i = 0; i < len; i++)
|
|
|
|
*tdata++ = num[i];
|
|
|
|
*tdata++ = ']';
|
|
|
|
trem -= 2 + len;
|
1999-01-06 05:41:20 +00:00
|
|
|
} else {
|
|
|
|
FATAL_ERROR(__FILE__, __LINE__,
|
|
|
|
"Unexpected label type %02x", count);
|
|
|
|
/* Does not return. */
|
|
|
|
}
|
|
|
|
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* The following assumes names are absolute. If not, we
|
|
|
|
* fix things up later. Note that this means that in some
|
|
|
|
* cases one more byte of text buffer is required than is
|
|
|
|
* needed in the final output.
|
|
|
|
*/
|
|
|
|
if (trem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*tdata++ = '.';
|
|
|
|
trem--;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nlen != 0 && trem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
INSIST(nlen == 0);
|
|
|
|
if (!saw_root || omit_final_dot)
|
|
|
|
trem++;
|
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
isc_buffer_add(target, tlen - trem);
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
return (DNS_R_SUCCESS);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
1999-01-09 00:33:15 +00:00
|
|
|
set_offsets(dns_name_t *name, unsigned char *offsets, isc_boolean_t set_labels,
|
1999-02-06 01:26:00 +00:00
|
|
|
isc_boolean_t set_length, isc_boolean_t set_absolute)
|
1999-01-09 00:33:15 +00:00
|
|
|
{
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned int offset, count, nlabels, nrem, n;
|
|
|
|
unsigned char *ndata;
|
1999-02-06 01:26:00 +00:00
|
|
|
isc_boolean_t absolute = ISC_FALSE;
|
1998-12-04 02:27:01 +00:00
|
|
|
|
|
|
|
ndata = name->ndata;
|
|
|
|
nrem = name->length;
|
|
|
|
offset = 0;
|
|
|
|
nlabels = 0;
|
|
|
|
while (nrem > 0) {
|
|
|
|
INSIST(nlabels < 128);
|
1999-01-09 00:33:15 +00:00
|
|
|
offsets[nlabels++] = offset;
|
1998-12-04 02:27:01 +00:00
|
|
|
count = *ndata++;
|
|
|
|
nrem--;
|
|
|
|
offset++;
|
1999-02-06 01:26:00 +00:00
|
|
|
if (count == 0) {
|
|
|
|
absolute = ISC_TRUE;
|
1998-12-21 13:45:03 +00:00
|
|
|
break;
|
1999-02-06 01:26:00 +00:00
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
if (count > 63) {
|
|
|
|
INSIST(count == DNS_LABELTYPE_BITSTRING);
|
|
|
|
INSIST(nrem != 0);
|
1999-01-09 01:17:09 +00:00
|
|
|
n = *ndata++;
|
1998-12-04 02:27:01 +00:00
|
|
|
nrem--;
|
|
|
|
offset++;
|
1999-01-09 01:17:09 +00:00
|
|
|
if (n == 0)
|
|
|
|
n = 256;
|
|
|
|
count = n / 8;
|
|
|
|
if (n % 8 != 0)
|
|
|
|
count++;
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
INSIST(nrem >= count);
|
|
|
|
nrem -= count;
|
|
|
|
offset += count;
|
|
|
|
ndata += count;
|
|
|
|
}
|
|
|
|
if (set_labels)
|
|
|
|
name->labels = nlabels;
|
1998-12-21 13:45:03 +00:00
|
|
|
if (set_length)
|
|
|
|
name->length = offset;
|
1999-02-06 01:26:00 +00:00
|
|
|
if (set_absolute) {
|
|
|
|
if (absolute)
|
|
|
|
name->attributes |= DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
else
|
|
|
|
name->attributes &= ~DNS_NAMEATTR_ABSOLUTE;
|
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
INSIST(nlabels == name->labels);
|
1999-01-09 01:17:09 +00:00
|
|
|
INSIST(offset == name->length);
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
1999-01-09 00:33:15 +00:00
|
|
|
compact(dns_name_t *name, unsigned char *offsets) {
|
1998-12-04 02:27:01 +00:00
|
|
|
unsigned char *head, *curr, *last;
|
|
|
|
unsigned int count, n, bit;
|
|
|
|
unsigned int headbits, currbits, tailbits, newbits;
|
|
|
|
unsigned int headrem, newrem;
|
|
|
|
unsigned int headindex, currindex, tailindex, newindex;
|
|
|
|
unsigned char tail[32];
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The caller MUST ensure that all bitstrings are correctly formatted
|
|
|
|
* and that the offsets table is valid.
|
|
|
|
*/
|
|
|
|
|
|
|
|
again:
|
|
|
|
memset(tail, 0, sizeof tail);
|
|
|
|
INSIST(name->labels != 0);
|
|
|
|
n = name->labels - 1;
|
|
|
|
|
|
|
|
while (n > 0) {
|
1999-01-09 00:33:15 +00:00
|
|
|
head = &name->ndata[offsets[n]];
|
1998-12-04 02:27:01 +00:00
|
|
|
if (head[0] == DNS_LABELTYPE_BITSTRING && head[1] != 0) {
|
|
|
|
if (n != 0) {
|
|
|
|
n--;
|
1999-01-09 00:33:15 +00:00
|
|
|
curr = &name->ndata[offsets[n]];
|
1998-12-04 02:27:01 +00:00
|
|
|
if (curr[0] != DNS_LABELTYPE_BITSTRING)
|
1999-03-02 19:55:17 +00:00
|
|
|
continue;
|
1998-12-04 02:27:01 +00:00
|
|
|
/*
|
|
|
|
* We have consecutive bitstrings labels, and
|
|
|
|
* the more significant label ('head') has
|
|
|
|
* space.
|
|
|
|
*/
|
|
|
|
currbits = curr[1];
|
|
|
|
if (currbits == 0)
|
|
|
|
currbits = 256;
|
|
|
|
currindex = 0;
|
|
|
|
headbits = head[1];
|
|
|
|
if (headbits == 0)
|
|
|
|
headbits = 256;
|
|
|
|
headindex = headbits;
|
|
|
|
count = 256 - headbits;
|
|
|
|
if (count > currbits)
|
|
|
|
count = currbits;
|
|
|
|
headrem = headbits % 8;
|
|
|
|
if (headrem != 0)
|
|
|
|
headrem = 8 - headrem;
|
|
|
|
if (headrem != 0) {
|
|
|
|
if (headrem > count)
|
|
|
|
headrem = count;
|
|
|
|
do {
|
|
|
|
bit = get_bit(&curr[2],
|
|
|
|
currindex);
|
|
|
|
set_bit(&head[2], headindex,
|
|
|
|
bit);
|
|
|
|
currindex++;
|
|
|
|
headindex++;
|
|
|
|
headbits++;
|
|
|
|
count--;
|
|
|
|
headrem--;
|
|
|
|
} while (headrem != 0);
|
|
|
|
}
|
|
|
|
tailindex = 0;
|
|
|
|
tailbits = 0;
|
|
|
|
while (count > 0) {
|
|
|
|
bit = get_bit(&curr[2], currindex);
|
|
|
|
set_bit(tail, tailindex, bit);
|
|
|
|
currindex++;
|
|
|
|
tailindex++;
|
|
|
|
tailbits++;
|
|
|
|
count--;
|
|
|
|
}
|
|
|
|
newbits = 0;
|
|
|
|
newindex = 0;
|
|
|
|
if (currindex < currbits) {
|
|
|
|
while (currindex < currbits) {
|
|
|
|
bit = get_bit(&curr[2],
|
|
|
|
currindex);
|
|
|
|
set_bit(&curr[2], newindex,
|
|
|
|
bit);
|
|
|
|
currindex++;
|
|
|
|
newindex++;
|
|
|
|
newbits++;
|
|
|
|
}
|
|
|
|
INSIST(newbits < 256);
|
|
|
|
curr[1] = newbits;
|
|
|
|
count = newbits / 8;
|
|
|
|
newrem = newbits % 8;
|
|
|
|
/* Zero remaining pad bits, if any. */
|
|
|
|
if (newrem != 0) {
|
|
|
|
count++;
|
|
|
|
newrem = 8 - newrem;
|
|
|
|
while (newrem > 0) {
|
|
|
|
set_bit(&curr[2],
|
|
|
|
newindex,
|
|
|
|
0);
|
|
|
|
newrem--;
|
|
|
|
newindex++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
curr += count + 2;
|
|
|
|
} else {
|
|
|
|
/* We got rid of curr. */
|
|
|
|
name->labels--;
|
|
|
|
}
|
|
|
|
/* copy head, then tail, then rest to curr. */
|
|
|
|
count = headbits + tailbits;
|
|
|
|
INSIST(count <= 256);
|
|
|
|
curr[0] = DNS_LABELTYPE_BITSTRING;
|
|
|
|
if (count == 256)
|
|
|
|
curr[1] = 0;
|
|
|
|
else
|
|
|
|
curr[1] = count;
|
|
|
|
curr += 2;
|
|
|
|
head += 2;
|
|
|
|
count = headbits / 8;
|
|
|
|
if (headbits % 8 != 0)
|
|
|
|
count++;
|
|
|
|
while (count > 0) {
|
|
|
|
*curr++ = *head++;
|
|
|
|
count--;
|
|
|
|
}
|
|
|
|
count = tailbits / 8;
|
|
|
|
if (tailbits % 8 != 0)
|
|
|
|
count++;
|
|
|
|
last = tail;
|
|
|
|
while (count > 0) {
|
|
|
|
*curr++ = *last++;
|
|
|
|
count--;
|
|
|
|
}
|
|
|
|
last = name->ndata + name->length;
|
|
|
|
while (head != last)
|
|
|
|
*curr++ = *head++;
|
|
|
|
name->length = (curr - name->ndata);
|
1999-03-02 19:55:17 +00:00
|
|
|
/*
|
|
|
|
* The offsets table may now be invalid.
|
|
|
|
*/
|
|
|
|
set_offsets(name, offsets, ISC_FALSE,
|
|
|
|
ISC_FALSE, ISC_FALSE);
|
1998-12-04 02:27:01 +00:00
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
n--;
|
1998-12-21 13:45:03 +00:00
|
|
|
}
|
1998-12-04 02:27:01 +00:00
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
dns_result_t
|
|
|
|
dns_name_fromwire(dns_name_t *name, isc_buffer_t *source,
|
|
|
|
dns_decompress_t *dctx, isc_boolean_t downcase,
|
|
|
|
isc_buffer_t *target)
|
|
|
|
{
|
|
|
|
unsigned char *cdata, *ndata;
|
1999-02-24 06:31:35 +00:00
|
|
|
unsigned int cused, hops, nrem, nused, labels, n, i, ll;
|
|
|
|
unsigned int current, new_current, biggest_pointer, lcount;
|
|
|
|
isc_boolean_t saw_bitstring, done, local;
|
1999-01-06 05:41:20 +00:00
|
|
|
fw_state state = fw_start;
|
|
|
|
unsigned int c;
|
1999-01-09 00:33:15 +00:00
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
1999-02-24 06:31:35 +00:00
|
|
|
dns_name_t suffix;
|
|
|
|
dns_label_t label;
|
|
|
|
dns_labeltype_t labeltype;
|
|
|
|
unsigned int bits;
|
|
|
|
dns_bitlabel_t bit;
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the possibly-compressed name at source into target,
|
|
|
|
* decompressing it.
|
|
|
|
*/
|
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
REQUIRE(VALID_NAME(name));
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(isc_buffer_type(source) == ISC_BUFFERTYPE_BINARY);
|
1999-03-08 18:55:28 +00:00
|
|
|
if (target == NULL && name->buffer != NULL) {
|
|
|
|
target = name->buffer;
|
|
|
|
isc_buffer_clear(target);
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
REQUIRE(isc_buffer_type(target) == ISC_BUFFERTYPE_BINARY);
|
1999-01-06 20:04:41 +00:00
|
|
|
REQUIRE(dctx != NULL);
|
1999-02-06 01:26:00 +00:00
|
|
|
REQUIRE((name->attributes & DNS_NAMEATTR_READONLY) == 0);
|
1999-01-06 05:41:20 +00:00
|
|
|
|
1999-01-09 00:33:15 +00:00
|
|
|
INIT_OFFSETS(name, offsets, odata);
|
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
/*
|
|
|
|
* Invalidate 'name'.
|
|
|
|
*/
|
|
|
|
name->magic = 0;
|
|
|
|
name->ndata = NULL;
|
|
|
|
name->length = 0;
|
|
|
|
name->labels = 0;
|
1999-02-06 01:26:00 +00:00
|
|
|
name->attributes = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Initialize things to make the compiler happy; they're not required.
|
|
|
|
*/
|
|
|
|
n = 0;
|
|
|
|
new_current = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up.
|
|
|
|
*/
|
|
|
|
labels = 0;
|
|
|
|
hops = 0;
|
1999-02-24 06:31:35 +00:00
|
|
|
local = ISC_FALSE;
|
1999-01-06 05:41:20 +00:00
|
|
|
saw_bitstring = ISC_FALSE;
|
|
|
|
done = ISC_FALSE;
|
|
|
|
ndata = (unsigned char *)target->base + target->used;
|
|
|
|
nrem = target->length - target->used;
|
|
|
|
if (nrem > 255)
|
|
|
|
nrem = 255;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused = 0;
|
1999-01-06 05:41:20 +00:00
|
|
|
cdata = (unsigned char *)source->base + source->current;
|
|
|
|
cused = 0;
|
|
|
|
current = source->current;
|
|
|
|
biggest_pointer = current;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Note: The following code is not optimized for speed, but
|
|
|
|
* rather for correctness. Speed will be addressed in the future.
|
|
|
|
*/
|
|
|
|
|
1999-02-15 23:59:36 +00:00
|
|
|
while (current < source->active && !done) {
|
1999-01-06 05:41:20 +00:00
|
|
|
c = *cdata++;
|
|
|
|
current++;
|
|
|
|
if (hops == 0)
|
|
|
|
cused++;
|
|
|
|
|
|
|
|
switch (state) {
|
|
|
|
case fw_start:
|
|
|
|
if (c < 64) {
|
|
|
|
labels++;
|
|
|
|
if (nrem < c + 1)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
nrem -= c + 1;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused += c + 1;
|
1999-01-06 05:41:20 +00:00
|
|
|
*ndata++ = c;
|
|
|
|
if (c == 0)
|
|
|
|
done = ISC_TRUE;
|
|
|
|
n = c;
|
|
|
|
state = fw_ordinary;
|
1999-02-24 06:31:35 +00:00
|
|
|
} else if (c >= 128 && c < 192) {
|
|
|
|
/*
|
|
|
|
* 14 bit local compression pointer.
|
|
|
|
*/
|
|
|
|
if ((dctx->allowed & DNS_COMPRESS_LOCAL) ==
|
|
|
|
0)
|
|
|
|
return (DNS_R_DISALLOWED);
|
|
|
|
local = ISC_TRUE;
|
|
|
|
new_current = c & 0x3F;
|
|
|
|
n = 1;
|
|
|
|
state = fw_newcurrent;
|
1999-01-06 05:41:20 +00:00
|
|
|
} else if (c >= 192) {
|
1999-01-06 20:04:41 +00:00
|
|
|
/*
|
|
|
|
* Ordinary 14-bit pointer.
|
|
|
|
*/
|
|
|
|
if ((dctx->allowed & DNS_COMPRESS_GLOBAL14) ==
|
|
|
|
0)
|
|
|
|
return (DNS_R_DISALLOWED);
|
1999-02-24 06:31:35 +00:00
|
|
|
local = ISC_FALSE;
|
1999-01-06 05:41:20 +00:00
|
|
|
new_current = c & 0x3F;
|
|
|
|
n = 1;
|
|
|
|
state = fw_newcurrent;
|
|
|
|
} else if (c == DNS_LABELTYPE_BITSTRING) {
|
|
|
|
labels++;
|
|
|
|
if (nrem == 0)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
nrem--;
|
1999-01-13 19:17:22 +00:00
|
|
|
nused++;
|
1999-01-06 05:41:20 +00:00
|
|
|
*ndata++ = c;
|
|
|
|
saw_bitstring = ISC_TRUE;
|
|
|
|
state = fw_bitstring;
|
|
|
|
} else if (c == DNS_LABELTYPE_GLOBALCOMP16) {
|
1999-01-06 20:04:41 +00:00
|
|
|
/*
|
|
|
|
* 16-bit pointer.
|
|
|
|
*/
|
|
|
|
if ((dctx->allowed & DNS_COMPRESS_GLOBAL16) ==
|
|
|
|
0)
|
|
|
|
return (DNS_R_DISALLOWED);
|
1999-02-24 06:31:35 +00:00
|
|
|
local = ISC_FALSE;
|
1999-01-06 05:41:20 +00:00
|
|
|
new_current = 0;
|
|
|
|
n = 2;
|
|
|
|
state = fw_newcurrent;
|
|
|
|
} else if (c == DNS_LABELTYPE_LOCALCOMP) {
|
1999-01-06 20:04:41 +00:00
|
|
|
/*
|
1999-02-24 06:31:35 +00:00
|
|
|
* 16 bit local compression.
|
1999-01-06 20:04:41 +00:00
|
|
|
*/
|
1999-02-18 01:24:59 +00:00
|
|
|
if ((dctx->allowed & DNS_COMPRESS_LOCAL) ==
|
1999-01-06 20:04:41 +00:00
|
|
|
0)
|
|
|
|
return (DNS_R_DISALLOWED);
|
1999-02-24 06:31:35 +00:00
|
|
|
local = ISC_TRUE;
|
|
|
|
new_current = 0;
|
|
|
|
n = 2;
|
|
|
|
state = fw_newcurrent;
|
1999-01-06 05:41:20 +00:00
|
|
|
} else
|
|
|
|
return (DNS_R_BADLABELTYPE);
|
|
|
|
break;
|
|
|
|
case fw_ordinary:
|
|
|
|
if (downcase)
|
|
|
|
c = maptolower[c];
|
|
|
|
/* FALLTHROUGH */
|
|
|
|
case fw_copy:
|
|
|
|
*ndata++ = c;
|
|
|
|
n--;
|
|
|
|
if (n == 0)
|
|
|
|
state = fw_start;
|
|
|
|
break;
|
|
|
|
case fw_bitstring:
|
|
|
|
if (c == 0)
|
1999-02-15 23:59:36 +00:00
|
|
|
n = 256 / 8;
|
|
|
|
else
|
|
|
|
n = c / 8;
|
|
|
|
if ((c % 8) != 0)
|
1999-01-06 05:41:20 +00:00
|
|
|
n++;
|
1999-02-15 23:59:36 +00:00
|
|
|
if (nrem < n + 1)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
nrem -= n + 1;
|
|
|
|
nused += n + 1;
|
|
|
|
*ndata++ = c;
|
1999-01-06 05:41:20 +00:00
|
|
|
state = fw_copy;
|
|
|
|
break;
|
|
|
|
case fw_newcurrent:
|
|
|
|
new_current *= 256;
|
|
|
|
new_current += c;
|
|
|
|
n--;
|
1999-02-24 06:31:35 +00:00
|
|
|
if (n != 0)
|
|
|
|
break;
|
|
|
|
if (local && new_current < 256) {
|
|
|
|
/* logical label count */
|
|
|
|
lcount = dctx->owner_name.labels;
|
|
|
|
i = 0;
|
|
|
|
ll = 0;
|
|
|
|
while (i < lcount && ll < new_current) {
|
|
|
|
dns_name_getlabel(&dctx->owner_name,
|
|
|
|
i, &label);
|
|
|
|
labeltype = dns_label_type(&label);
|
|
|
|
if (labeltype ==
|
|
|
|
dns_labeltype_ordinary) {
|
|
|
|
i++;
|
|
|
|
ll++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
INSIST(labeltype ==
|
|
|
|
dns_labeltype_bitstring);
|
|
|
|
bits = dns_label_countbits(&label);
|
|
|
|
if (bits + ll <= new_current) {
|
|
|
|
i++;
|
|
|
|
ll += bits;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i == lcount)
|
1999-01-06 05:41:20 +00:00
|
|
|
return (DNS_R_BADPOINTER);
|
1999-02-24 06:31:35 +00:00
|
|
|
bits = new_current - ll;
|
|
|
|
if (bits != 0) {
|
|
|
|
if (nrem < 2 + (bits + 7) / 8)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*ndata++ = DNS_LABELTYPE_BITSTRING;
|
|
|
|
*ndata++ = bits;
|
|
|
|
ndata[bits/8] = 0;
|
|
|
|
while (bits) {
|
|
|
|
bit = dns_label_getbit(&label,
|
|
|
|
bits);
|
|
|
|
set_bit(ndata, bits, bit);
|
|
|
|
bits--;
|
|
|
|
}
|
|
|
|
ndata += (new_current - ll + 7) / 8;
|
|
|
|
labels++;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
dns_name_init(&suffix, NULL);
|
|
|
|
dns_name_getlabelsequence(&dctx->owner_name, i,
|
|
|
|
lcount - i, &suffix);
|
|
|
|
if (suffix.length > nrem)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
memcpy(ndata, suffix.ndata, suffix.length);
|
|
|
|
ndata += suffix.length;
|
|
|
|
nused += suffix.length;
|
|
|
|
nrem -= suffix.length;
|
|
|
|
labels += suffix.labels;
|
|
|
|
done = ISC_TRUE;
|
|
|
|
break;
|
1999-01-06 05:41:20 +00:00
|
|
|
}
|
1999-02-24 06:31:35 +00:00
|
|
|
if (local)
|
|
|
|
new_current += dctx->rdata - 256;
|
|
|
|
if (new_current >= biggest_pointer)
|
|
|
|
return (DNS_R_BADPOINTER);
|
|
|
|
biggest_pointer = new_current;
|
|
|
|
current = new_current;
|
|
|
|
cdata = (unsigned char *)source->base +
|
|
|
|
current;
|
|
|
|
hops++;
|
|
|
|
if (hops > DNS_POINTER_MAXHOPS)
|
|
|
|
return (DNS_R_TOOMANYHOPS);
|
|
|
|
state = fw_start;
|
1999-01-06 05:41:20 +00:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
FATAL_ERROR(__FILE__, __LINE__,
|
|
|
|
"Unknown state %d", state);
|
|
|
|
/* Does not return. */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!done)
|
|
|
|
return (DNS_R_UNEXPECTEDEND);
|
|
|
|
|
|
|
|
name->magic = NAME_MAGIC;
|
|
|
|
name->ndata = (unsigned char *)target->base + target->used;
|
|
|
|
name->labels = labels;
|
1999-01-13 19:17:22 +00:00
|
|
|
name->length = nused;
|
1999-02-06 01:26:00 +00:00
|
|
|
name->attributes |= DNS_NAMEATTR_ABSOLUTE;
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* We should build the offsets table directly.
|
|
|
|
*/
|
1999-01-09 00:33:15 +00:00
|
|
|
if (name->offsets != NULL || saw_bitstring)
|
1999-02-06 01:26:00 +00:00
|
|
|
set_offsets(name, offsets, ISC_FALSE, ISC_FALSE, ISC_FALSE);
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
if (saw_bitstring)
|
1999-01-09 00:33:15 +00:00
|
|
|
compact(name, offsets);
|
1999-01-06 05:41:20 +00:00
|
|
|
|
|
|
|
isc_buffer_forward(source, cused);
|
|
|
|
isc_buffer_add(target, name->length);
|
|
|
|
|
|
|
|
return (DNS_R_SUCCESS);
|
|
|
|
}
|
|
|
|
|
|
|
|
dns_result_t
|
|
|
|
dns_name_towire(dns_name_t *name, dns_compress_t *cctx,
|
|
|
|
isc_buffer_t *target)
|
|
|
|
{
|
1999-02-22 07:24:05 +00:00
|
|
|
unsigned int methods;
|
|
|
|
unsigned int offset;
|
|
|
|
dns_name_t gp, gs;
|
|
|
|
dns_name_t lp, ls;
|
|
|
|
isc_boolean_t gf;
|
|
|
|
isc_boolean_t lf;
|
1999-03-04 02:44:30 +00:00
|
|
|
isc_uint16_t go;
|
|
|
|
isc_uint16_t lo;
|
1999-02-22 07:24:05 +00:00
|
|
|
unsigned char gb[257];
|
|
|
|
unsigned char lb[257];
|
|
|
|
isc_buffer_t gws;
|
|
|
|
isc_buffer_t lws;
|
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
/*
|
|
|
|
* Convert 'name' into wire format, compressing it as specified by the
|
|
|
|
* compression context 'cctx', and storing the result in 'target'.
|
|
|
|
*/
|
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
REQUIRE(cctx != NULL);
|
|
|
|
REQUIRE(isc_buffer_type(target) == ISC_BUFFERTYPE_BINARY);
|
|
|
|
|
1999-02-22 07:24:05 +00:00
|
|
|
dns_name_init(&lp, NULL);
|
|
|
|
dns_name_init(&gp, NULL);
|
|
|
|
dns_name_init(&ls, NULL);
|
|
|
|
dns_name_init(&gs, NULL);
|
|
|
|
isc_buffer_init(&gws, gb, sizeof gb, ISC_BUFFERTYPE_BINARY);
|
|
|
|
isc_buffer_init(&lws, lb, sizeof lb, ISC_BUFFERTYPE_BINARY);
|
|
|
|
|
|
|
|
offset = target->used; /*XXX*/
|
|
|
|
|
|
|
|
methods = dns_compress_getmethods(cctx);
|
|
|
|
|
|
|
|
if ((methods & DNS_COMPRESS_GLOBAL) != 0)
|
|
|
|
gf = dns_compress_findglobal(cctx, name, &gp, &gs, &go, &gws);
|
|
|
|
else
|
|
|
|
gf = ISC_FALSE;
|
|
|
|
|
|
|
|
if ((methods & DNS_COMPRESS_LOCAL) != 0)
|
|
|
|
lf = dns_compress_findlocal(cctx, name, &lp, &ls, &lo, &lws);
|
|
|
|
else
|
|
|
|
lf = ISC_FALSE;
|
|
|
|
|
|
|
|
/* find the best compression */
|
|
|
|
if (lf && gf) {
|
|
|
|
if (lp.length < gp.length)
|
|
|
|
gf = ISC_FALSE;
|
|
|
|
else
|
|
|
|
lf = ISC_FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (gf) {
|
|
|
|
if (target->length - target->used < gp.length)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
(void)memcpy((unsigned char *)target->base + target->used,
|
|
|
|
gp.ndata, (size_t)gp.length);
|
|
|
|
isc_buffer_add(target, gp.length);
|
|
|
|
if (go < 16384) {
|
|
|
|
go |= 0xc000;
|
|
|
|
if (target->length - target->used < 2)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
isc_buffer_putuint16(target, go);
|
|
|
|
} else {
|
|
|
|
if (target->length - target->used < 3)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*((unsigned char*)target->base + target->used) =
|
|
|
|
DNS_LABELTYPE_GLOBALCOMP16;
|
|
|
|
isc_buffer_add(target, 1);
|
|
|
|
isc_buffer_putuint16(target, go);
|
|
|
|
}
|
|
|
|
if (gp.length != 0)
|
1999-03-11 00:26:21 +00:00
|
|
|
dns_compress_add(cctx, &gp, &gs, offset, ISC_FALSE);
|
1999-02-22 07:24:05 +00:00
|
|
|
} else if (lf) {
|
|
|
|
if (target->length - target->used < lp.length)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
(void)memcpy((unsigned char *)target->base + target->used,
|
|
|
|
lp.ndata, (size_t)lp.length);
|
|
|
|
isc_buffer_add(target, lp.length);
|
|
|
|
if (lo < 16384) {
|
|
|
|
lo |= 0x8000;
|
|
|
|
if (target->length - target->used < 2)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
isc_buffer_putuint16(target, lo);
|
|
|
|
} else {
|
|
|
|
if (target->length - target->used < 3)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
*((unsigned char*)target->base + target->used) =
|
|
|
|
DNS_LABELTYPE_LOCALCOMP;
|
|
|
|
isc_buffer_add(target, 1);
|
|
|
|
isc_buffer_putuint16(target, lo);
|
|
|
|
}
|
|
|
|
if (lp.length != 0)
|
1999-03-11 00:26:21 +00:00
|
|
|
dns_compress_add(cctx, &lp, &ls, offset, ISC_TRUE);
|
1999-02-22 07:24:05 +00:00
|
|
|
} else {
|
|
|
|
if (target->length - target->used < name->length)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
(void)memcpy((unsigned char *)target->base + target->used,
|
|
|
|
name->ndata, (size_t)name->length);
|
|
|
|
isc_buffer_add(target, name->length);
|
1999-03-11 00:26:21 +00:00
|
|
|
dns_compress_add(cctx, name, NULL, offset, ISC_FALSE);
|
1999-02-22 07:24:05 +00:00
|
|
|
}
|
|
|
|
return (DNS_R_SUCCESS);
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
|
1999-02-22 07:24:05 +00:00
|
|
|
dns_result_t
|
1999-02-26 00:25:12 +00:00
|
|
|
dns_name_concatenate(dns_name_t *prefix, dns_name_t *suffix, dns_name_t *name,
|
|
|
|
isc_buffer_t *target)
|
1999-02-22 07:24:05 +00:00
|
|
|
{
|
|
|
|
unsigned char *ndata;
|
|
|
|
unsigned char *offsets;
|
|
|
|
dns_offsets_t odata;
|
|
|
|
unsigned int nrem;
|
|
|
|
unsigned int labels;
|
|
|
|
unsigned int count;
|
1999-03-08 18:55:28 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Concatenate 'prefix' and 'suffix', storing the result in 'target'.
|
|
|
|
*/
|
1999-02-22 07:24:05 +00:00
|
|
|
|
|
|
|
REQUIRE(VALID_NAME(prefix));
|
1999-02-26 00:25:12 +00:00
|
|
|
if (prefix->labels != 0 &&
|
|
|
|
(prefix->attributes & DNS_NAMEATTR_ABSOLUTE) != 0)
|
|
|
|
REQUIRE(suffix == NULL);
|
1999-02-22 07:24:05 +00:00
|
|
|
if (suffix != NULL)
|
|
|
|
REQUIRE(VALID_NAME(suffix));
|
1999-03-08 18:55:28 +00:00
|
|
|
REQUIRE(VALID_NAME(name));
|
|
|
|
if (target == NULL && name->buffer != NULL) {
|
|
|
|
target = name->buffer;
|
|
|
|
isc_buffer_clear(target);
|
|
|
|
}
|
1999-02-22 07:24:05 +00:00
|
|
|
REQUIRE(isc_buffer_type(target) == ISC_BUFFERTYPE_BINARY);
|
|
|
|
REQUIRE((name->attributes & DNS_NAMEATTR_READONLY) == 0);
|
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
/*
|
|
|
|
* Invalidate 'name'.
|
|
|
|
*/
|
|
|
|
name->magic = 0;
|
|
|
|
name->ndata = NULL;
|
|
|
|
name->length = 0;
|
|
|
|
name->labels = 0;
|
|
|
|
name->attributes = 0;
|
1999-02-26 00:25:12 +00:00
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
/*
|
|
|
|
* Set up.
|
|
|
|
*/
|
1999-02-22 07:24:05 +00:00
|
|
|
nrem = target->length - target->used;
|
|
|
|
ndata = (unsigned char *)target->base + target->used;
|
|
|
|
if (nrem > 255)
|
|
|
|
nrem = 255;
|
1999-02-26 00:25:12 +00:00
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
/*
|
|
|
|
* Copy prefix.
|
|
|
|
*/
|
1999-02-26 00:25:12 +00:00
|
|
|
count = prefix->length;
|
|
|
|
labels = prefix->labels;
|
1999-02-22 07:24:05 +00:00
|
|
|
if (count > nrem)
|
1999-01-06 05:41:20 +00:00
|
|
|
return (DNS_R_NOSPACE);
|
1999-02-22 07:24:05 +00:00
|
|
|
memcpy(ndata, prefix->ndata, count);
|
|
|
|
nrem -= count;
|
|
|
|
ndata += count;
|
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
/*
|
|
|
|
* Append suffix.
|
|
|
|
*/
|
1999-02-22 07:24:05 +00:00
|
|
|
if (suffix != NULL) {
|
1999-02-26 00:25:12 +00:00
|
|
|
count = suffix->length;
|
|
|
|
labels += suffix->labels;
|
1999-02-22 07:24:05 +00:00
|
|
|
if (count > nrem)
|
|
|
|
return (DNS_R_NOSPACE);
|
|
|
|
memcpy(ndata, suffix->ndata, count);
|
|
|
|
ndata += count;
|
|
|
|
}
|
1999-01-06 05:41:20 +00:00
|
|
|
|
1999-03-08 18:55:28 +00:00
|
|
|
name->magic = NAME_MAGIC;
|
1999-02-22 07:24:05 +00:00
|
|
|
name->ndata = (unsigned char *)target->base + target->used;
|
|
|
|
name->labels = labels;
|
|
|
|
name->length = ndata - name->ndata;
|
|
|
|
|
|
|
|
INIT_OFFSETS(name, offsets, odata);
|
1999-02-26 00:25:12 +00:00
|
|
|
if (name->length > 0) {
|
|
|
|
set_offsets(name, offsets, ISC_FALSE, ISC_FALSE, ISC_TRUE);
|
|
|
|
compact(name, offsets);
|
1999-03-08 18:55:28 +00:00
|
|
|
}
|
1999-02-22 07:24:05 +00:00
|
|
|
|
|
|
|
isc_buffer_add(target, name->length);
|
1999-03-08 18:55:28 +00:00
|
|
|
|
1999-01-06 05:41:20 +00:00
|
|
|
return (DNS_R_SUCCESS);
|
|
|
|
}
|